Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813598200619.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is AutonomousCar-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 228K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678637940197

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:19:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:19:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:19:03] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-12 16:19:03] [INFO ] Transformed 289 places.
[2023-03-12 16:19:03] [INFO ] Transformed 644 transitions.
[2023-03-12 16:19:03] [INFO ] Found NUPN structural information;
[2023-03-12 16:19:03] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-06b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 252 transition count 607
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 252 transition count 607
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 218 place count 252 transition count 463
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 224 place count 246 transition count 457
Iterating global reduction 1 with 6 rules applied. Total rules applied 230 place count 246 transition count 457
Applied a total of 230 rules in 49 ms. Remains 246 /289 variables (removed 43) and now considering 457/644 (removed 187) transitions.
// Phase 1: matrix 457 rows 246 cols
[2023-03-12 16:19:03] [INFO ] Computed 11 place invariants in 10 ms
[2023-03-12 16:19:04] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-12 16:19:04] [INFO ] Invariant cache hit.
[2023-03-12 16:19:04] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
[2023-03-12 16:19:04] [INFO ] Invariant cache hit.
[2023-03-12 16:19:04] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 246/289 places, 457/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1427 ms. Remains : 246/289 places, 457/644 transitions.
Support contains 25 out of 246 places after structural reductions.
[2023-03-12 16:19:05] [INFO ] Flatten gal took : 94 ms
[2023-03-12 16:19:05] [INFO ] Flatten gal took : 35 ms
[2023-03-12 16:19:05] [INFO ] Input system was already deterministic with 457 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 16:19:05] [INFO ] Invariant cache hit.
[2023-03-12 16:19:06] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:19:06] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:19:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-12 16:19:06] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:19:06] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 7 ms to minimize.
[2023-03-12 16:19:06] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 24 ms to minimize.
[2023-03-12 16:19:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2023-03-12 16:19:07] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 5 ms to minimize.
[2023-03-12 16:19:07] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 12 ms to minimize.
[2023-03-12 16:19:07] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 1 ms to minimize.
[2023-03-12 16:19:07] [INFO ] Deduced a trap composed of 34 places in 290 ms of which 1 ms to minimize.
[2023-03-12 16:19:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 907 ms
[2023-03-12 16:19:07] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2023-03-12 16:19:07] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 23 ms to minimize.
[2023-03-12 16:19:08] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 1 ms to minimize.
[2023-03-12 16:19:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 506 ms
[2023-03-12 16:19:08] [INFO ] After 1970ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-12 16:19:08] [INFO ] After 2198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 40 ms.
Support contains 6 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 457/457 transitions.
Graph (trivial) has 223 edges and 246 vertex of which 4 / 246 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 881 edges and 244 vertex of which 241 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 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 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 241 transition count 360
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 125 rules applied. Total rules applied 219 place count 151 transition count 325
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 21 rules applied. Total rules applied 240 place count 132 transition count 323
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 242 place count 130 transition count 323
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 242 place count 130 transition count 316
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 256 place count 123 transition count 316
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 258 place count 121 transition count 314
Iterating global reduction 4 with 2 rules applied. Total rules applied 260 place count 121 transition count 314
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 261 place count 120 transition count 308
Iterating global reduction 4 with 1 rules applied. Total rules applied 262 place count 120 transition count 308
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 362 place count 70 transition count 258
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 373 place count 59 transition count 191
Iterating global reduction 4 with 11 rules applied. Total rules applied 384 place count 59 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 387 place count 59 transition count 188
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 388 place count 59 transition count 187
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 395 place count 59 transition count 180
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 402 place count 52 transition count 180
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 404 place count 52 transition count 178
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 405 place count 52 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 406 place count 51 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 407 place count 50 transition count 177
Applied a total of 407 rules in 141 ms. Remains 50 /246 variables (removed 196) and now considering 177/457 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 50/246 places, 177/457 transitions.
Finished random walk after 2018 steps, including 28 resets, run visited all 3 properties in 9 ms. (steps per millisecond=224 )
Computed a total of 43 stabilizing places and 44 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 457/457 transitions.
Graph (trivial) has 230 edges and 246 vertex of which 4 / 246 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 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 243 transition count 361
Reduce places removed 93 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 131 rules applied. Total rules applied 225 place count 150 transition count 323
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 248 place count 128 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 249 place count 127 transition count 322
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 249 place count 127 transition count 315
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 263 place count 120 transition count 315
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 267 place count 116 transition count 311
Iterating global reduction 4 with 4 rules applied. Total rules applied 271 place count 116 transition count 311
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 273 place count 114 transition count 299
Iterating global reduction 4 with 2 rules applied. Total rules applied 275 place count 114 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 277 place count 114 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 278 place count 113 transition count 297
Performed 48 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 374 place count 65 transition count 248
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 385 place count 54 transition count 181
Iterating global reduction 6 with 11 rules applied. Total rules applied 396 place count 54 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 400 place count 54 transition count 177
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 402 place count 53 transition count 176
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 404 place count 51 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 405 place count 50 transition count 174
Applied a total of 405 rules in 99 ms. Remains 50 /246 variables (removed 196) and now considering 174/457 (removed 283) transitions.
// Phase 1: matrix 174 rows 50 cols
[2023-03-12 16:19:08] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:19:08] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-12 16:19:08] [INFO ] Invariant cache hit.
[2023-03-12 16:19:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:19:09] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [45, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 219 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/246 places, 174/457 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 47 transition count 173
Applied a total of 2 rules in 8 ms. Remains 47 /48 variables (removed 1) and now considering 173/174 (removed 1) transitions.
// Phase 1: matrix 173 rows 47 cols
[2023-03-12 16:19:09] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:19:09] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 16:19:09] [INFO ] Invariant cache hit.
[2023-03-12 16:19:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:09] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/246 places, 173/457 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 548 ms. Remains : 47/246 places, 173/457 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-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:(OR (EQ s40 0) (EQ s34 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]]
Product exploration explored 100000 steps with 102 reset in 178 ms.
Product exploration explored 100000 steps with 247 reset in 107 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 238 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 91 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 295 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 166 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 173/173 transitions.
Applied a total of 0 rules in 20 ms. Remains 47 /47 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-12 16:19:10] [INFO ] Invariant cache hit.
[2023-03-12 16:19:11] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-12 16:19:11] [INFO ] Invariant cache hit.
[2023-03-12 16:19:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:11] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2023-03-12 16:19:11] [INFO ] Redundant transitions in 51 ms returned [170]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 172 rows 47 cols
[2023-03-12 16:19:11] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-12 16:19:11] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/47 places, 172/173 transitions.
Reduce places removed 1 places and 1 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 45 transition count 170
Applied a total of 2 rules in 6 ms. Remains 45 /47 variables (removed 2) and now considering 170/172 (removed 2) transitions.
// Phase 1: matrix 170 rows 45 cols
[2023-03-12 16:19:11] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:19:11] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-12 16:19:11] [INFO ] Invariant cache hit.
[2023-03-12 16:19:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:11] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/47 places, 170/173 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1065 ms. Remains : 45/47 places, 170/173 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 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 139 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 237 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 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 48 reset in 118 ms.
Product exploration explored 100000 steps with 326 reset in 146 ms.
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 170/170 transitions.
Applied a total of 0 rules in 17 ms. Remains 45 /45 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2023-03-12 16:19:13] [INFO ] Invariant cache hit.
[2023-03-12 16:19:13] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-12 16:19:13] [INFO ] Invariant cache hit.
[2023-03-12 16:19:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:13] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-12 16:19:13] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-12 16:19:13] [INFO ] Invariant cache hit.
[2023-03-12 16:19:13] [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 641 ms. Remains : 45/45 places, 170/170 transitions.
Treatment of property AutonomousCar-PT-06b-LTLCardinality-02 finished in 5266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 457/457 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 238 transition count 449
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 238 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 237 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 237 transition count 448
Applied a total of 18 rules in 25 ms. Remains 237 /246 variables (removed 9) and now considering 448/457 (removed 9) transitions.
// Phase 1: matrix 448 rows 237 cols
[2023-03-12 16:19:14] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:19:14] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-12 16:19:14] [INFO ] Invariant cache hit.
[2023-03-12 16:19:14] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-12 16:19:14] [INFO ] Invariant cache hit.
[2023-03-12 16:19:14] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/246 places, 448/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 237/246 places, 448/457 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s64 0) (EQ s34 1) (OR (EQ s34 0) (EQ s169 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 110 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-04 finished in 725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 5 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 457/457 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 239 transition count 450
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 239 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 237 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 237 transition count 448
Applied a total of 18 rules in 13 ms. Remains 237 /246 variables (removed 9) and now considering 448/457 (removed 9) transitions.
// Phase 1: matrix 448 rows 237 cols
[2023-03-12 16:19:14] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:19:14] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-12 16:19:14] [INFO ] Invariant cache hit.
[2023-03-12 16:19:15] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2023-03-12 16:19:15] [INFO ] Invariant cache hit.
[2023-03-12 16:19:16] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/246 places, 448/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1458 ms. Remains : 237/246 places, 448/457 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s204 0), p1:(AND (EQ s108 0) (EQ s171 1) (OR (EQ s140 0) (EQ s193 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-05 finished in 1797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(X(p0))||(p1&&X(p2))))))))'
Support contains 5 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 457/457 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 241 transition count 452
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 241 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 239 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 239 transition count 450
Applied a total of 14 rules in 13 ms. Remains 239 /246 variables (removed 7) and now considering 450/457 (removed 7) transitions.
// Phase 1: matrix 450 rows 239 cols
[2023-03-12 16:19:16] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:19:16] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-12 16:19:16] [INFO ] Invariant cache hit.
[2023-03-12 16:19:17] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-12 16:19:17] [INFO ] Invariant cache hit.
[2023-03-12 16:19:17] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/246 places, 450/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 890 ms. Remains : 239/246 places, 450/457 transitions.
Stuttering acceptance computed with spot in 483 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p1:(EQ s184 0), p2:(AND (EQ s38 0) (EQ s180 1)), p0:(OR (EQ s200 0) (EQ s70 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, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 215 ms.
Product exploration explored 100000 steps with 16666 reset in 177 ms.
Computed a total of 40 stabilizing places and 41 stable transitions
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 221 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 699 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 46 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:19:19] [INFO ] Invariant cache hit.
[2023-03-12 16:19:19] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:19:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 16:19:19] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p1)), (F (AND p1 (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 4 factoid took 452 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 504 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 607 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Applied a total of 0 rules in 3 ms. Remains 239 /239 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2023-03-12 16:19:21] [INFO ] Invariant cache hit.
[2023-03-12 16:19:21] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-12 16:19:21] [INFO ] Invariant cache hit.
[2023-03-12 16:19:21] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-12 16:19:21] [INFO ] Invariant cache hit.
[2023-03-12 16:19:21] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 689 ms. Remains : 239/239 places, 450/450 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Computed a total of 40 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 471 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished Best-First random walk after 9179 steps, including 17 resets, run visited all 2 properties in 15 ms. (steps per millisecond=611 )
Knowledge obtained : [(AND (NOT p2) p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 357 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 607 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 708 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 703 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 16666 reset in 230 ms.
Product exploration explored 100000 steps with 16666 reset in 284 ms.
Applying partial POR strategy [false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 736 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 217 edges and 239 vertex of which 4 / 239 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.
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 237 transition count 448
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 96 place count 237 transition count 436
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 96 place count 237 transition count 436
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 110 place count 237 transition count 436
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 173 place count 174 transition count 373
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 236 place count 174 transition count 373
Performed 67 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 2 with 67 rules applied. Total rules applied 303 place count 174 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 174 transition count 382
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 362 place count 116 transition count 258
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 3 with 58 rules applied. Total rules applied 420 place count 116 transition count 258
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 430 place count 116 transition count 248
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 435 place count 111 transition count 243
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 440 place count 111 transition count 243
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 442 place count 111 transition count 248
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 444 place count 111 transition count 246
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 446 place count 109 transition count 242
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 448 place count 109 transition count 242
Deduced a syphon composed of 52 places in 1 ms
Applied a total of 448 rules in 85 ms. Remains 109 /239 variables (removed 130) and now considering 242/450 (removed 208) transitions.
[2023-03-12 16:19:26] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 242 rows 109 cols
[2023-03-12 16:19:26] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-12 16:19:26] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/239 places, 242/450 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 109/239 places, 242/450 transitions.
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 450/450 (removed 0) transitions.
// Phase 1: matrix 450 rows 239 cols
[2023-03-12 16:19:26] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:19:26] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-12 16:19:26] [INFO ] Invariant cache hit.
[2023-03-12 16:19:27] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2023-03-12 16:19:27] [INFO ] Invariant cache hit.
[2023-03-12 16:19:27] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 811 ms. Remains : 239/239 places, 450/450 transitions.
Treatment of property AutonomousCar-PT-06b-LTLCardinality-06 finished in 11159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 457/457 transitions.
Graph (trivial) has 230 edges and 246 vertex of which 4 / 246 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 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 243 transition count 359
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 131 rules applied. Total rules applied 227 place count 148 transition count 323
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 249 place count 127 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 126 transition count 322
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 250 place count 126 transition count 315
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 264 place count 119 transition count 315
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 269 place count 114 transition count 310
Iterating global reduction 4 with 5 rules applied. Total rules applied 274 place count 114 transition count 310
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 276 place count 112 transition count 298
Iterating global reduction 4 with 2 rules applied. Total rules applied 278 place count 112 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 282 place count 112 transition count 294
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 284 place count 110 transition count 294
Performed 46 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 376 place count 64 transition count 247
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 386 place count 54 transition count 187
Iterating global reduction 6 with 10 rules applied. Total rules applied 396 place count 54 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 400 place count 54 transition count 183
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 402 place count 53 transition count 182
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 403 place count 53 transition count 182
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 405 place count 51 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 406 place count 50 transition count 180
Applied a total of 406 rules in 42 ms. Remains 50 /246 variables (removed 196) and now considering 180/457 (removed 277) transitions.
// Phase 1: matrix 180 rows 50 cols
[2023-03-12 16:19:27] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:19:28] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-12 16:19:28] [INFO ] Invariant cache hit.
[2023-03-12 16:19:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:19:28] [INFO ] Implicit Places using invariants and state equation in 156 ms returned [45, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 523 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/246 places, 180/457 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 47 transition count 179
Applied a total of 2 rules in 7 ms. Remains 47 /48 variables (removed 1) and now considering 179/180 (removed 1) transitions.
// Phase 1: matrix 179 rows 47 cols
[2023-03-12 16:19:28] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:19:28] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-12 16:19:28] [INFO ] Invariant cache hit.
[2023-03-12 16:19:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:28] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/246 places, 179/457 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 891 ms. Remains : 47/246 places, 179/457 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-08 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:(AND (NEQ s30 0) (NEQ s40 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 19 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-08 finished in 1028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))||G(p1))))))'
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 457/457 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 238 transition count 449
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 238 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 236 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 236 transition count 447
Applied a total of 20 rules in 11 ms. Remains 236 /246 variables (removed 10) and now considering 447/457 (removed 10) transitions.
// Phase 1: matrix 447 rows 236 cols
[2023-03-12 16:19:28] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-12 16:19:28] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-12 16:19:28] [INFO ] Invariant cache hit.
[2023-03-12 16:19:29] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2023-03-12 16:19:29] [INFO ] Invariant cache hit.
[2023-03-12 16:19:29] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/246 places, 447/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 938 ms. Remains : 236/246 places, 447/457 transitions.
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (EQ s68 0) (EQ s176 1)), p0:(AND (EQ s221 0) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-11 finished in 1331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 457/457 transitions.
Graph (trivial) has 231 edges and 246 vertex of which 4 / 246 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 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 243 transition count 359
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 133 rules applied. Total rules applied 229 place count 148 transition count 321
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 252 place count 126 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 253 place count 125 transition count 320
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 253 place count 125 transition count 314
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 265 place count 119 transition count 314
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 269 place count 115 transition count 310
Iterating global reduction 4 with 4 rules applied. Total rules applied 273 place count 115 transition count 310
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 275 place count 113 transition count 298
Iterating global reduction 4 with 2 rules applied. Total rules applied 277 place count 113 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 281 place count 113 transition count 294
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 283 place count 111 transition count 294
Performed 47 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 377 place count 64 transition count 246
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 388 place count 53 transition count 179
Iterating global reduction 6 with 11 rules applied. Total rules applied 399 place count 53 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 403 place count 53 transition count 175
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 405 place count 52 transition count 174
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 407 place count 50 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 408 place count 49 transition count 172
Applied a total of 408 rules in 67 ms. Remains 49 /246 variables (removed 197) and now considering 172/457 (removed 285) transitions.
// Phase 1: matrix 172 rows 49 cols
[2023-03-12 16:19:30] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 16:19:30] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-12 16:19:30] [INFO ] Invariant cache hit.
[2023-03-12 16:19:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:19:30] [INFO ] Implicit Places using invariants and state equation in 113 ms returned [43, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 413 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/246 places, 172/457 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 46 transition count 171
Applied a total of 2 rules in 4 ms. Remains 46 /47 variables (removed 1) and now considering 171/172 (removed 1) transitions.
// Phase 1: matrix 171 rows 46 cols
[2023-03-12 16:19:30] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:19:30] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-12 16:19:30] [INFO ] Invariant cache hit.
[2023-03-12 16:19:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:30] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/246 places, 171/457 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 732 ms. Remains : 46/246 places, 171/457 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s42 0) (EQ s38 1))], nbAcceptance=1, 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 115 reset in 94 ms.
Product exploration explored 100000 steps with 70 reset in 89 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 252 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 1917 steps, including 114 resets, run visited all 1 properties in 9 ms. (steps per millisecond=213 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 171/171 transitions.
Applied a total of 0 rules in 16 ms. Remains 46 /46 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2023-03-12 16:19:31] [INFO ] Invariant cache hit.
[2023-03-12 16:19:31] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-12 16:19:31] [INFO ] Invariant cache hit.
[2023-03-12 16:19:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:31] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-12 16:19:31] [INFO ] Redundant transitions in 16 ms returned [168]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 170 rows 46 cols
[2023-03-12 16:19:31] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 16:19:32] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/46 places, 170/171 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /46 variables (removed 1) and now considering 169/170 (removed 1) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 572 ms. Remains : 45/46 places, 169/171 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 3102 steps, including 193 resets, run visited all 1 properties in 11 ms. (steps per millisecond=282 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 44 reset in 58 ms.
Product exploration explored 100000 steps with 80 reset in 44 ms.
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 169/169 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 169/169 (removed 0) transitions.
// Phase 1: matrix 169 rows 45 cols
[2023-03-12 16:19:32] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:19:32] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-12 16:19:32] [INFO ] Invariant cache hit.
[2023-03-12 16:19:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:33] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-12 16:19:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 16:19:33] [INFO ] Invariant cache hit.
[2023-03-12 16:19:33] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 682 ms. Remains : 45/45 places, 169/169 transitions.
Treatment of property AutonomousCar-PT-06b-LTLCardinality-12 finished in 3509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U p1))))'
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 457/457 transitions.
Graph (trivial) has 226 edges and 246 vertex of which 4 / 246 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 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 243 transition count 364
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 126 rules applied. Total rules applied 217 place count 153 transition count 328
Reduce places removed 21 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 25 rules applied. Total rules applied 242 place count 132 transition count 324
Reduce places removed 4 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 6 rules applied. Total rules applied 248 place count 128 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 249 place count 127 transition count 322
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 249 place count 127 transition count 315
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 263 place count 120 transition count 315
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 268 place count 115 transition count 310
Iterating global reduction 5 with 5 rules applied. Total rules applied 273 place count 115 transition count 310
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 275 place count 113 transition count 298
Iterating global reduction 5 with 2 rules applied. Total rules applied 277 place count 113 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 281 place count 113 transition count 294
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 283 place count 111 transition count 294
Performed 45 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 7 with 90 rules applied. Total rules applied 373 place count 66 transition count 248
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 384 place count 55 transition count 181
Iterating global reduction 7 with 11 rules applied. Total rules applied 395 place count 55 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 398 place count 55 transition count 178
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 8 with 2 rules applied. Total rules applied 400 place count 54 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 402 place count 52 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 403 place count 51 transition count 175
Applied a total of 403 rules in 52 ms. Remains 51 /246 variables (removed 195) and now considering 175/457 (removed 282) transitions.
// Phase 1: matrix 175 rows 51 cols
[2023-03-12 16:19:33] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 16:19:33] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 16:19:33] [INFO ] Invariant cache hit.
[2023-03-12 16:19:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:19:33] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [46, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 184 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/246 places, 175/457 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 48 transition count 174
Applied a total of 2 rules in 3 ms. Remains 48 /49 variables (removed 1) and now considering 174/175 (removed 1) transitions.
// Phase 1: matrix 174 rows 48 cols
[2023-03-12 16:19:33] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:19:33] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-12 16:19:33] [INFO ] Invariant cache hit.
[2023-03-12 16:19:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:34] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/246 places, 174/457 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 510 ms. Remains : 48/246 places, 174/457 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s44 1), p0:(OR (EQ s25 0) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLCardinality-13 finished in 621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(X(p0))||(p1&&X(p2))))))))'
Found a Shortening insensitive property : AutonomousCar-PT-06b-LTLCardinality-06
Stuttering acceptance computed with spot in 543 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 5 out of 246 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 246/246 places, 457/457 transitions.
Graph (trivial) has 224 edges and 246 vertex of which 4 / 246 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 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 243 transition count 365
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 118 rules applied. Total rules applied 208 place count 154 transition count 336
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 18 rules applied. Total rules applied 226 place count 137 transition count 335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 136 transition count 335
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 227 place count 136 transition count 325
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 247 place count 126 transition count 325
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 251 place count 122 transition count 321
Iterating global reduction 4 with 4 rules applied. Total rules applied 255 place count 122 transition count 321
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 257 place count 120 transition count 309
Iterating global reduction 4 with 2 rules applied. Total rules applied 259 place count 120 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 261 place count 120 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 262 place count 119 transition count 307
Performed 49 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 360 place count 70 transition count 256
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 371 place count 59 transition count 189
Iterating global reduction 6 with 11 rules applied. Total rules applied 382 place count 59 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 386 place count 59 transition count 185
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 388 place count 58 transition count 184
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 389 place count 58 transition count 184
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 391 place count 56 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 392 place count 55 transition count 182
Applied a total of 392 rules in 64 ms. Remains 55 /246 variables (removed 191) and now considering 182/457 (removed 275) transitions.
// Phase 1: matrix 182 rows 55 cols
[2023-03-12 16:19:35] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 16:19:35] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-12 16:19:35] [INFO ] Invariant cache hit.
[2023-03-12 16:19:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:19:35] [INFO ] Implicit Places using invariants and state equation in 238 ms returned [50, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 333 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 53/246 places, 182/457 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 52 transition count 181
Applied a total of 2 rules in 5 ms. Remains 52 /53 variables (removed 1) and now considering 181/182 (removed 1) transitions.
// Phase 1: matrix 181 rows 52 cols
[2023-03-12 16:19:35] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:19:35] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-12 16:19:35] [INFO ] Invariant cache hit.
[2023-03-12 16:19:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:35] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 52/246 places, 181/457 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 830 ms. Remains : 52/246 places, 181/457 transitions.
Running random walk in product with property : AutonomousCar-PT-06b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p1:(EQ s42 0), p2:(AND (EQ s8 0) (EQ s39 1)), p0:(OR (EQ s46 0) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16936 reset in 181 ms.
Product exploration explored 100000 steps with 16949 reset in 186 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 p1 (NOT p2) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 634 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 602 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:19:37] [INFO ] Invariant cache hit.
[2023-03-12 16:19:37] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:19:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-12 16:19:37] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p1)), (F (AND p1 (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 4 factoid took 393 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 504 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 630 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 181/181 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2023-03-12 16:19:38] [INFO ] Invariant cache hit.
[2023-03-12 16:19:38] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-12 16:19:38] [INFO ] Invariant cache hit.
[2023-03-12 16:19:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:39] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-12 16:19:39] [INFO ] Invariant cache hit.
[2023-03-12 16:19:39] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 52/52 places, 181/181 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 (NOT p2) p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 532 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 9862 steps, including 608 resets, run visited all 5 properties in 85 ms. (steps per millisecond=116 )
Knowledge obtained : [(AND (NOT p2) p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 235 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 609 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 479 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 578 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 16953 reset in 167 ms.
Product exploration explored 100000 steps with 16948 reset in 217 ms.
Applying partial POR strategy [false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 480 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 181/181 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2023-03-12 16:19:42] [INFO ] Redundant transitions in 25 ms returned [176]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 180 rows 52 cols
[2023-03-12 16:19:42] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-12 16:19:43] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/52 places, 180/181 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 184
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 184/180 (removed -4) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/52 places, 184/181 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 221 ms. Remains : 52/52 places, 184/181 transitions.
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 181/181 transitions.
Applied a total of 0 rules in 0 ms. Remains 52 /52 variables (removed 0) and now considering 181/181 (removed 0) transitions.
// Phase 1: matrix 181 rows 52 cols
[2023-03-12 16:19:43] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 16:19:43] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 16:19:43] [INFO ] Invariant cache hit.
[2023-03-12 16:19:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:19:43] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-12 16:19:43] [INFO ] Invariant cache hit.
[2023-03-12 16:19:43] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 395 ms. Remains : 52/52 places, 181/181 transitions.
Treatment of property AutonomousCar-PT-06b-LTLCardinality-06 finished in 9258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-12 16:19:43] [INFO ] Flatten gal took : 25 ms
[2023-03-12 16:19:43] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 16:19:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 246 places, 457 transitions and 2574 arcs took 5 ms.
Total runtime 40664 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1777/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1777/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1777/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-06b-LTLCardinality-02
Could not compute solution for formula : AutonomousCar-PT-06b-LTLCardinality-06
Could not compute solution for formula : AutonomousCar-PT-06b-LTLCardinality-12

BK_STOP 1678637984715

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutonomousCar-PT-06b-LTLCardinality-02
ltl formula formula --ltl=/tmp/1777/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 246 places, 457 transitions and 2574 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1777/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1777/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.060 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1777/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1777/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name AutonomousCar-PT-06b-LTLCardinality-06
ltl formula formula --ltl=/tmp/1777/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 246 places, 457 transitions and 2574 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.020 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1777/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1777/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1777/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1777/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name AutonomousCar-PT-06b-LTLCardinality-12
ltl formula formula --ltl=/tmp/1777/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 246 places, 457 transitions and 2574 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1777/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1777/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1777/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1777/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-06b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-06b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598200619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06b.tgz
mv AutonomousCar-PT-06b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;