Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872900452.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutonomousCar-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872900452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 7.5K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 7 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 7 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Jun 7 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 7 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 75K Jun 3 16:02 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 AutonomousCar-PT-03b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654898901599

Running Version 202205111006
[2022-06-10 22:08:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 22:08:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 22:08:24] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2022-06-10 22:08:24] [INFO ] Transformed 190 places.
[2022-06-10 22:08:24] [INFO ] Transformed 273 transitions.
[2022-06-10 22:08:24] [INFO ] Found NUPN structural information;
[2022-06-10 22:08:24] [INFO ] Parsed PT model containing 190 places and 273 transitions in 360 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutonomousCar-PT-03b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 168 transition count 251
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 168 transition count 251
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 165 transition count 248
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 165 transition count 248
Applied a total of 50 rules in 67 ms. Remains 165 /190 variables (removed 25) and now considering 248/273 (removed 25) transitions.
// Phase 1: matrix 248 rows 165 cols
[2022-06-10 22:08:24] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-10 22:08:25] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 248 rows 165 cols
[2022-06-10 22:08:25] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-10 22:08:25] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
// Phase 1: matrix 248 rows 165 cols
[2022-06-10 22:08:25] [INFO ] Computed 8 place invariants in 5 ms
[2022-06-10 22:08:25] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 165/190 places, 248/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/190 places, 248/273 transitions.
Support contains 35 out of 165 places after structural reductions.
[2022-06-10 22:08:26] [INFO ] Flatten gal took : 131 ms
[2022-06-10 22:08:26] [INFO ] Flatten gal took : 51 ms
[2022-06-10 22:08:26] [INFO ] Input system was already deterministic with 248 transitions.
Support contains 33 out of 165 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 978 ms. (steps per millisecond=10 ) properties (out of 28) seen :14
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 248 rows 165 cols
[2022-06-10 22:08:28] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-10 22:08:28] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-10 22:08:28] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-06-10 22:08:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-10 22:08:28] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-06-10 22:08:28] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 7 ms to minimize.
[2022-06-10 22:08:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 136 ms
[2022-06-10 22:08:28] [INFO ] After 371ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-06-10 22:08:29] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 165/165 places, 248/248 transitions.
Graph (trivial) has 154 edges and 165 vertex of which 4 / 165 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 409 edges and 163 vertex of which 158 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 158 transition count 176
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 85 rules applied. Total rules applied 152 place count 95 transition count 154
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 165 place count 82 transition count 154
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 165 place count 82 transition count 148
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 177 place count 76 transition count 148
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 181 place count 72 transition count 144
Iterating global reduction 3 with 4 rules applied. Total rules applied 185 place count 72 transition count 144
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 221 place count 72 transition count 108
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 221 place count 72 transition count 106
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 70 transition count 106
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 287 place count 39 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 288 place count 39 transition count 74
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 295 place count 32 transition count 52
Iterating global reduction 5 with 7 rules applied. Total rules applied 302 place count 32 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 305 place count 32 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 307 place count 31 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 311 place count 29 transition count 66
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 312 place count 29 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 313 place count 28 transition count 65
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 314 place count 28 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 315 place count 27 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 316 place count 26 transition count 64
Applied a total of 316 rules in 103 ms. Remains 26 /165 variables (removed 139) and now considering 64/248 (removed 184) transitions.
Finished structural reductions, in 1 iterations. Remains : 26/165 places, 64/248 transitions.
Finished random walk after 32 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
FORMULA AutonomousCar-PT-03b-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA AutonomousCar-PT-03b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 36 stabilizing places and 37 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 248/248 transitions.
Graph (trivial) has 154 edges and 165 vertex of which 4 / 165 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 162 transition count 179
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 88 rules applied. Total rules applied 155 place count 96 transition count 157
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 168 place count 83 transition count 157
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 168 place count 83 transition count 152
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 178 place count 78 transition count 152
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 182 place count 74 transition count 148
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 74 transition count 148
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 222 place count 74 transition count 112
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 222 place count 74 transition count 110
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 226 place count 72 transition count 110
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 286 place count 42 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 287 place count 42 transition count 78
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 294 place count 35 transition count 56
Iterating global reduction 5 with 7 rules applied. Total rules applied 301 place count 35 transition count 56
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 304 place count 35 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 308 place count 33 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 312 place count 31 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 314 place count 29 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 315 place count 28 transition count 67
Applied a total of 315 rules in 61 ms. Remains 28 /165 variables (removed 137) and now considering 67/248 (removed 181) transitions.
// Phase 1: matrix 67 rows 28 cols
[2022-06-10 22:08:29] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 22:08:29] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 67 rows 28 cols
[2022-06-10 22:08:29] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 22:08:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-06-10 22:08:29] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [23, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 218 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/165 places, 67/248 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 66
Applied a total of 2 rules in 9 ms. Remains 25 /26 variables (removed 1) and now considering 66/67 (removed 1) transitions.
// Phase 1: matrix 66 rows 25 cols
[2022-06-10 22:08:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 22:08:29] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 66 rows 25 cols
[2022-06-10 22:08:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 22:08:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-10 22:08:30] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/165 places, 66/248 transitions.
Finished structural reductions, in 2 iterations. Remains : 25/165 places, 66/248 transitions.
Stuttering acceptance computed with spot in 436 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 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 12 steps with 2 reset in 3 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-01 finished in 988 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U F(X(p1))) U p0))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 248/248 transitions.
Graph (trivial) has 152 edges and 165 vertex of which 4 / 165 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 162 transition count 181
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 81 rules applied. Total rules applied 146 place count 98 transition count 164
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 157 place count 88 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 87 transition count 163
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 158 place count 87 transition count 156
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 172 place count 80 transition count 156
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 177 place count 75 transition count 151
Iterating global reduction 4 with 5 rules applied. Total rules applied 182 place count 75 transition count 151
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 218 place count 75 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 218 place count 75 transition count 113
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 222 place count 73 transition count 113
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 280 place count 44 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 281 place count 44 transition count 82
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 288 place count 37 transition count 60
Iterating global reduction 6 with 7 rules applied. Total rules applied 295 place count 37 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 297 place count 37 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 301 place count 35 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 305 place count 33 transition count 74
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 306 place count 33 transition count 73
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 307 place count 33 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 309 place count 31 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 310 place count 30 transition count 71
Applied a total of 310 rules in 64 ms. Remains 30 /165 variables (removed 135) and now considering 71/248 (removed 177) transitions.
// Phase 1: matrix 71 rows 30 cols
[2022-06-10 22:08:30] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:08:30] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 71 rows 30 cols
[2022-06-10 22:08:30] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:08:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:08:30] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [25, 29]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 205 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/165 places, 71/248 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 27 transition count 70
Applied a total of 2 rules in 9 ms. Remains 27 /28 variables (removed 1) and now considering 70/71 (removed 1) transitions.
// Phase 1: matrix 70 rows 27 cols
[2022-06-10 22:08:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 22:08:30] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 70 rows 27 cols
[2022-06-10 22:08:30] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 22:08:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:08:30] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/165 places, 70/248 transitions.
Finished structural reductions, in 2 iterations. Remains : 27/165 places, 70/248 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s12 1), p1:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 1 reset in 2 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-04 finished in 721 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))&&X(G(p1))))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 248/248 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 240
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 240
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 52 place count 157 transition count 204
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 155 transition count 202
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 154 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 154 transition count 201
Applied a total of 58 rules in 24 ms. Remains 154 /165 variables (removed 11) and now considering 201/248 (removed 47) transitions.
// Phase 1: matrix 201 rows 154 cols
[2022-06-10 22:08:31] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-10 22:08:31] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 201 rows 154 cols
[2022-06-10 22:08:31] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-10 22:08:31] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 154 cols
[2022-06-10 22:08:31] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:08:31] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/165 places, 201/248 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/165 places, 201/248 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s32 0), p0:(OR (AND (EQ s4 1) (EQ s6 1) (EQ s89 1) (EQ s120 1)) (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 80 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-05 finished in 840 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0))&&G(p1)))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 248/248 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 240
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 240
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 52 place count 157 transition count 204
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 155 transition count 202
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 154 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 154 transition count 201
Applied a total of 58 rules in 16 ms. Remains 154 /165 variables (removed 11) and now considering 201/248 (removed 47) transitions.
// Phase 1: matrix 201 rows 154 cols
[2022-06-10 22:08:32] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:08:32] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 201 rows 154 cols
[2022-06-10 22:08:32] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-10 22:08:32] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 154 cols
[2022-06-10 22:08:32] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-10 22:08:32] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/165 places, 201/248 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/165 places, 201/248 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s114 0), p0:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-06 finished in 862 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 248/248 transitions.
Graph (trivial) has 150 edges and 165 vertex of which 4 / 165 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 162 transition count 179
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 88 rules applied. Total rules applied 155 place count 96 transition count 157
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 169 place count 83 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 82 transition count 156
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 170 place count 82 transition count 151
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 180 place count 77 transition count 151
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 185 place count 72 transition count 146
Iterating global reduction 4 with 5 rules applied. Total rules applied 190 place count 72 transition count 146
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 226 place count 72 transition count 110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 226 place count 72 transition count 108
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 230 place count 70 transition count 108
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 288 place count 41 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 290 place count 41 transition count 77
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 297 place count 34 transition count 55
Iterating global reduction 6 with 7 rules applied. Total rules applied 304 place count 34 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 307 place count 34 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 311 place count 32 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 315 place count 30 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 317 place count 28 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 318 place count 27 transition count 66
Applied a total of 318 rules in 25 ms. Remains 27 /165 variables (removed 138) and now considering 66/248 (removed 182) transitions.
// Phase 1: matrix 66 rows 27 cols
[2022-06-10 22:08:32] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:08:33] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 66 rows 27 cols
[2022-06-10 22:08:33] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:08:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:08:33] [INFO ] Implicit Places using invariants and state equation in 88 ms returned [21, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 154 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/165 places, 66/248 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 65
Applied a total of 2 rules in 3 ms. Remains 24 /25 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 24 cols
[2022-06-10 22:08:33] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 22:08:33] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 65 rows 24 cols
[2022-06-10 22:08:33] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-10 22:08:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:08:33] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/165 places, 65/248 transitions.
Finished structural reductions, in 2 iterations. Remains : 24/165 places, 65/248 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s23 0), p1:(NEQ s11 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4 reset in 379 ms.
Product exploration explored 100000 steps with 3 reset in 216 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 514 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 3662 steps, including 336 resets, run visited all 4 properties in 39 ms. (steps per millisecond=93 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 791 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 24 cols
[2022-06-10 22:08:35] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 22:08:35] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 65 rows 24 cols
[2022-06-10 22:08:35] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 22:08:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:08:35] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2022-06-10 22:08:35] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 65 rows 24 cols
[2022-06-10 22:08:35] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 22:08:35] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 65/65 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 505 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 5190 steps, including 494 resets, run visited all 4 properties in 18 ms. (steps per millisecond=288 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 641 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4 reset in 183 ms.
Product exploration explored 100000 steps with 0 reset in 194 ms.
Built C files in :
/tmp/ltsmin6037932292776878097
[2022-06-10 22:08:37] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2022-06-10 22:08:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:08:37] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2022-06-10 22:08:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:08:37] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2022-06-10 22:08:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:08:37] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6037932292776878097
Running compilation step : cd /tmp/ltsmin6037932292776878097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 610 ms.
Running link step : cd /tmp/ltsmin6037932292776878097;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin6037932292776878097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8627735116521250195.hoa' '--buchi-type=spotba'
LTSmin run took 193 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03b-LTLFireability-07 finished in 5583 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((false U p0) U (!X(p0)&&p1))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 248/248 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 158 transition count 241
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 158 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 50 place count 158 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 157 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 157 transition count 204
Applied a total of 52 rules in 15 ms. Remains 157 /165 variables (removed 8) and now considering 204/248 (removed 44) transitions.
// Phase 1: matrix 204 rows 157 cols
[2022-06-10 22:08:38] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:08:38] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 204 rows 157 cols
[2022-06-10 22:08:38] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:08:39] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
// Phase 1: matrix 204 rows 157 cols
[2022-06-10 22:08:39] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:08:39] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/165 places, 204/248 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/165 places, 204/248 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s41 1), p1:(EQ s140 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 613 ms.
Product exploration explored 100000 steps with 50000 reset in 319 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-03b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03b-LTLFireability-09 finished in 2049 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(F(p1)&&G(p2)&&p1))))'
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 248/248 transitions.
Graph (trivial) has 147 edges and 165 vertex of which 4 / 165 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 162 transition count 183
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 82 rules applied. Total rules applied 145 place count 100 transition count 163
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 158 place count 88 transition count 162
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 161 place count 87 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 162 place count 86 transition count 160
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 162 place count 86 transition count 154
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 174 place count 80 transition count 154
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 178 place count 76 transition count 150
Iterating global reduction 5 with 4 rules applied. Total rules applied 182 place count 76 transition count 150
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 218 place count 76 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 218 place count 76 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 220 place count 75 transition count 113
Performed 30 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 280 place count 45 transition count 81
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 286 place count 39 transition count 63
Iterating global reduction 6 with 6 rules applied. Total rules applied 292 place count 39 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 295 place count 39 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 297 place count 38 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 301 place count 36 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 302 place count 35 transition count 76
Applied a total of 302 rules in 29 ms. Remains 35 /165 variables (removed 130) and now considering 76/248 (removed 172) transitions.
// Phase 1: matrix 76 rows 35 cols
[2022-06-10 22:08:40] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-10 22:08:40] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 76 rows 35 cols
[2022-06-10 22:08:40] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:08:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-06-10 22:08:40] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [30, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 142 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/165 places, 76/248 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 75
Applied a total of 2 rules in 5 ms. Remains 32 /33 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 32 cols
[2022-06-10 22:08:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:08:40] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 75 rows 32 cols
[2022-06-10 22:08:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:08:41] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-10 22:08:41] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/165 places, 75/248 transitions.
Finished structural reductions, in 2 iterations. Remains : 32/165 places, 75/248 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s19 0), p1:(OR (EQ s2 0) (EQ s3 0) (EQ s16 0) (EQ s28 0)), p2:(EQ s27 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-11 finished in 590 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F((p0&&F(p1))))))))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 248/248 transitions.
Graph (trivial) has 149 edges and 165 vertex of which 4 / 165 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 162 transition count 181
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 83 rules applied. Total rules applied 148 place count 98 transition count 162
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 159 place count 87 transition count 162
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 159 place count 87 transition count 155
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 173 place count 80 transition count 155
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 178 place count 75 transition count 150
Iterating global reduction 3 with 5 rules applied. Total rules applied 183 place count 75 transition count 150
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 219 place count 75 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 219 place count 75 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 74 transition count 113
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 279 place count 45 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 280 place count 45 transition count 82
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 286 place count 39 transition count 64
Iterating global reduction 5 with 6 rules applied. Total rules applied 292 place count 39 transition count 64
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 295 place count 39 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 299 place count 37 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 303 place count 35 transition count 77
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 304 place count 35 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 305 place count 34 transition count 76
Applied a total of 305 rules in 21 ms. Remains 34 /165 variables (removed 131) and now considering 76/248 (removed 172) transitions.
// Phase 1: matrix 76 rows 34 cols
[2022-06-10 22:08:41] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-10 22:08:41] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 76 rows 34 cols
[2022-06-10 22:08:41] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:08:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:08:41] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [29, 33]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 149 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/165 places, 76/248 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 31 transition count 75
Applied a total of 2 rules in 3 ms. Remains 31 /32 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 31 cols
[2022-06-10 22:08:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:08:41] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 75 rows 31 cols
[2022-06-10 22:08:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:08:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:08:41] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/165 places, 75/248 transitions.
Finished structural reductions, in 2 iterations. Remains : 31/165 places, 75/248 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s2 1) (EQ s3 1) (EQ s11 1) (EQ s27 1)), p0:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-13 finished in 471 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 248/248 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 158 transition count 241
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 158 transition count 241
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 156 transition count 239
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 156 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 155 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 155 transition count 238
Applied a total of 20 rules in 11 ms. Remains 155 /165 variables (removed 10) and now considering 238/248 (removed 10) transitions.
// Phase 1: matrix 238 rows 155 cols
[2022-06-10 22:08:41] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:08:41] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 238 rows 155 cols
[2022-06-10 22:08:41] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-10 22:08:41] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
// Phase 1: matrix 238 rows 155 cols
[2022-06-10 22:08:41] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:08:42] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/165 places, 238/248 transitions.
Finished structural reductions, in 1 iterations. Remains : 155/165 places, 238/248 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 248 steps with 3 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-15 finished in 677 ms.
All properties solved by simple procedures.
Total runtime 18470 ms.

BK_STOP 1654898922468

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-03b, 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 r294-smll-165463872900452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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