Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r103-tall-167814478300420.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DES-PT-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 79K Mar 5 18:22 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-10b-LTLFireability-00
FORMULA_NAME DES-PT-10b-LTLFireability-01
FORMULA_NAME DES-PT-10b-LTLFireability-02
FORMULA_NAME DES-PT-10b-LTLFireability-03
FORMULA_NAME DES-PT-10b-LTLFireability-04
FORMULA_NAME DES-PT-10b-LTLFireability-05
FORMULA_NAME DES-PT-10b-LTLFireability-06
FORMULA_NAME DES-PT-10b-LTLFireability-07
FORMULA_NAME DES-PT-10b-LTLFireability-08
FORMULA_NAME DES-PT-10b-LTLFireability-09
FORMULA_NAME DES-PT-10b-LTLFireability-10
FORMULA_NAME DES-PT-10b-LTLFireability-11
FORMULA_NAME DES-PT-10b-LTLFireability-12
FORMULA_NAME DES-PT-10b-LTLFireability-13
FORMULA_NAME DES-PT-10b-LTLFireability-14
FORMULA_NAME DES-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678251308898

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:55:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 04:55:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:55:10] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-08 04:55:10] [INFO ] Transformed 320 places.
[2023-03-08 04:55:10] [INFO ] Transformed 271 transitions.
[2023-03-08 04:55:10] [INFO ] Found NUPN structural information;
[2023-03-08 04:55:10] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-10b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 271
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 293 transition count 247
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 293 transition count 247
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 282 transition count 236
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 282 transition count 236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 282 transition count 228
Applied a total of 81 rules in 55 ms. Remains 282 /320 variables (removed 38) and now considering 228/271 (removed 43) transitions.
// Phase 1: matrix 228 rows 282 cols
[2023-03-08 04:55:10] [INFO ] Computed 62 place invariants in 27 ms
[2023-03-08 04:55:11] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-08 04:55:11] [INFO ] Invariant cache hit.
[2023-03-08 04:55:11] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2023-03-08 04:55:11] [INFO ] Invariant cache hit.
[2023-03-08 04:55:11] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 282/320 places, 228/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 874 ms. Remains : 282/320 places, 228/271 transitions.
Support contains 44 out of 282 places after structural reductions.
[2023-03-08 04:55:11] [INFO ] Flatten gal took : 40 ms
[2023-03-08 04:55:11] [INFO ] Flatten gal took : 17 ms
[2023-03-08 04:55:11] [INFO ] Input system was already deterministic with 228 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 27) seen :20
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
[2023-03-08 04:55:12] [INFO ] Invariant cache hit.
[2023-03-08 04:55:12] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:55:12] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-08 04:55:12] [INFO ] After 131ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:2
[2023-03-08 04:55:12] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 4 ms to minimize.
[2023-03-08 04:55:12] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2023-03-08 04:55:12] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2023-03-08 04:55:12] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2023-03-08 04:55:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 260 ms
[2023-03-08 04:55:12] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2023-03-08 04:55:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-08 04:55:12] [INFO ] After 474ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-08 04:55:12] [INFO ] After 607ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-08 04:55:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:55:13] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-08 04:55:13] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-08 04:55:13] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-08 04:55:13] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2023-03-08 04:55:13] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2023-03-08 04:55:13] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2023-03-08 04:55:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 159 ms
[2023-03-08 04:55:13] [INFO ] After 401ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-08 04:55:13] [INFO ] After 577ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 216 ms.
Support contains 9 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 279 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 17 rules applied. Total rules applied 18 place count 279 transition count 208
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 33 place count 264 transition count 208
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 264 transition count 198
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 254 transition count 198
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 249 transition count 193
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 249 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 68 place count 249 transition count 188
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 70 place count 248 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 70 place count 248 transition count 185
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 246 transition count 185
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 245 transition count 184
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 245 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 245 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 77 place count 245 transition count 182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 79 place count 244 transition count 182
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 227 place count 170 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 169 transition count 108
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 169 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 168 transition count 107
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 168 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 233 place count 167 transition count 106
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 167 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 166 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 236 place count 165 transition count 105
Applied a total of 236 rules in 82 ms. Remains 165 /282 variables (removed 117) and now considering 105/228 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 165/282 places, 105/228 transitions.
Incomplete random walk after 10000 steps, including 392 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 105 rows 165 cols
[2023-03-08 04:55:14] [INFO ] Computed 63 place invariants in 10 ms
[2023-03-08 04:55:14] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 04:55:14] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-08 04:55:14] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:55:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-08 04:55:14] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 35 ms returned sat
[2023-03-08 04:55:14] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:55:14] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2023-03-08 04:55:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-08 04:55:14] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 04:55:14] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 105/105 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 0 with 1 rules applied. Total rules applied 1 place count 165 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 164 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 163 transition count 103
Applied a total of 3 rules in 10 ms. Remains 163 /165 variables (removed 2) and now considering 103/105 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 163/165 places, 103/105 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1218589 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :{}
Probabilistic random walk after 1218589 steps, saw 160574 distinct states, run finished after 3002 ms. (steps per millisecond=405 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 103 rows 163 cols
[2023-03-08 04:55:17] [INFO ] Computed 63 place invariants in 6 ms
[2023-03-08 04:55:17] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:55:17] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-08 04:55:17] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-08 04:55:17] [INFO ] After 63ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:55:17] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:55:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:55:17] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-08 04:55:17] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:55:17] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2023-03-08 04:55:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-08 04:55:17] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 04:55:17] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 27 ms.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 163 /163 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 163/163 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-08 04:55:17] [INFO ] Invariant cache hit.
[2023-03-08 04:55:18] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-08 04:55:18] [INFO ] Invariant cache hit.
[2023-03-08 04:55:18] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-08 04:55:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:55:18] [INFO ] Invariant cache hit.
[2023-03-08 04:55:18] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 163/163 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 04:55:18] [INFO ] Invariant cache hit.
[2023-03-08 04:55:18] [INFO ] [Real]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-08 04:55:18] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-08 04:55:18] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:55:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:55:18] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-08 04:55:18] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:55:18] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-03-08 04:55:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-08 04:55:18] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 04:55:18] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DES-PT-10b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 97 stabilizing places and 89 stable transitions
Graph (complete) has 549 edges and 282 vertex of which 275 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)&&p0))&&X(X((!X(p2) U p3)))))'
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 276 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 274 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 274 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 274 transition count 214
Applied a total of 22 rules in 12 ms. Remains 274 /282 variables (removed 8) and now considering 214/228 (removed 14) transitions.
// Phase 1: matrix 214 rows 274 cols
[2023-03-08 04:55:18] [INFO ] Computed 62 place invariants in 7 ms
[2023-03-08 04:55:18] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-08 04:55:18] [INFO ] Invariant cache hit.
[2023-03-08 04:55:19] [INFO ] Implicit Places using invariants and state equation in 235 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 348 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/282 places, 214/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 365 ms. Remains : 273/282 places, 214/228 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p3) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p3), (NOT p1), (NOT p3), (OR (NOT p3) p2), true]
Running random walk in product with property : DES-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=p2, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s166 1) (EQ s196 1)), p1:(EQ s138 1), p3:(OR (EQ s138 1) (AND (EQ s243 1) (EQ s269 1))), p2:(AND (EQ s249 1) (EQ s258 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 3 ms.
FORMULA DES-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-00 finished in 753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G((p1&&F(G(p1))))))))'
Support contains 3 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 276 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 274 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 274 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 274 transition count 214
Applied a total of 22 rules in 36 ms. Remains 274 /282 variables (removed 8) and now considering 214/228 (removed 14) transitions.
[2023-03-08 04:55:19] [INFO ] Invariant cache hit.
[2023-03-08 04:55:19] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-08 04:55:19] [INFO ] Invariant cache hit.
[2023-03-08 04:55:20] [INFO ] Implicit Places using invariants and state equation in 275 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 560 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/282 places, 214/228 transitions.
Applied a total of 0 rules in 11 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 608 ms. Remains : 273/282 places, 214/228 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-10b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s105 1) (EQ s107 1)), p1:(EQ s264 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 2 ms.
FORMULA DES-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-02 finished in 751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 276 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 274 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 274 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 274 transition count 214
Applied a total of 22 rules in 21 ms. Remains 274 /282 variables (removed 8) and now considering 214/228 (removed 14) transitions.
[2023-03-08 04:55:20] [INFO ] Invariant cache hit.
[2023-03-08 04:55:20] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-08 04:55:20] [INFO ] Invariant cache hit.
[2023-03-08 04:55:20] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-08 04:55:20] [INFO ] Invariant cache hit.
[2023-03-08 04:55:20] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 274/282 places, 214/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 494 ms. Remains : 274/282 places, 214/228 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-03 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:(AND (EQ s5 1) (EQ s16 1) (EQ s27 1) (EQ s38 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-03 finished in 600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((F(p1)&&F(!p2)) U X(X(X(p1))))))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 277 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 277 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 277 transition count 220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 275 transition count 218
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 275 transition count 218
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 275 transition count 216
Applied a total of 19 rules in 16 ms. Remains 275 /282 variables (removed 7) and now considering 216/228 (removed 12) transitions.
// Phase 1: matrix 216 rows 275 cols
[2023-03-08 04:55:20] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-08 04:55:21] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 04:55:21] [INFO ] Invariant cache hit.
[2023-03-08 04:55:21] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 379 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 274/282 places, 216/228 transitions.
Applied a total of 0 rules in 3 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 398 ms. Remains : 274/282 places, 216/228 transitions.
Stuttering acceptance computed with spot in 768 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p0) (NOT p1)), p2, (AND p2 (NOT p0))]
Running random walk in product with property : DES-PT-10b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}, { cond=p2, acceptance={} source=1 dest: 6}], [{ cond=p2, acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 8}, { cond=(AND p0 p2), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 7}, { cond=(AND p0 p2), acceptance={} source=4 dest: 10}], [{ cond=true, acceptance={} source=5 dest: 11}, { cond=p2, acceptance={} source=5 dest: 12}], [{ cond=p2, acceptance={} source=6 dest: 13}], [{ cond=p2, acceptance={} source=7 dest: 14}], [{ cond=(NOT p0), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 12}, { cond=p0, acceptance={} source=8 dest: 15}, { cond=(AND p0 p2), acceptance={} source=8 dest: 16}], [{ cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 13}, { cond=(AND p0 p2), acceptance={} source=9 dest: 17}], [{ cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 14}, { cond=(AND p0 p2), acceptance={} source=10 dest: 18}], [{ cond=(NOT p1), acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={0} source=11 dest: 12}], [{ cond=(AND (NOT p1) p2), acceptance={} source=12 dest: 13}], [{ cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 14}], [{ cond=(AND (NOT p1) p2), acceptance={} source=14 dest: 19}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=15 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={} source=15 dest: 15}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=15 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=16 dest: 13}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=16 dest: 17}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=17 dest: 14}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=17 dest: 18}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=18 dest: 19}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=18 dest: 20}], [{ cond=p2, acceptance={0} source=19 dest: 19}], [{ cond=(AND (NOT p0) p2), acceptance={} source=20 dest: 19}, { cond=(AND p0 p2), acceptance={} source=20 dest: 20}]], initial=0, aps=[p0:(EQ s100 1), p2:(AND (EQ s60 1) (EQ s111 1)), p1:(NEQ s124 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, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 231 ms.
Product exploration explored 100000 steps with 25000 reset in 174 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 530 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/274 stabilizing places and 89/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 570 ms. Reduced automaton from 21 states, 43 edges and 3 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Finished random walk after 2568 steps, including 24 resets, run visited all 3 properties in 19 ms. (steps per millisecond=135 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 11 factoid took 523 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Support contains 3 out of 274 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 274 cols
[2023-03-08 04:55:24] [INFO ] Computed 61 place invariants in 7 ms
[2023-03-08 04:55:24] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 04:55:24] [INFO ] Invariant cache hit.
[2023-03-08 04:55:24] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2023-03-08 04:55:24] [INFO ] Invariant cache hit.
[2023-03-08 04:55:24] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 274/274 places, 216/216 transitions.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 530 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/274 stabilizing places and 89/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Finished random walk after 381 steps, including 3 resets, run visited all 3 properties in 5 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND p1 (NOT p2)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Product exploration explored 100000 steps with 25000 reset in 124 ms.
Product exploration explored 100000 steps with 25000 reset in 121 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 216/216 transitions.
Graph (complete) has 530 edges and 274 vertex of which 269 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 269 transition count 213
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 269 transition count 215
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 269 transition count 215
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 264 transition count 210
Deduced a syphon composed of 18 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 264 transition count 210
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 110 place count 264 transition count 213
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 119 place count 255 transition count 204
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 128 place count 255 transition count 204
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 133 place count 255 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 253 transition count 218
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 253 transition count 218
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 137 rules in 59 ms. Remains 253 /274 variables (removed 21) and now considering 218/216 (removed -2) transitions.
[2023-03-08 04:55:27] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 218 rows 253 cols
[2023-03-08 04:55:27] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 04:55:27] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/274 places, 218/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 253/274 places, 218/216 transitions.
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 274 cols
[2023-03-08 04:55:27] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-08 04:55:27] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-08 04:55:27] [INFO ] Invariant cache hit.
[2023-03-08 04:55:27] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-08 04:55:27] [INFO ] Invariant cache hit.
[2023-03-08 04:55:27] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 274/274 places, 216/216 transitions.
Treatment of property DES-PT-10b-LTLFireability-04 finished in 6897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 275 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 274 transition count 209
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 260 transition count 209
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 260 transition count 199
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 250 transition count 199
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 246 transition count 195
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 246 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 61 place count 246 transition count 191
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 63 place count 245 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 63 place count 245 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 244 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 66 place count 243 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 243 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 243 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 68 place count 243 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 70 place count 242 transition count 186
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 218 place count 168 transition count 112
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 5 with 4 rules applied. Total rules applied 222 place count 166 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 164 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 225 place count 163 transition count 112
Applied a total of 225 rules in 47 ms. Remains 163 /282 variables (removed 119) and now considering 112/228 (removed 116) transitions.
// Phase 1: matrix 112 rows 163 cols
[2023-03-08 04:55:27] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 04:55:27] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 04:55:27] [INFO ] Invariant cache hit.
[2023-03-08 04:55:28] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-08 04:55:28] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:55:28] [INFO ] Invariant cache hit.
[2023-03-08 04:55:28] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/282 places, 112/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 376 ms. Remains : 163/282 places, 112/228 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s63 0) (EQ s68 0)), p1:(EQ s84 1)], nbAcceptance=1, 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 33 steps with 1 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-05 finished in 496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U G(p1)) U X(!p2)))'
Support contains 6 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 277 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 277 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 277 transition count 220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 275 transition count 218
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 275 transition count 218
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 275 transition count 216
Applied a total of 19 rules in 21 ms. Remains 275 /282 variables (removed 7) and now considering 216/228 (removed 12) transitions.
// Phase 1: matrix 216 rows 275 cols
[2023-03-08 04:55:28] [INFO ] Computed 62 place invariants in 3 ms
[2023-03-08 04:55:28] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 04:55:28] [INFO ] Invariant cache hit.
[2023-03-08 04:55:28] [INFO ] Implicit Places using invariants and state equation in 205 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 325 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 274/282 places, 216/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 351 ms. Remains : 274/282 places, 216/228 transitions.
Stuttering acceptance computed with spot in 340 ms :[p2, p2, (AND p1 (NOT p0) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=p2, acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 8}, { cond=(AND p0 p2), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=(AND p1 p2), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 6}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p0), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(AND (EQ s85 1) (EQ s230 1)), p0:(AND (EQ s76 1) (EQ s256 1)), p2:(AND (EQ s36 1) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 530 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (OR (AND p1 p2) (AND p0 p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 25 factoid took 369 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10b-LTLFireability-06 finished in 1520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U p1))'
Support contains 3 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 276 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 275 transition count 210
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 261 transition count 210
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 261 transition count 200
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 251 transition count 200
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 246 transition count 195
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 246 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 64 place count 246 transition count 190
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 66 place count 245 transition count 189
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 66 place count 245 transition count 187
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 243 transition count 187
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 242 transition count 186
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 242 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 242 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 73 place count 242 transition count 184
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 241 transition count 184
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 223 place count 167 transition count 110
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 5 with 4 rules applied. Total rules applied 227 place count 165 transition count 112
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 228 place count 165 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 163 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 162 transition count 110
Applied a total of 231 rules in 37 ms. Remains 162 /282 variables (removed 120) and now considering 110/228 (removed 118) transitions.
// Phase 1: matrix 110 rows 162 cols
[2023-03-08 04:55:29] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 04:55:29] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 04:55:29] [INFO ] Invariant cache hit.
[2023-03-08 04:55:30] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-08 04:55:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:55:30] [INFO ] Invariant cache hit.
[2023-03-08 04:55:30] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/282 places, 110/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 162/282 places, 110/228 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), p0, p0]
Running random walk in product with property : DES-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s58 1), p0:(AND (EQ s22 1) (EQ s73 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]]
Product exploration explored 100000 steps with 5051 reset in 225 ms.
Product exploration explored 100000 steps with 5104 reset in 263 ms.
Computed a total of 57 stabilizing places and 52 stable transitions
Graph (complete) has 519 edges and 162 vertex of which 160 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 57 stabilizing places and 52 stable transitions
Detected a total of 57/162 stabilizing places and 52/110 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 328 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), p0, p0]
Incomplete random walk after 10000 steps, including 510 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 04:55:31] [INFO ] Invariant cache hit.
[2023-03-08 04:55:31] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 04:55:31] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-08 04:55:31] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:55:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:55:31] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 04:55:31] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:55:31] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 04:55:31] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 110/110 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 108
Applied a total of 4 rules in 6 ms. Remains 160 /162 variables (removed 2) and now considering 108/110 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 160/162 places, 108/110 transitions.
Incomplete random walk after 10000 steps, including 510 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1364778 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :{}
Probabilistic random walk after 1364778 steps, saw 185257 distinct states, run finished after 3001 ms. (steps per millisecond=454 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 108 rows 160 cols
[2023-03-08 04:55:34] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 04:55:34] [INFO ] [Real]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 04:55:34] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:55:34] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:55:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 04:55:34] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 47 ms returned sat
[2023-03-08 04:55:34] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:55:34] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 04:55:34] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 160 /160 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 160/160 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 160 /160 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 04:55:34] [INFO ] Invariant cache hit.
[2023-03-08 04:55:35] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 04:55:35] [INFO ] Invariant cache hit.
[2023-03-08 04:55:35] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-08 04:55:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:55:35] [INFO ] Invariant cache hit.
[2023-03-08 04:55:35] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 160/160 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 04:55:35] [INFO ] Invariant cache hit.
[2023-03-08 04:55:35] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:55:35] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:55:35] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:55:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 04:55:35] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 30 ms returned sat
[2023-03-08 04:55:35] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:55:35] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 04:55:35] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 278 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), p0, p0]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), p0, p0]
// Phase 1: matrix 110 rows 162 cols
[2023-03-08 04:55:36] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 04:55:36] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:55:36] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 04:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:55:36] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-08 04:55:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:55:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:55:36] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-08 04:55:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:55:36] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-03-08 04:55:36] [INFO ] Computed and/alt/rep : 96/251/96 causal constraints (skipped 11 transitions) in 6 ms.
[2023-03-08 04:55:36] [INFO ] Added : 84 causal constraints over 17 iterations in 193 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-08 04:55:36] [INFO ] Invariant cache hit.
[2023-03-08 04:55:36] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-08 04:55:36] [INFO ] Invariant cache hit.
[2023-03-08 04:55:36] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-08 04:55:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:55:36] [INFO ] Invariant cache hit.
[2023-03-08 04:55:36] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 341 ms. Remains : 162/162 places, 110/110 transitions.
Computed a total of 57 stabilizing places and 52 stable transitions
Graph (complete) has 519 edges and 162 vertex of which 160 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 57 stabilizing places and 52 stable transitions
Detected a total of 57/162 stabilizing places and 52/110 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 297 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), p0, p0]
Incomplete random walk after 10000 steps, including 508 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 04:55:37] [INFO ] Invariant cache hit.
[2023-03-08 04:55:37] [INFO ] [Real]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 04:55:37] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:55:37] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:55:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 04:55:37] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 04:55:37] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:55:37] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 04:55:37] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 110/110 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 108
Applied a total of 4 rules in 5 ms. Remains 160 /162 variables (removed 2) and now considering 108/110 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 160/162 places, 108/110 transitions.
Incomplete random walk after 10000 steps, including 516 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1338015 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1338015 steps, saw 182040 distinct states, run finished after 3002 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 108 rows 160 cols
[2023-03-08 04:55:40] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 04:55:40] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:55:40] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:55:40] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:55:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 04:55:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 48 ms returned sat
[2023-03-08 04:55:41] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:55:41] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 04:55:41] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 160/160 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 04:55:41] [INFO ] Invariant cache hit.
[2023-03-08 04:55:41] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 04:55:41] [INFO ] Invariant cache hit.
[2023-03-08 04:55:41] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-08 04:55:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:55:41] [INFO ] Invariant cache hit.
[2023-03-08 04:55:41] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 313 ms. Remains : 160/160 places, 108/108 transitions.
Applied a total of 0 rules in 14 ms. Remains 160 /160 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 04:55:41] [INFO ] Invariant cache hit.
[2023-03-08 04:55:41] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:55:41] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 04:55:41] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:55:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 04:55:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 38 ms returned sat
[2023-03-08 04:55:41] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:55:41] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 04:55:41] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), p0, p0]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), p0, p0]
// Phase 1: matrix 110 rows 162 cols
[2023-03-08 04:55:42] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 04:55:42] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 04:55:42] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 04:55:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:55:42] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-08 04:55:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:55:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:55:42] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-08 04:55:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:55:42] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-03-08 04:55:42] [INFO ] Computed and/alt/rep : 96/251/96 causal constraints (skipped 11 transitions) in 7 ms.
[2023-03-08 04:55:42] [INFO ] Added : 84 causal constraints over 17 iterations in 184 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), p0, p0]
Product exploration explored 100000 steps with 5082 reset in 187 ms.
Product exploration explored 100000 steps with 5028 reset in 210 ms.
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-08 04:55:43] [INFO ] Invariant cache hit.
[2023-03-08 04:55:43] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 04:55:43] [INFO ] Invariant cache hit.
[2023-03-08 04:55:43] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-08 04:55:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:55:43] [INFO ] Invariant cache hit.
[2023-03-08 04:55:43] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 323 ms. Remains : 162/162 places, 110/110 transitions.
Treatment of property DES-PT-10b-LTLFireability-07 finished in 13944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (!p1&&G(!p2))))'
Support contains 5 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 275 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 274 transition count 211
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 262 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 261 transition count 210
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 27 place count 261 transition count 201
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 45 place count 252 transition count 201
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 50 place count 247 transition count 196
Iterating global reduction 3 with 5 rules applied. Total rules applied 55 place count 247 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 60 place count 247 transition count 191
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 62 place count 246 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 62 place count 246 transition count 188
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 66 place count 244 transition count 188
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 243 transition count 187
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 243 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 243 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 69 place count 243 transition count 185
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 71 place count 242 transition count 185
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 6 with 148 rules applied. Total rules applied 219 place count 168 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 221 place count 167 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 223 place count 165 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 224 place count 164 transition count 109
Applied a total of 224 rules in 29 ms. Remains 164 /282 variables (removed 118) and now considering 109/228 (removed 119) transitions.
// Phase 1: matrix 109 rows 164 cols
[2023-03-08 04:55:43] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 04:55:43] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 04:55:43] [INFO ] Invariant cache hit.
[2023-03-08 04:55:43] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-08 04:55:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:55:43] [INFO ] Invariant cache hit.
[2023-03-08 04:55:44] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/282 places, 109/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 164/282 places, 109/228 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR p1 p2), (NOT p0), p2]
Running random walk in product with property : DES-PT-10b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s54 1) (EQ s133 1) (EQ s47 1)), p2:(EQ s158 1), p0:(NEQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3819 reset in 181 ms.
Product exploration explored 100000 steps with 3771 reset in 199 ms.
Computed a total of 57 stabilizing places and 52 stable transitions
Computed a total of 57 stabilizing places and 52 stable transitions
Detected a total of 57/164 stabilizing places and 52/109 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 350 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR p1 p2), (NOT p0), p2]
Finished random walk after 12 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p2), (F (OR p1 p2)), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 401 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR p1 p2), (NOT p0), p2]
Stuttering acceptance computed with spot in 110 ms :[(OR p1 p2), (NOT p0), p2]
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 109/109 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 04:55:45] [INFO ] Invariant cache hit.
[2023-03-08 04:55:45] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-08 04:55:45] [INFO ] Invariant cache hit.
[2023-03-08 04:55:46] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-08 04:55:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:55:46] [INFO ] Invariant cache hit.
[2023-03-08 04:55:46] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 308 ms. Remains : 164/164 places, 109/109 transitions.
Computed a total of 57 stabilizing places and 52 stable transitions
Computed a total of 57 stabilizing places and 52 stable transitions
Detected a total of 57/164 stabilizing places and 52/109 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 391 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR p1 p2), (NOT p0), p2]
Finished random walk after 9 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p2), (F (OR p1 p2)), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 530 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR p1 p2), (NOT p0), p2]
Stuttering acceptance computed with spot in 106 ms :[(OR p1 p2), (NOT p0), p2]
Stuttering acceptance computed with spot in 131 ms :[(OR p1 p2), (NOT p0), p2]
Product exploration explored 100000 steps with 3800 reset in 183 ms.
Product exploration explored 100000 steps with 3806 reset in 205 ms.
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 04:55:47] [INFO ] Invariant cache hit.
[2023-03-08 04:55:48] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 04:55:48] [INFO ] Invariant cache hit.
[2023-03-08 04:55:48] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-08 04:55:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:55:48] [INFO ] Invariant cache hit.
[2023-03-08 04:55:48] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 164/164 places, 109/109 transitions.
Treatment of property DES-PT-10b-LTLFireability-10 finished in 4514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1&&G(p2))||p0)))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 277 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 277 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 277 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 276 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 276 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 276 transition count 217
Applied a total of 17 rules in 12 ms. Remains 276 /282 variables (removed 6) and now considering 217/228 (removed 11) transitions.
// Phase 1: matrix 217 rows 276 cols
[2023-03-08 04:55:48] [INFO ] Computed 62 place invariants in 1 ms
[2023-03-08 04:55:48] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-08 04:55:48] [INFO ] Invariant cache hit.
[2023-03-08 04:55:48] [INFO ] Implicit Places using invariants and state equation in 239 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 345 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 275/282 places, 217/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 275 /275 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 361 ms. Remains : 275/282 places, 217/228 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DES-PT-10b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(EQ s185 0), p0:(OR (EQ s193 0) (EQ s223 0)), p1:(EQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 532 edges and 275 vertex of which 270 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), true, (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 p2)))
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10b-LTLFireability-12 finished in 1094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 275 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 274 transition count 209
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 260 transition count 209
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 260 transition count 199
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 250 transition count 199
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 245 transition count 194
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 245 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 64 place count 245 transition count 189
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 66 place count 244 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 66 place count 244 transition count 186
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 242 transition count 186
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 241 transition count 185
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 241 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 241 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 73 place count 241 transition count 183
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 240 transition count 183
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 5 with 150 rules applied. Total rules applied 225 place count 165 transition count 108
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 5 with 4 rules applied. Total rules applied 229 place count 163 transition count 110
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 163 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 161 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 160 transition count 108
Applied a total of 234 rules in 37 ms. Remains 160 /282 variables (removed 122) and now considering 108/228 (removed 120) transitions.
// Phase 1: matrix 108 rows 160 cols
[2023-03-08 04:55:49] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 04:55:49] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 04:55:49] [INFO ] Invariant cache hit.
[2023-03-08 04:55:49] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-08 04:55:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:55:49] [INFO ] Invariant cache hit.
[2023-03-08 04:55:49] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/282 places, 108/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 323 ms. Remains : 160/282 places, 108/228 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s146 1) (EQ s150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-13 finished in 380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((F(p1)&&F(!p2)) U X(X(X(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U p1))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (!p1&&G(!p2))))'
[2023-03-08 04:55:49] [INFO ] Flatten gal took : 13 ms
[2023-03-08 04:55:49] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 04:55:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 282 places, 228 transitions and 719 arcs took 3 ms.
Total runtime 39697 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-10b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLFireability

FORMULA DES-PT-10b-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-10b-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-10b-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678251351272

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:427
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 DES-PT-10b-LTLFireability-10
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for DES-PT-10b-LTLFireability-10
lola: result : false
lola: markings : 105708
lola: fired transitions : 209659
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-10b-LTLFireability-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DES-PT-10b-LTLFireability-04
lola: result : true
lola: markings : 15
lola: fired transitions : 23
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 DES-PT-10b-LTLFireability-07
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DES-PT-10b-LTLFireability-07
lola: result : false
lola: markings : 83
lola: fired transitions : 83
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10b-LTLFireability-04: LTL true LTL model checker
DES-PT-10b-LTLFireability-07: LTL false LTL model checker
DES-PT-10b-LTLFireability-10: LTL false LTL model checker


Time elapsed: 1 secs. Pages in use: 1

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-10b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DES-PT-10b, 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 r103-tall-167814478300420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;