About the Execution of ITS-Tools for DES-PT-05b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 333.479 | 52720.00 | 84068.00 | 484.30 | FFTTFTFFTFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r042-smll-165252095700444.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095700444
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 6.8K Apr 29 15:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 15:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 15:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 15:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 73K May 10 09:33 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 DES-PT-05b-LTLFireability-00
FORMULA_NAME DES-PT-05b-LTLFireability-01
FORMULA_NAME DES-PT-05b-LTLFireability-02
FORMULA_NAME DES-PT-05b-LTLFireability-03
FORMULA_NAME DES-PT-05b-LTLFireability-04
FORMULA_NAME DES-PT-05b-LTLFireability-05
FORMULA_NAME DES-PT-05b-LTLFireability-06
FORMULA_NAME DES-PT-05b-LTLFireability-07
FORMULA_NAME DES-PT-05b-LTLFireability-08
FORMULA_NAME DES-PT-05b-LTLFireability-09
FORMULA_NAME DES-PT-05b-LTLFireability-10
FORMULA_NAME DES-PT-05b-LTLFireability-11
FORMULA_NAME DES-PT-05b-LTLFireability-12
FORMULA_NAME DES-PT-05b-LTLFireability-13
FORMULA_NAME DES-PT-05b-LTLFireability-14
FORMULA_NAME DES-PT-05b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652727313682
Running Version 202205111006
[2022-05-16 18:55:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 18:55:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:55:15] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2022-05-16 18:55:15] [INFO ] Transformed 300 places.
[2022-05-16 18:55:15] [INFO ] Transformed 251 transitions.
[2022-05-16 18:55:15] [INFO ] Found NUPN structural information;
[2022-05-16 18:55:15] [INFO ] Parsed PT model containing 300 places and 251 transitions in 373 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-05b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 297 transition count 251
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 276 transition count 230
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 276 transition count 230
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 57 place count 264 transition count 218
Iterating global reduction 1 with 12 rules applied. Total rules applied 69 place count 264 transition count 218
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 80 place count 264 transition count 207
Applied a total of 80 rules in 91 ms. Remains 264 /300 variables (removed 36) and now considering 207/251 (removed 44) transitions.
// Phase 1: matrix 207 rows 264 cols
[2022-05-16 18:55:16] [INFO ] Computed 62 place invariants in 33 ms
[2022-05-16 18:55:16] [INFO ] Implicit Places using invariants in 474 ms returned []
// Phase 1: matrix 207 rows 264 cols
[2022-05-16 18:55:16] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-16 18:55:17] [INFO ] Implicit Places using invariants and state equation in 674 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1195 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/300 places, 207/251 transitions.
Applied a total of 0 rules in 17 ms. Remains 263 /263 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 263/300 places, 207/251 transitions.
Support contains 38 out of 263 places after structural reductions.
[2022-05-16 18:55:17] [INFO ] Flatten gal took : 111 ms
[2022-05-16 18:55:17] [INFO ] Flatten gal took : 47 ms
[2022-05-16 18:55:18] [INFO ] Input system was already deterministic with 207 transitions.
Support contains 36 out of 263 places (down from 38) after GAL structural reductions.
Finished random walk after 2731 steps, including 23 resets, run visited all 27 properties in 354 ms. (steps per millisecond=7 )
Computed a total of 80 stabilizing places and 73 stable transitions
Graph (complete) has 485 edges and 263 vertex of which 257 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.17 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 258 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 258 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 258 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 255 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 255 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 255 transition count 197
Applied a total of 18 rules in 56 ms. Remains 255 /263 variables (removed 8) and now considering 197/207 (removed 10) transitions.
// Phase 1: matrix 197 rows 255 cols
[2022-05-16 18:55:19] [INFO ] Computed 61 place invariants in 6 ms
[2022-05-16 18:55:19] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 197 rows 255 cols
[2022-05-16 18:55:19] [INFO ] Computed 61 place invariants in 5 ms
[2022-05-16 18:55:19] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 255 cols
[2022-05-16 18:55:19] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 18:55:20] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/263 places, 197/207 transitions.
Finished structural reductions, in 1 iterations. Remains : 255/263 places, 197/207 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 335 steps with 3 reset in 8 ms.
FORMULA DES-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-00 finished in 1501 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X(F(p0))))))'
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 207/207 transitions.
Graph (complete) has 485 edges and 263 vertex of which 257 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 256 transition count 187
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 241 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 239 transition count 185
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 35 place count 239 transition count 174
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 57 place count 228 transition count 174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 60 place count 225 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 225 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 225 transition count 169
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 67 place count 224 transition count 168
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 69 place count 222 transition count 166
Iterating global reduction 5 with 2 rules applied. Total rules applied 71 place count 222 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 72 place count 222 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 72 place count 222 transition count 164
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 74 place count 221 transition count 164
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 226 place count 145 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 230 place count 143 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 232 place count 141 transition count 88
Applied a total of 232 rules in 184 ms. Remains 141 /263 variables (removed 122) and now considering 88/207 (removed 119) transitions.
// Phase 1: matrix 88 rows 141 cols
[2022-05-16 18:55:20] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 18:55:20] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 88 rows 141 cols
[2022-05-16 18:55:20] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-16 18:55:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 18:55:21] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2022-05-16 18:55:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 88 rows 141 cols
[2022-05-16 18:55:21] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 18:55:21] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/263 places, 88/207 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/263 places, 88/207 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 248 steps with 46 reset in 5 ms.
FORMULA DES-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-01 finished in 874 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||p1))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 207/207 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 257 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 257 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 257 transition count 200
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 253 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 253 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 253 transition count 194
Applied a total of 23 rules in 23 ms. Remains 253 /263 variables (removed 10) and now considering 194/207 (removed 13) transitions.
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:21] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:21] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:21] [INFO ] Computed 61 place invariants in 8 ms
[2022-05-16 18:55:21] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:21] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 18:55:22] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/263 places, 194/207 transitions.
Finished structural reductions, in 1 iterations. Remains : 253/263 places, 194/207 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-05b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(EQ s3 1), p1:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 536 ms.
Product exploration explored 100000 steps with 50000 reset in 402 ms.
Computed a total of 76 stabilizing places and 69 stable transitions
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.8 ms
Computed a total of 76 stabilizing places and 69 stable transitions
Detected a total of 76/253 stabilizing places and 69/194 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 300 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 380 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:24] [INFO ] Computed 61 place invariants in 4 ms
[2022-05-16 18:55:24] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned sat
[2022-05-16 18:55:24] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 52 ms returned sat
[2022-05-16 18:55:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:55:25] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2022-05-16 18:55:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:55:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2022-05-16 18:55:25] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 52 ms returned sat
[2022-05-16 18:55:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:55:26] [INFO ] [Nat]Absence check using state equation in 890 ms returned sat
[2022-05-16 18:55:26] [INFO ] Computed and/alt/rep : 192/350/192 causal constraints (skipped 1 transitions) in 37 ms.
[2022-05-16 18:55:26] [INFO ] Added : 0 causal constraints over 0 iterations in 115 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 194/194 transitions.
Applied a total of 0 rules in 9 ms. Remains 253 /253 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:26] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:26] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:26] [INFO ] Computed 61 place invariants in 1 ms
[2022-05-16 18:55:27] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:27] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:27] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 253/253 places, 194/194 transitions.
Computed a total of 76 stabilizing places and 69 stable transitions
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 76 stabilizing places and 69 stable transitions
Detected a total of 76/253 stabilizing places and 69/194 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 384 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 423 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:28] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 18:55:28] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned sat
[2022-05-16 18:55:28] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 79 ms returned sat
[2022-05-16 18:55:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:55:29] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2022-05-16 18:55:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:55:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2022-05-16 18:55:29] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 33 ms returned sat
[2022-05-16 18:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:55:30] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2022-05-16 18:55:30] [INFO ] Computed and/alt/rep : 192/350/192 causal constraints (skipped 1 transitions) in 17 ms.
[2022-05-16 18:55:30] [INFO ] Added : 0 causal constraints over 0 iterations in 84 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 330 ms.
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 194/194 transitions.
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 248 transition count 191
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 248 transition count 193
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 248 transition count 193
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 243 transition count 188
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 243 transition count 188
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 109 place count 243 transition count 191
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 119 place count 233 transition count 181
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 129 place count 233 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 135 place count 233 transition count 209
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 231 transition count 203
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 231 transition count 203
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 139 rules in 112 ms. Remains 231 /253 variables (removed 22) and now considering 203/194 (removed -9) transitions.
[2022-05-16 18:55:31] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 203 rows 231 cols
[2022-05-16 18:55:31] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 18:55:32] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/253 places, 203/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/253 places, 203/194 transitions.
Product exploration explored 100000 steps with 50000 reset in 1996 ms.
Product exploration explored 100000 steps with 50000 reset in 1288 ms.
Built C files in :
/tmp/ltsmin7356746481860530239
[2022-05-16 18:55:35] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7356746481860530239
Running compilation step : cd /tmp/ltsmin7356746481860530239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 641 ms.
Running link step : cd /tmp/ltsmin7356746481860530239;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin7356746481860530239;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2097453267504084732.hoa' '--buchi-type=spotba'
LTSmin run took 80 ms.
FORMULA DES-PT-05b-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-05b-LTLFireability-02 finished in 14920 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(!p0)||p1) U X(!(X(X(G(p2)))||p3))))'
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 207/207 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 257 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 257 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 257 transition count 200
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 253 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 253 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 253 transition count 194
Applied a total of 23 rules in 30 ms. Remains 253 /263 variables (removed 10) and now considering 194/207 (removed 13) transitions.
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:36] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:36] [INFO ] Implicit Places using invariants in 247 ms returned []
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:36] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:36] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:37] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 18:55:37] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/263 places, 194/207 transitions.
Finished structural reductions, in 1 iterations. Remains : 253/263 places, 194/207 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR p2 p3), (OR p3 p2), (OR p2 p3), true, p2, p2, (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=p3, acceptance={} source=1 dest: 3}, { cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0 p3), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={0} source=2 dest: 3}, { cond=(NOT p3), acceptance={0} source=2 dest: 4}, { cond=(AND p0 p3), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s41 1), p0:(AND (EQ s75 1) (EQ s104 1)), p3:(AND (EQ s213 1) (EQ s231 1)), p2:(EQ s224 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 345 ms.
Product exploration explored 100000 steps with 25000 reset in 349 ms.
Computed a total of 76 stabilizing places and 69 stable transitions
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.13 ms
Computed a total of 76 stabilizing places and 69 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p1 p0 p3))), true, (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 744 ms. Reduced automaton from 7 states, 14 edges and 4 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 151 ms :[p2, p2, p2, p2]
Finished random walk after 58 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p1 p0 p3))), true, (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 13 factoid took 526 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 149 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 149 ms :[p2, p2, p2, p2]
Support contains 1 out of 253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 194/194 transitions.
Applied a total of 0 rules in 8 ms. Remains 253 /253 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:39] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:40] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:40] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 18:55:40] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:40] [INFO ] Computed 61 place invariants in 8 ms
[2022-05-16 18:55:41] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 253/253 places, 194/194 transitions.
Computed a total of 76 stabilizing places and 69 stable transitions
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.11 ms
Computed a total of 76 stabilizing places and 69 stable transitions
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 174 ms :[p2, p2, p2, p2]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Knowledge obtained : [(NOT p2), true]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 179 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 149 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 166 ms :[p2, p2, p2, p2]
Product exploration explored 100000 steps with 25000 reset in 318 ms.
Product exploration explored 100000 steps with 25000 reset in 305 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 164 ms :[p2, p2, p2, p2]
Support contains 1 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 194/194 transitions.
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 248 transition count 191
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 15 place count 248 transition count 193
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 24 place count 248 transition count 193
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 243 transition count 188
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 243 transition count 188
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 111 place count 243 transition count 191
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 120 place count 234 transition count 182
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 129 place count 234 transition count 182
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 134 place count 234 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 233 transition count 201
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 233 transition count 201
Deduced a syphon composed of 90 places in 0 ms
Applied a total of 136 rules in 83 ms. Remains 233 /253 variables (removed 20) and now considering 201/194 (removed -7) transitions.
[2022-05-16 18:55:43] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 201 rows 233 cols
[2022-05-16 18:55:43] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-16 18:55:43] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 233/253 places, 201/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 233/253 places, 201/194 transitions.
Product exploration explored 100000 steps with 25000 reset in 1131 ms.
Product exploration explored 100000 steps with 25000 reset in 1124 ms.
Built C files in :
/tmp/ltsmin13520648017252428994
[2022-05-16 18:55:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13520648017252428994
Running compilation step : cd /tmp/ltsmin13520648017252428994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 498 ms.
Running link step : cd /tmp/ltsmin13520648017252428994;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13520648017252428994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16237996207649245991.hoa' '--buchi-type=spotba'
LTSmin run took 597 ms.
FORMULA DES-PT-05b-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-05b-LTLFireability-03 finished in 10615 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G(p0)))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 207/207 transitions.
Graph (complete) has 485 edges and 263 vertex of which 257 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 256 transition count 185
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 239 transition count 185
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 239 transition count 174
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 57 place count 228 transition count 174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 225 transition count 171
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 225 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 225 transition count 169
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 224 transition count 168
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 69 place count 222 transition count 166
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 222 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 222 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 72 place count 222 transition count 164
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 74 place count 221 transition count 164
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 222 place count 147 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 228 place count 144 transition count 98
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 142 transition count 96
Applied a total of 230 rules in 43 ms. Remains 142 /263 variables (removed 121) and now considering 96/207 (removed 111) transitions.
// Phase 1: matrix 96 rows 142 cols
[2022-05-16 18:55:46] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 18:55:47] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 96 rows 142 cols
[2022-05-16 18:55:47] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-16 18:55:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 18:55:47] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2022-05-16 18:55:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 96 rows 142 cols
[2022-05-16 18:55:47] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 18:55:47] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/263 places, 96/207 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/263 places, 96/207 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA DES-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-04 finished in 804 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||F(X((F(p1)&&p2)))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 207/207 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 257 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 257 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 257 transition count 200
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 253 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 253 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 253 transition count 194
Applied a total of 23 rules in 11 ms. Remains 253 /263 variables (removed 10) and now considering 194/207 (removed 13) transitions.
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:47] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:47] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:47] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 18:55:48] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:48] [INFO ] Computed 61 place invariants in 4 ms
[2022-05-16 18:55:48] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/263 places, 194/207 transitions.
Finished structural reductions, in 1 iterations. Remains : 253/263 places, 194/207 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-05b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s135 0), p2:(EQ s52 0), p0:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 553 ms.
Product exploration explored 100000 steps with 50000 reset in 532 ms.
Computed a total of 76 stabilizing places and 69 stable transitions
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 76 stabilizing places and 69 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 14 factoid took 387 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-05b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-05b-LTLFireability-05 finished in 2712 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(G(F(G((G(p0) U p1)))))))))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 207/207 transitions.
Graph (complete) has 485 edges and 263 vertex of which 257 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 256 transition count 187
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 241 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 240 transition count 186
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 33 place count 240 transition count 175
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 55 place count 229 transition count 175
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 58 place count 226 transition count 172
Iterating global reduction 3 with 3 rules applied. Total rules applied 61 place count 226 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 226 transition count 170
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 65 place count 225 transition count 169
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 67 place count 223 transition count 167
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 223 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 70 place count 223 transition count 166
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 70 place count 223 transition count 165
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 72 place count 222 transition count 165
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 222 place count 147 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 228 place count 144 transition count 98
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 142 transition count 96
Applied a total of 230 rules in 83 ms. Remains 142 /263 variables (removed 121) and now considering 96/207 (removed 111) transitions.
// Phase 1: matrix 96 rows 142 cols
[2022-05-16 18:55:50] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 18:55:50] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 96 rows 142 cols
[2022-05-16 18:55:50] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 18:55:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 18:55:51] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2022-05-16 18:55:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 96 rows 142 cols
[2022-05-16 18:55:51] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 18:55:51] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/263 places, 96/207 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/263 places, 96/207 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s94 1), p0:(EQ s136 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 1 ms.
FORMULA DES-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-06 finished in 1092 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(!(G(p1) U X(F(p1))))))'
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 207/207 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 257 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 257 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 257 transition count 200
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 254 transition count 197
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 254 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 254 transition count 195
Applied a total of 21 rules in 22 ms. Remains 254 /263 variables (removed 9) and now considering 195/207 (removed 12) transitions.
// Phase 1: matrix 195 rows 254 cols
[2022-05-16 18:55:51] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:51] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 195 rows 254 cols
[2022-05-16 18:55:51] [INFO ] Computed 61 place invariants in 1 ms
[2022-05-16 18:55:52] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
// Phase 1: matrix 195 rows 254 cols
[2022-05-16 18:55:52] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:52] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 254/263 places, 195/207 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/263 places, 195/207 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s122 1) (EQ s241 1)), p1:(EQ s169 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 269 steps with 1 reset in 1 ms.
FORMULA DES-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-07 finished in 1204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 207/207 transitions.
Graph (complete) has 485 edges and 263 vertex of which 257 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 256 transition count 186
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 240 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 239 transition count 185
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 35 place count 239 transition count 176
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 53 place count 230 transition count 176
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 228 transition count 174
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 228 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 228 transition count 172
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 61 place count 227 transition count 171
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 62 place count 226 transition count 170
Iterating global reduction 5 with 1 rules applied. Total rules applied 63 place count 226 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 64 place count 226 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 64 place count 226 transition count 168
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 66 place count 225 transition count 168
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 216 place count 150 transition count 93
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 222 place count 147 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 145 transition count 99
Applied a total of 224 rules in 78 ms. Remains 145 /263 variables (removed 118) and now considering 99/207 (removed 108) transitions.
// Phase 1: matrix 99 rows 145 cols
[2022-05-16 18:55:52] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 18:55:52] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 99 rows 145 cols
[2022-05-16 18:55:53] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 18:55:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 18:55:53] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2022-05-16 18:55:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 99 rows 145 cols
[2022-05-16 18:55:53] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 18:55:53] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/263 places, 99/207 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/263 places, 99/207 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s60 1) (EQ s64 1)) (AND (EQ s50 1) (EQ s52 1))), p0:(NEQ s137 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-09 finished in 1086 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(F(((p0 U X(p1))&&p2)))&&G(p3)&&p0))))'
Support contains 4 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 258 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 258 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 258 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 255 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 255 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 255 transition count 197
Applied a total of 18 rules in 16 ms. Remains 255 /263 variables (removed 8) and now considering 197/207 (removed 10) transitions.
// Phase 1: matrix 197 rows 255 cols
[2022-05-16 18:55:53] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:54] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 197 rows 255 cols
[2022-05-16 18:55:54] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 18:55:54] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 255 cols
[2022-05-16 18:55:54] [INFO ] Computed 61 place invariants in 1 ms
[2022-05-16 18:55:54] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/263 places, 197/207 transitions.
Finished structural reductions, in 1 iterations. Remains : 255/263 places, 197/207 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p3), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p3), acceptance={} source=1 dest: 2}, { cond=(AND p0 p3), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s45 1), p3:(EQ s80 1), p2:(EQ s72 1), p1:(EQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-10 finished in 1369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X(p0))))'
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 207/207 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 257 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 257 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 257 transition count 200
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 253 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 253 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 253 transition count 194
Applied a total of 23 rules in 16 ms. Remains 253 /263 variables (removed 10) and now considering 194/207 (removed 13) transitions.
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:55] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:55] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:55] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:55] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
// Phase 1: matrix 194 rows 253 cols
[2022-05-16 18:55:55] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:56] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/263 places, 194/207 transitions.
Finished structural reductions, in 1 iterations. Remains : 253/263 places, 194/207 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s52 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 48 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-12 finished in 1089 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(p1))&&F(p2))))'
Support contains 6 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 258 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 258 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 255 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 255 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 255 transition count 198
Applied a total of 17 rules in 15 ms. Remains 255 /263 variables (removed 8) and now considering 198/207 (removed 9) transitions.
// Phase 1: matrix 198 rows 255 cols
[2022-05-16 18:55:56] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 18:55:56] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 198 rows 255 cols
[2022-05-16 18:55:56] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 18:55:56] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
// Phase 1: matrix 198 rows 255 cols
[2022-05-16 18:55:56] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:57] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/263 places, 198/207 transitions.
Finished structural reductions, in 1 iterations. Remains : 255/263 places, 198/207 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s248 1) (NOT (AND (EQ s252 1) (EQ s254 1)))), p2:(EQ s194 1), p1:(AND (EQ s46 1) (EQ s102 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 249 steps with 1 reset in 1 ms.
FORMULA DES-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-13 finished in 1061 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(p0)))||X(p1)))'
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 258 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 258 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 258 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 255 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 255 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 255 transition count 196
Applied a total of 19 rules in 12 ms. Remains 255 /263 variables (removed 8) and now considering 196/207 (removed 11) transitions.
// Phase 1: matrix 196 rows 255 cols
[2022-05-16 18:55:57] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 18:55:57] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 196 rows 255 cols
[2022-05-16 18:55:57] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:58] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
// Phase 1: matrix 196 rows 255 cols
[2022-05-16 18:55:58] [INFO ] Computed 61 place invariants in 2 ms
[2022-05-16 18:55:58] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/263 places, 196/207 transitions.
Finished structural reductions, in 1 iterations. Remains : 255/263 places, 196/207 transitions.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s168 1), p0:(EQ s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2151 reset in 277 ms.
Product exploration explored 100000 steps with 2118 reset in 307 ms.
Computed a total of 78 stabilizing places and 71 stable transitions
Graph (complete) has 469 edges and 255 vertex of which 250 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 78 stabilizing places and 71 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 289 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 196 rows 255 cols
[2022-05-16 18:56:00] [INFO ] Computed 61 place invariants in 3 ms
[2022-05-16 18:56:00] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned sat
[2022-05-16 18:56:00] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 44 ms returned sat
[2022-05-16 18:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:01] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2022-05-16 18:56:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2022-05-16 18:56:01] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 54 ms returned sat
[2022-05-16 18:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:01] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2022-05-16 18:56:01] [INFO ] Computed and/alt/rep : 194/351/194 causal constraints (skipped 1 transitions) in 25 ms.
[2022-05-16 18:56:03] [INFO ] Added : 178 causal constraints over 36 iterations in 1542 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 255 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 196/196 transitions.
Graph (complete) has 469 edges and 255 vertex of which 250 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 249 transition count 177
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 234 transition count 177
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 234 transition count 166
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 223 transition count 166
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 207 place count 146 transition count 89
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 2 with 4 rules applied. Total rules applied 211 place count 144 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 142 transition count 89
Applied a total of 213 rules in 36 ms. Remains 142 /255 variables (removed 113) and now considering 89/196 (removed 107) transitions.
// Phase 1: matrix 89 rows 142 cols
[2022-05-16 18:56:03] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 18:56:03] [INFO ] Implicit Places using invariants in 247 ms returned []
// Phase 1: matrix 89 rows 142 cols
[2022-05-16 18:56:03] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 18:56:04] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2022-05-16 18:56:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 89 rows 142 cols
[2022-05-16 18:56:04] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 18:56:04] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/255 places, 89/196 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/255 places, 89/196 transitions.
Computed a total of 35 stabilizing places and 30 stable transitions
Computed a total of 35 stabilizing places and 30 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 89 rows 142 cols
[2022-05-16 18:56:04] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 18:56:05] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2022-05-16 18:56:05] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2022-05-16 18:56:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:05] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2022-05-16 18:56:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-05-16 18:56:05] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 152 ms returned sat
[2022-05-16 18:56:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:05] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2022-05-16 18:56:05] [INFO ] Computed and/alt/rep : 86/254/86 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-16 18:56:06] [INFO ] Added : 65 causal constraints over 13 iterations in 324 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 38 steps with 3 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-14 finished in 8909 ms.
All properties solved by simple procedures.
Total runtime 50606 ms.
BK_STOP 1652727366402
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="DES-PT-05b"
export BK_EXAMINATION="LTLFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is DES-PT-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-smll-165252095700444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;