Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r597-smll-171734926300023.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MedleyA-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926300023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 75K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-05-LTLFireability-00
FORMULA_NAME MedleyA-PT-05-LTLFireability-01
FORMULA_NAME MedleyA-PT-05-LTLFireability-02
FORMULA_NAME MedleyA-PT-05-LTLFireability-03
FORMULA_NAME MedleyA-PT-05-LTLFireability-04
FORMULA_NAME MedleyA-PT-05-LTLFireability-05
FORMULA_NAME MedleyA-PT-05-LTLFireability-06
FORMULA_NAME MedleyA-PT-05-LTLFireability-07
FORMULA_NAME MedleyA-PT-05-LTLFireability-08
FORMULA_NAME MedleyA-PT-05-LTLFireability-09
FORMULA_NAME MedleyA-PT-05-LTLFireability-10
FORMULA_NAME MedleyA-PT-05-LTLFireability-11
FORMULA_NAME MedleyA-PT-05-LTLFireability-12
FORMULA_NAME MedleyA-PT-05-LTLFireability-13
FORMULA_NAME MedleyA-PT-05-LTLFireability-14
FORMULA_NAME MedleyA-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717361697677

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 20:55:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:55:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:55:00] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-06-02 20:55:00] [INFO ] Transformed 115 places.
[2024-06-02 20:55:00] [INFO ] Transformed 257 transitions.
[2024-06-02 20:55:00] [INFO ] Found NUPN structural information;
[2024-06-02 20:55:00] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA MedleyA-PT-05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 254/254 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 101 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 101 transition count 226
Applied a total of 28 rules in 30 ms. Remains 101 /115 variables (removed 14) and now considering 226/254 (removed 28) transitions.
[2024-06-02 20:55:01] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
// Phase 1: matrix 225 rows 101 cols
[2024-06-02 20:55:01] [INFO ] Computed 20 invariants in 12 ms
[2024-06-02 20:55:01] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-06-02 20:55:01] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2024-06-02 20:55:01] [INFO ] Invariant cache hit.
[2024-06-02 20:55:01] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:01] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2024-06-02 20:55:01] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2024-06-02 20:55:01] [INFO ] Invariant cache hit.
[2024-06-02 20:55:01] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/115 places, 226/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 861 ms. Remains : 101/115 places, 226/254 transitions.
Support contains 42 out of 101 places after structural reductions.
[2024-06-02 20:55:02] [INFO ] Flatten gal took : 74 ms
[2024-06-02 20:55:02] [INFO ] Flatten gal took : 38 ms
[2024-06-02 20:55:02] [INFO ] Input system was already deterministic with 226 transitions.
Incomplete random walk after 10000 steps, including 754 resets, run finished after 990 ms. (steps per millisecond=10 ) properties (out of 31) seen :19
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-06-02 20:55:04] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2024-06-02 20:55:04] [INFO ] Invariant cache hit.
[2024-06-02 20:55:04] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 20:55:04] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:55:04] [INFO ] After 433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 20:55:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-02 20:55:04] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:55:05] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-06-02 20:55:05] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:05] [INFO ] After 160ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-06-02 20:55:05] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 165 ms.
[2024-06-02 20:55:05] [INFO ] After 907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 3 properties in 122 ms.
Support contains 12 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 404 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 4 place count 100 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 99 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 9 place count 95 transition count 214
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 95 transition count 214
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -71
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 86 transition count 285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 86 transition count 283
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 71 place count 86 transition count 245
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 81 place count 86 transition count 273
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 101 place count 76 transition count 263
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 106 place count 76 transition count 263
Applied a total of 106 rules in 103 ms. Remains 76 /101 variables (removed 25) and now considering 263/226 (removed -37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 76/101 places, 263/226 transitions.
Incomplete random walk after 10000 steps, including 1094 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 129 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 263 rows 76 cols
[2024-06-02 20:55:06] [INFO ] Computed 20 invariants in 21 ms
[2024-06-02 20:55:06] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-02 20:55:06] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:55:06] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 20:55:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-02 20:55:06] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:55:06] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 20:55:06] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-06-02 20:55:06] [INFO ] After 97ms SMT Verify possible using 144 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 20:55:06] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 67 ms.
[2024-06-02 20:55:07] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 12 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 263/263 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 269
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 74 transition count 265
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 13 place count 70 transition count 264
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 70 transition count 305
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 27 place count 67 transition count 297
Applied a total of 27 rules in 56 ms. Remains 67 /76 variables (removed 9) and now considering 297/263 (removed -34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 67/76 places, 297/263 transitions.
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1371758 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :{}
Probabilistic random walk after 1371758 steps, saw 223670 distinct states, run finished after 3002 ms. (steps per millisecond=456 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 297 rows 67 cols
[2024-06-02 20:55:10] [INFO ] Computed 20 invariants in 8 ms
[2024-06-02 20:55:10] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 20:55:10] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:55:10] [INFO ] After 108ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 20:55:10] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-02 20:55:10] [INFO ] After 32ms SMT Verify possible using 160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:55:10] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:55:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 20:55:10] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:55:10] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:55:10] [INFO ] After 41ms SMT Verify possible using 160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 20:55:10] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-06-02 20:55:10] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 297/297 transitions.
Applied a total of 0 rules in 11 ms. Remains 67 /67 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 67/67 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 297/297 transitions.
Applied a total of 0 rules in 10 ms. Remains 67 /67 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 20:55:10] [INFO ] Invariant cache hit.
[2024-06-02 20:55:10] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 20:55:10] [INFO ] Invariant cache hit.
[2024-06-02 20:55:10] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-02 20:55:11] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-06-02 20:55:11] [INFO ] Redundant transitions in 55 ms returned []
[2024-06-02 20:55:11] [INFO ] Invariant cache hit.
[2024-06-02 20:55:11] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 750 ms. Remains : 67/67 places, 297/297 transitions.
Graph (trivial) has 34 edges and 67 vertex of which 6 / 67 are part of one of the 2 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 336 edges and 63 vertex of which 54 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 54 transition count 250
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 1 with 19 rules applied. Total rules applied 58 place count 54 transition count 231
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 54 transition count 229
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 96 place count 52 transition count 195
Free-agglomeration rule (complex) applied 5 times with reduction of 12 identical transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 52 transition count 199
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 120 place count 47 transition count 185
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 152 place count 47 transition count 185
Applied a total of 152 rules in 43 ms. Remains 47 /67 variables (removed 20) and now considering 185/297 (removed 112) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 47 cols
[2024-06-02 20:55:11] [INFO ] Computed 14 invariants in 2 ms
[2024-06-02 20:55:11] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 20:55:11] [INFO ] [Real]Absence check using 9 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:55:11] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:55:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 20:55:11] [INFO ] [Nat]Absence check using 9 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:55:11] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:55:11] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-02 20:55:11] [INFO ] After 17ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 20:55:11] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-06-02 20:55:11] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 13 stabilizing places and 86 stable transitions
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0)&&F(!p1))||G(p0))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 5 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 20:55:12] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 20:55:12] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 20:55:12] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 20:55:12] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:12] [INFO ] Invariant cache hit.
[2024-06-02 20:55:12] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:12] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-06-02 20:55:12] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:12] [INFO ] Invariant cache hit.
[2024-06-02 20:55:12] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 493 ms. Remains : 97/101 places, 218/226 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s82 1) (EQ s85 1)), p0:(AND (EQ s3 1) (EQ s17 1) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-01 finished in 912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 98 transition count 223
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 6 place count 95 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 95 transition count 217
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 27 place count 86 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 31 place count 86 transition count 267
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 43 place count 86 transition count 255
Applied a total of 43 rules in 51 ms. Remains 86 /101 variables (removed 15) and now considering 255/226 (removed -29) transitions.
[2024-06-02 20:55:13] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
// Phase 1: matrix 254 rows 86 cols
[2024-06-02 20:55:13] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:55:13] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 20:55:13] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2024-06-02 20:55:13] [INFO ] Invariant cache hit.
[2024-06-02 20:55:13] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 20:55:13] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-06-02 20:55:13] [INFO ] Redundant transitions in 68 ms returned []
[2024-06-02 20:55:13] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2024-06-02 20:55:13] [INFO ] Invariant cache hit.
[2024-06-02 20:55:13] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/101 places, 255/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 575 ms. Remains : 86/101 places, 255/226 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-02 finished in 714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 5 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 20:55:13] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 20:55:13] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:55:14] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-02 20:55:14] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:14] [INFO ] Invariant cache hit.
[2024-06-02 20:55:14] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:14] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-06-02 20:55:14] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:14] [INFO ] Invariant cache hit.
[2024-06-02 20:55:14] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 647 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s30 1) (EQ s52 1)), p0:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-03 finished in 821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||(p1&&X(p1))))&&F(G(p2)))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 6 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 20:55:14] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:14] [INFO ] Invariant cache hit.
[2024-06-02 20:55:14] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 20:55:14] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:14] [INFO ] Invariant cache hit.
[2024-06-02 20:55:14] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:14] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-06-02 20:55:14] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:14] [INFO ] Invariant cache hit.
[2024-06-02 20:55:15] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 438 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s26 1) (EQ s57 1) (EQ s68 1)), p1:(EQ s14 1), p2:(EQ s25 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 11 ms.
FORMULA MedleyA-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-04 finished in 653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p1)&&p0))||X(G(p2)))))'
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 98 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 98 transition count 220
Applied a total of 6 rules in 5 ms. Remains 98 /101 variables (removed 3) and now considering 220/226 (removed 6) transitions.
[2024-06-02 20:55:15] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
// Phase 1: matrix 219 rows 98 cols
[2024-06-02 20:55:15] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:55:15] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:55:15] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 20:55:15] [INFO ] Invariant cache hit.
[2024-06-02 20:55:15] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:15] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-06-02 20:55:15] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 20:55:15] [INFO ] Invariant cache hit.
[2024-06-02 20:55:15] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/101 places, 220/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 98/101 places, 220/226 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(AND (OR (EQ s31 0) (EQ s54 0)) (EQ s58 1) (EQ s81 1) (EQ s83 1) (EQ s96 1)), p1:(AND (EQ s31 1) (EQ s54 1)), p2:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-05 finished in 772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 4 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 20:55:16] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 20:55:16] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:55:16] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:55:16] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:16] [INFO ] Invariant cache hit.
[2024-06-02 20:55:16] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:16] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-02 20:55:16] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:16] [INFO ] Invariant cache hit.
[2024-06-02 20:55:16] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 484 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 284 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-06 finished in 787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1))||F((F(p3)&&p2)))))'
Support contains 9 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 4 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 20:55:16] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:16] [INFO ] Invariant cache hit.
[2024-06-02 20:55:16] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 20:55:16] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:16] [INFO ] Invariant cache hit.
[2024-06-02 20:55:17] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:17] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-06-02 20:55:17] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:17] [INFO ] Invariant cache hit.
[2024-06-02 20:55:17] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 435 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s30 1) (EQ s53 1) (EQ s82 1) (EQ s93 1)), p2:(AND (EQ s30 1) (EQ s53 1) (EQ s57 1) (EQ s71 1)), p3:(OR (EQ s3 0) (EQ s4 0) (EQ s24 0)), p1:(AN...], 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 10 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-07 finished in 661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F(p1)))))))'
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 3 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 20:55:17] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:17] [INFO ] Invariant cache hit.
[2024-06-02 20:55:17] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 20:55:17] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:17] [INFO ] Invariant cache hit.
[2024-06-02 20:55:17] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:17] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-06-02 20:55:17] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:17] [INFO ] Invariant cache hit.
[2024-06-02 20:55:17] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (EQ s1 1) (EQ s57 1) (EQ s68 1)), p1:(AND (EQ s30 1) (EQ s33 1) (EQ s49 1) (EQ s59 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 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-08 finished in 637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0) U G(p1))))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 99 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 99 transition count 222
Applied a total of 4 rules in 3 ms. Remains 99 /101 variables (removed 2) and now considering 222/226 (removed 4) transitions.
[2024-06-02 20:55:18] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
// Phase 1: matrix 221 rows 99 cols
[2024-06-02 20:55:18] [INFO ] Computed 20 invariants in 5 ms
[2024-06-02 20:55:18] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 20:55:18] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 20:55:18] [INFO ] Invariant cache hit.
[2024-06-02 20:55:18] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:18] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-06-02 20:55:18] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 20:55:18] [INFO ] Invariant cache hit.
[2024-06-02 20:55:18] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 222/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 99/101 places, 222/226 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s49 1) (AND (EQ s36 1) (EQ s39 1) (EQ s30 1) (EQ s55 1) (EQ s84 1) (EQ s89 1))), p0:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-09 finished in 740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 99 transition count 224
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 7 place count 95 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 95 transition count 216
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 33 place count 84 transition count 297
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 37 place count 84 transition count 293
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 3 with 37 rules applied. Total rules applied 74 place count 84 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 83 transition count 263
Applied a total of 76 rules in 41 ms. Remains 83 /101 variables (removed 18) and now considering 263/226 (removed -37) transitions.
[2024-06-02 20:55:18] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
// Phase 1: matrix 262 rows 83 cols
[2024-06-02 20:55:18] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:55:18] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:55:18] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 20:55:18] [INFO ] Invariant cache hit.
[2024-06-02 20:55:19] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 20:55:19] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-02 20:55:19] [INFO ] Redundant transitions in 49 ms returned []
[2024-06-02 20:55:19] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 20:55:19] [INFO ] Invariant cache hit.
[2024-06-02 20:55:19] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/101 places, 263/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 611 ms. Remains : 83/101 places, 263/226 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s26 0) (EQ s36 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 277 ms.
Product exploration explored 100000 steps with 3 reset in 149 ms.
Computed a total of 11 stabilizing places and 134 stable transitions
Computed a total of 11 stabilizing places and 134 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 88 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=88 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 263/263 transitions.
Applied a total of 0 rules in 7 ms. Remains 83 /83 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-06-02 20:55:20] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 20:55:20] [INFO ] Invariant cache hit.
[2024-06-02 20:55:20] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 20:55:20] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 20:55:20] [INFO ] Invariant cache hit.
[2024-06-02 20:55:20] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 20:55:20] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-06-02 20:55:20] [INFO ] Redundant transitions in 48 ms returned []
[2024-06-02 20:55:20] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 20:55:20] [INFO ] Invariant cache hit.
[2024-06-02 20:55:21] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 585 ms. Remains : 83/83 places, 263/263 transitions.
Computed a total of 11 stabilizing places and 134 stable transitions
Computed a total of 11 stabilizing places and 134 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 150 steps, including 13 resets, run visited all 1 properties in 3 ms. (steps per millisecond=50 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 115 ms.
Product exploration explored 100000 steps with 0 reset in 128 ms.
Built C files in :
/tmp/ltsmin10793974375202305523
[2024-06-02 20:55:21] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2024-06-02 20:55:21] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:55:21] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2024-06-02 20:55:21] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:55:21] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2024-06-02 20:55:21] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:55:21] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10793974375202305523
Running compilation step : cd /tmp/ltsmin10793974375202305523;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1151 ms.
Running link step : cd /tmp/ltsmin10793974375202305523;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin10793974375202305523;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11280240964315606498.hoa' '--buchi-type=spotba'
LTSmin run took 656 ms.
FORMULA MedleyA-PT-05-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-05-LTLFireability-10 finished in 5002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1 U !p2)&&p0))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 3 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 20:55:23] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 20:55:23] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:55:23] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 20:55:23] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:23] [INFO ] Invariant cache hit.
[2024-06-02 20:55:24] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:24] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-06-02 20:55:24] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:24] [INFO ] Invariant cache hit.
[2024-06-02 20:55:24] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) p2), p2, (OR (NOT p0) p2)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s42 1) (EQ s45 1)), p1:(AND (EQ s3 1) (EQ s14 1)), p0:(AND (EQ s3 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-12 finished in 613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((F((G(F(!p1))||(!p2&&F(!p1))))&&p0)||(p3&&G(p4)&&F((G(F(!p1))||(!p2&&F(!p1)))))))))'
Support contains 12 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 100 transition count 224
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 99 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 7 place count 95 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 95 transition count 216
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 31 place count 85 transition count 285
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 35 place count 85 transition count 281
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 85 transition count 256
Applied a total of 60 rules in 32 ms. Remains 85 /101 variables (removed 16) and now considering 256/226 (removed -30) transitions.
[2024-06-02 20:55:24] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
// Phase 1: matrix 255 rows 85 cols
[2024-06-02 20:55:24] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:55:24] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:55:24] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 20:55:24] [INFO ] Invariant cache hit.
[2024-06-02 20:55:24] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-02 20:55:24] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-06-02 20:55:24] [INFO ] Redundant transitions in 42 ms returned []
[2024-06-02 20:55:24] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 20:55:24] [INFO ] Invariant cache hit.
[2024-06-02 20:55:25] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/101 places, 256/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 509 ms. Remains : 85/101 places, 256/226 transitions.
Stuttering acceptance computed with spot in 418 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4)), (AND p1 (NOT p4))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 p1) (AND p3 p1 p4)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p3 p4), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p2) (AND p3 p2 p4)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 p1) (AND p3 p1 p4)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p4)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p4), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p4)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p4)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2 p4), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1 (NOT p2) p4), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p4)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p4)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p4), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2) p4), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p4)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p4), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (EQ s1 0) (EQ s72 0) (EQ s79 0)) (OR (EQ s3 0) (EQ s23 0) (EQ s50 0) (EQ s54 0))), p3:(OR (EQ s1 0) (EQ s72 0) (EQ s79 0)), p4:(OR (EQ s27 0) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2 reset in 425 ms.
Product exploration explored 100000 steps with 5 reset in 360 ms.
Computed a total of 11 stabilizing places and 127 stable transitions
Computed a total of 11 stabilizing places and 127 stable transitions
Knowledge obtained : [(AND p0 p3 p4 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p3 p4))), (X (NOT (OR (AND p0 p2) (AND p3 p2 p4)))), (X (NOT (OR (AND p0 p1) (AND p3 p1 p4)))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 (NOT p4))))), (X (X (NOT (AND (NOT p0) p3 p4)))), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (OR (AND p0 p2) (AND p3 p2 p4))))), (X (X (NOT (AND p0 p1 (NOT p4))))), (X (X (NOT (AND p0 p2 p4)))), (X (X (NOT (OR (AND p0 p1) (AND p3 p1 p4))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND p0 p1 (NOT p2) p4)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 259 ms. Reduced automaton from 7 states, 22 edges and 5 AP (stutter insensitive) to 7 states, 22 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 536 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4)), (AND p1 (NOT p4))]
Incomplete random walk after 10000 steps, including 852 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 17) seen :7
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-06-02 20:55:27] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 20:55:27] [INFO ] Invariant cache hit.
[2024-06-02 20:55:27] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2024-06-02 20:55:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 20:55:28] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:55:28] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2024-06-02 20:55:28] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-02 20:55:28] [INFO ] After 241ms SMT Verify possible using 138 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2024-06-02 20:55:28] [INFO ] After 524ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 227 ms.
[2024-06-02 20:55:29] [INFO ] After 1168ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 254
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 15 place count 85 transition count 308
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 43 place count 72 transition count 293
Applied a total of 43 rules in 19 ms. Remains 72 /85 variables (removed 13) and now considering 293/256 (removed -37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 72/85 places, 293/256 transitions.
Incomplete random walk after 10000 steps, including 1187 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 293 rows 72 cols
[2024-06-02 20:55:29] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:55:29] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 20:55:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-06-02 20:55:29] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:55:29] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 20:55:29] [INFO ] State equation strengthened by 163 read => feed constraints.
[2024-06-02 20:55:30] [INFO ] After 126ms SMT Verify possible using 163 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 20:55:30] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 120 ms.
[2024-06-02 20:55:30] [INFO ] After 615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 12 ms.
Support contains 10 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 293/293 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 72 transition count 319
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 11 place count 69 transition count 314
Applied a total of 11 rules in 17 ms. Remains 69 /72 variables (removed 3) and now considering 314/293 (removed -21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 69/72 places, 314/293 transitions.
Incomplete random walk after 10000 steps, including 1166 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 146858 steps, run visited all 1 properties in 421 ms. (steps per millisecond=348 )
Probabilistic random walk after 146858 steps, saw 29884 distinct states, run finished after 425 ms. (steps per millisecond=345 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p4 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p3 p4))), (X (NOT (OR (AND p0 p2) (AND p3 p2 p4)))), (X (NOT (OR (AND p0 p1) (AND p3 p1 p4)))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 (NOT p4))))), (X (X (NOT (AND (NOT p0) p3 p4)))), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (OR (AND p0 p2) (AND p3 p2 p4))))), (X (X (NOT (AND p0 p1 (NOT p4))))), (X (X (NOT (AND p0 p2 p4)))), (X (X (NOT (OR (AND p0 p1) (AND p3 p1 p4))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND p0 p1 (NOT p2) p4)))), (X (X (NOT p1))), (G (NOT (AND p0 p4 p2))), (G (NOT (AND p4 p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p4) p1)), (F (AND p0 p4 (NOT p2) p1)), (F (AND p4 (NOT p2) p1)), (F (AND (NOT p0) (NOT p4))), (F (OR (AND p0 p2) (AND p3 p4 p2))), (F (AND p0 (NOT p4) p2)), (F (AND (NOT p4) p1)), (F (AND (NOT p0) p4)), (F (AND (NOT p4) p2)), (F (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)))), (F (AND (NOT p0) p3 p4)), (F (AND p4 p1)), (F (OR (AND p0 p1) (AND p3 p4 p1))), (F p1), (F p2)]
Knowledge based reduction with 20 factoid took 1030 ms. Reduced automaton from 7 states, 22 edges and 5 AP (stutter insensitive) to 6 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Stuttering acceptance computed with spot in 312 ms :[(OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 256/256 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-06-02 20:55:32] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
// Phase 1: matrix 255 rows 85 cols
[2024-06-02 20:55:32] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:55:32] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:55:32] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 20:55:32] [INFO ] Invariant cache hit.
[2024-06-02 20:55:32] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-02 20:55:32] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-06-02 20:55:32] [INFO ] Redundant transitions in 44 ms returned []
[2024-06-02 20:55:32] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 20:55:32] [INFO ] Invariant cache hit.
[2024-06-02 20:55:32] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 512 ms. Remains : 85/85 places, 256/256 transitions.
Computed a total of 11 stabilizing places and 127 stable transitions
Computed a total of 11 stabilizing places and 127 stable transitions
Knowledge obtained : [(AND p0 p4 p3 (NOT p1) (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p4 p3))), (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))))), (X (NOT (OR (AND p0 p1) (AND p4 p3 p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p4 p3)))), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (OR (AND p0 p2 p1) (AND p0 (NOT p4) p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT (OR (AND p0 p1) (AND p4 p3 p1))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND p0 (NOT p2) p4 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 204 ms. Reduced automaton from 6 states, 17 edges and 5 AP (stutter insensitive) to 6 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 330 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Incomplete random walk after 10000 steps, including 860 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-06-02 20:55:34] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 20:55:34] [INFO ] Invariant cache hit.
[2024-06-02 20:55:34] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 20:55:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-06-02 20:55:34] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 7 ms returned sat
[2024-06-02 20:55:34] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 20:55:34] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-02 20:55:34] [INFO ] After 203ms SMT Verify possible using 138 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-06-02 20:55:35] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 201 ms.
[2024-06-02 20:55:35] [INFO ] After 1037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 1 ms.
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 254
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 15 place count 85 transition count 308
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 43 place count 72 transition count 293
Applied a total of 43 rules in 17 ms. Remains 72 /85 variables (removed 13) and now considering 293/256 (removed -37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 72/85 places, 293/256 transitions.
Incomplete random walk after 10000 steps, including 1160 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 293 rows 72 cols
[2024-06-02 20:55:35] [INFO ] Computed 20 invariants in 13 ms
[2024-06-02 20:55:35] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 20:55:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-06-02 20:55:35] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:55:36] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 20:55:36] [INFO ] State equation strengthened by 163 read => feed constraints.
[2024-06-02 20:55:36] [INFO ] After 171ms SMT Verify possible using 163 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 20:55:36] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 182 ms.
[2024-06-02 20:55:36] [INFO ] After 857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 22 ms.
Support contains 12 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 72 /72 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 72/72 places, 293/293 transitions.
Incomplete random walk after 10000 steps, including 1178 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 698256 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{0=1}
Probabilistic random walk after 698256 steps, saw 125526 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :1
Running SMT prover for 3 properties.
[2024-06-02 20:55:40] [INFO ] Invariant cache hit.
[2024-06-02 20:55:40] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 20:55:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-02 20:55:40] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:55:40] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 20:55:40] [INFO ] State equation strengthened by 163 read => feed constraints.
[2024-06-02 20:55:40] [INFO ] After 128ms SMT Verify possible using 163 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 20:55:40] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 99 ms.
[2024-06-02 20:55:40] [INFO ] After 694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 23 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND p0 p4 p3 (NOT p1) (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p4 p3))), (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))))), (X (NOT (OR (AND p0 p1) (AND p4 p3 p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p4 p3)))), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (OR (AND p0 p2 p1) (AND p0 (NOT p4) p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT (OR (AND p0 p1) (AND p4 p3 p1))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND p0 (NOT p2) p4 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (AND p0 (NOT p2) p4 p1)), (F p1), (F (AND (NOT p0) (NOT p4))), (F (AND p0 p2)), (F (OR (AND p0 p2 p1) (AND p0 (NOT p4) p1))), (F (AND (NOT p0) p4)), (F (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)))), (F (AND (NOT p0) p3 p4)), (F (OR (AND p0 p1) (AND p3 p4 p1))), (F (AND p4 p1)), (F (AND (NOT p4) p1))]
Knowledge based reduction with 16 factoid took 689 ms. Reduced automaton from 6 states, 17 edges and 5 AP (stutter insensitive) to 6 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 368 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Stuttering acceptance computed with spot in 315 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Stuttering acceptance computed with spot in 306 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Product exploration explored 100000 steps with 2 reset in 206 ms.
Product exploration explored 100000 steps with 0 reset in 217 ms.
Built C files in :
/tmp/ltsmin1740818888033345140
[2024-06-02 20:55:43] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-06-02 20:55:43] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:55:43] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-06-02 20:55:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:55:43] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-06-02 20:55:43] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:55:43] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1740818888033345140
Running compilation step : cd /tmp/ltsmin1740818888033345140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 915 ms.
Running link step : cd /tmp/ltsmin1740818888033345140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1740818888033345140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17768833320443522697.hoa' '--buchi-type=spotba'
LTSmin run took 481 ms.
FORMULA MedleyA-PT-05-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-05-LTLFireability-13 finished in 20141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 2 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 20:55:44] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 20:55:44] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 20:55:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 20:55:44] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:44] [INFO ] Invariant cache hit.
[2024-06-02 20:55:44] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:44] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-06-02 20:55:44] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:44] [INFO ] Invariant cache hit.
[2024-06-02 20:55:45] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 440 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s66 1), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-15 finished in 629 ms.
All properties solved by simple procedures.
Total runtime 44749 ms.

BK_STOP 1717361747065

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is MedleyA-PT-05, 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 r597-smll-171734926300023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-05.tgz
mv MedleyA-PT-05 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 ;