Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.3K Jun 7 15:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 7 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 7 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 110K Jun 3 16:02 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654899525788

Running Version 202205111006
[2022-06-10 22:18:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 22:18:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 22:18:48] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2022-06-10 22:18:48] [INFO ] Transformed 221 places.
[2022-06-10 22:18:48] [INFO ] Transformed 368 transitions.
[2022-06-10 22:18:48] [INFO ] Found NUPN structural information;
[2022-06-10 22:18:48] [INFO ] Parsed PT model containing 221 places and 368 transitions in 425 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA AutonomousCar-PT-04b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 192 transition count 339
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 192 transition count 339
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 122 place count 192 transition count 275
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 126 place count 188 transition count 271
Iterating global reduction 1 with 4 rules applied. Total rules applied 130 place count 188 transition count 271
Applied a total of 130 rules in 113 ms. Remains 188 /221 variables (removed 33) and now considering 271/368 (removed 97) transitions.
// Phase 1: matrix 271 rows 188 cols
[2022-06-10 22:18:49] [INFO ] Computed 9 place invariants in 26 ms
[2022-06-10 22:18:49] [INFO ] Implicit Places using invariants in 379 ms returned []
// Phase 1: matrix 271 rows 188 cols
[2022-06-10 22:18:49] [INFO ] Computed 9 place invariants in 7 ms
[2022-06-10 22:18:49] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
// Phase 1: matrix 271 rows 188 cols
[2022-06-10 22:18:49] [INFO ] Computed 9 place invariants in 6 ms
[2022-06-10 22:18:50] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/221 places, 271/368 transitions.
Finished structural reductions, in 1 iterations. Remains : 188/221 places, 271/368 transitions.
Support contains 36 out of 188 places after structural reductions.
[2022-06-10 22:18:50] [INFO ] Flatten gal took : 115 ms
[2022-06-10 22:18:50] [INFO ] Flatten gal took : 50 ms
[2022-06-10 22:18:50] [INFO ] Input system was already deterministic with 271 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 892 ms. (steps per millisecond=11 ) properties (out of 28) seen :19
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 271 rows 188 cols
[2022-06-10 22:18:52] [INFO ] Computed 9 place invariants in 5 ms
[2022-06-10 22:18:52] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-06-10 22:18:52] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 22:18:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-10 22:18:52] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 22:18:53] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 5 ms to minimize.
[2022-06-10 22:18:53] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2022-06-10 22:18:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 275 ms
[2022-06-10 22:18:53] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-06-10 22:18:53] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 188/188 places, 271/271 transitions.
Graph (trivial) has 176 edges and 188 vertex of which 4 / 188 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 527 edges and 186 vertex of which 180 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 180 transition count 190
Reduce places removed 71 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 100 rules applied. Total rules applied 175 place count 109 transition count 161
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 192 place count 92 transition count 161
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 192 place count 92 transition count 155
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 204 place count 86 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 206 place count 84 transition count 153
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 84 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 209 place count 83 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 83 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 212 place count 83 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 213 place count 82 transition count 147
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 285 place count 46 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 286 place count 46 transition count 110
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 293 place count 39 transition count 81
Iterating global reduction 6 with 7 rules applied. Total rules applied 300 place count 39 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 302 place count 39 transition count 79
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 304 place count 38 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 306 place count 37 transition count 91
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 310 place count 37 transition count 87
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 314 place count 33 transition count 87
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 315 place count 33 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 316 place count 32 transition count 86
Applied a total of 316 rules in 106 ms. Remains 32 /188 variables (removed 156) and now considering 86/271 (removed 185) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/188 places, 86/271 transitions.
Finished random walk after 683 steps, including 27 resets, run visited all 1 properties in 7 ms. (steps per millisecond=97 )
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-04b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 34 stabilizing places and 35 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 271/271 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 181 transition count 264
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 181 transition count 264
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 179 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 179 transition count 262
Applied a total of 18 rules in 21 ms. Remains 179 /188 variables (removed 9) and now considering 262/271 (removed 9) transitions.
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:18:53] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:18:53] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:18:53] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:18:54] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:18:54] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 22:18:54] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/188 places, 262/271 transitions.
Finished structural reductions, in 1 iterations. Remains : 179/188 places, 262/271 transitions.
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s4 0) (EQ s13 0) (EQ s45 0) (EQ s145 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 164 steps with 1 reset in 5 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-01 finished in 1070 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!p0 U p0)||X(G(p1))||p2)))'
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 271/271 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 182 transition count 265
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 182 transition count 265
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 180 transition count 263
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 180 transition count 263
Applied a total of 16 rules in 11 ms. Remains 180 /188 variables (removed 8) and now considering 263/271 (removed 8) transitions.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:18:54] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:18:54] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:18:54] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:18:55] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:18:55] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:18:55] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/188 places, 263/271 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/188 places, 263/271 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s77 1), p0:(AND (EQ s4 1) (EQ s12 1) (EQ s106 1) (EQ s146 1)), p1:(OR (EQ s77 0) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33358 reset in 601 ms.
Product exploration explored 100000 steps with 33372 reset in 412 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 284 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:18:57] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:18:57] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2022-06-10 22:18:57] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (G (NOT (AND p2 p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 542 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 6 out of 180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 180 /180 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:18:58] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:18:58] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:18:58] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 22:18:58] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:18:58] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:18:58] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/180 places, 263/263 transitions.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :2
Finished Best-First random walk after 8254 steps, including 25 resets, run visited all 1 properties in 14 ms. (steps per millisecond=589 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 296 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 33444 reset in 191 ms.
Product exploration explored 100000 steps with 33370 reset in 323 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 6 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 263/263 transitions.
Graph (trivial) has 164 edges and 180 vertex of which 4 / 180 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 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 178 transition count 261
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 74 place count 178 transition count 251
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 74 place count 178 transition count 251
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 87 place count 178 transition count 251
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 138 place count 127 transition count 200
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 189 place count 127 transition count 200
Performed 49 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 238 place count 127 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 240 place count 127 transition count 205
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 278 place count 89 transition count 142
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 3 with 38 rules applied. Total rules applied 316 place count 89 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 320 place count 89 transition count 138
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 323 place count 86 transition count 135
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 326 place count 86 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 327 place count 86 transition count 135
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 329 place count 84 transition count 133
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 331 place count 84 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 333 place count 84 transition count 151
Deduced a syphon composed of 43 places in 0 ms
Applied a total of 333 rules in 69 ms. Remains 84 /180 variables (removed 96) and now considering 151/263 (removed 112) transitions.
[2022-06-10 22:19:01] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 151 rows 84 cols
[2022-06-10 22:19:01] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:19:01] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/180 places, 151/263 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/180 places, 151/263 transitions.
Product exploration explored 100000 steps with 33443 reset in 694 ms.
Product exploration explored 100000 steps with 33328 reset in 559 ms.
Built C files in :
/tmp/ltsmin16227828000426660973
[2022-06-10 22:19:02] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16227828000426660973
Running compilation step : cd /tmp/ltsmin16227828000426660973;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 943 ms.
Running link step : cd /tmp/ltsmin16227828000426660973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin16227828000426660973;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased146513276142772618.hoa' '--buchi-type=spotba'
LTSmin run took 6025 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04b-LTLFireability-02 finished in 14735 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(!p0) U G(!p0)))||F(p1)))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 271/271 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 182 transition count 265
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 182 transition count 265
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 180 transition count 263
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 180 transition count 263
Applied a total of 16 rules in 11 ms. Remains 180 /188 variables (removed 8) and now considering 263/271 (removed 8) transitions.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:19:09] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:19:09] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:19:09] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:19:09] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:19:09] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:19:09] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/188 places, 263/271 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/188 places, 263/271 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s101 1), p0:(AND (EQ s129 1) (EQ s159 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]]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Stack based approach found an accepted trace after 222 steps with 0 reset with depth 223 and stack size 223 in 1 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-03 finished in 727 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !X(X((G(X(F(p1))) U (F(p2)&&p2))))))'
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 271/271 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 182 transition count 265
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 182 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 181 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 181 transition count 264
Applied a total of 14 rules in 9 ms. Remains 181 /188 variables (removed 7) and now considering 264/271 (removed 7) transitions.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:19:10] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:19:10] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:19:10] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:19:10] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:19:10] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:19:10] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/188 places, 264/271 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/188 places, 264/271 transitions.
Stuttering acceptance computed with spot in 431 ms :[p2, (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (NOT p0), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND p1 p2), (AND (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-07 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: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(NOT p2), acceptance={} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 10}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}], [{ cond=(NOT p0), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND p1 (NOT p2)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p1) p2), acceptance={1} source=9 dest: 9}, { cond=(AND p1 p2), acceptance={0, 1} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=10 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=10 dest: 10}]], initial=0, aps=[p0:(EQ s15 1), p2:(EQ s139 1), p1:(AND (EQ s4 1) (EQ s12 1) (EQ s89 1) (EQ s147 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23125 reset in 280 ms.
Product exploration explored 100000 steps with 23267 reset in 311 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Detected a total of 33/181 stabilizing places and 34/264 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 5 factoid took 426 ms. Reduced automaton from 11 states, 22 edges and 3 AP to 7 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 266 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND p1 p2), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:19:12] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:19:12] [INFO ] [Real]Absence check using 9 positive place invariants in 22 ms returned sat
[2022-06-10 22:19:12] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND p2 (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p0))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 495 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 7 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 302 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND p1 p2), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 265 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND p1 p2), (AND (NOT p0) p1)]
Support contains 6 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Applied a total of 0 rules in 3 ms. Remains 181 /181 variables (removed 0) and now considering 264/264 (removed 0) transitions.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:19:13] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:19:13] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:19:13] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:19:14] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:19:14] [INFO ] Computed 9 place invariants in 4 ms
[2022-06-10 22:19:14] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/181 places, 264/264 transitions.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Detected a total of 33/181 stabilizing places and 34/264 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 450 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 7 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 382 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND p1 p2), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:19:15] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:19:15] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2022-06-10 22:19:15] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (AND p2 (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p0))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 604 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 7 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 278 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND p1 p2), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 257 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND p1 p2), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 367 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND p1 p2), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 13609 reset in 260 ms.
Product exploration explored 100000 steps with 13624 reset in 290 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 268 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND p1 p2), (AND (NOT p0) p1)]
Support contains 6 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Graph (trivial) has 167 edges and 181 vertex of which 4 / 181 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 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 179 transition count 262
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 77 place count 179 transition count 251
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 77 place count 179 transition count 251
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 90 place count 179 transition count 251
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 144 place count 125 transition count 197
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 198 place count 125 transition count 197
Performed 47 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 245 place count 125 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 247 place count 125 transition count 201
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 288 place count 84 transition count 135
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 3 with 41 rules applied. Total rules applied 329 place count 84 transition count 135
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 335 place count 84 transition count 129
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 339 place count 80 transition count 125
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 343 place count 80 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 344 place count 80 transition count 125
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 346 place count 78 transition count 123
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 348 place count 78 transition count 123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 350 place count 78 transition count 141
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 350 rules in 50 ms. Remains 78 /181 variables (removed 103) and now considering 141/264 (removed 123) transitions.
[2022-06-10 22:19:18] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 141 rows 78 cols
[2022-06-10 22:19:18] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:19:18] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/181 places, 141/264 transitions.
Finished structural reductions, in 1 iterations. Remains : 78/181 places, 141/264 transitions.
Product exploration explored 100000 steps with 13589 reset in 347 ms.
Product exploration explored 100000 steps with 13626 reset in 335 ms.
Built C files in :
/tmp/ltsmin3335109179346504160
[2022-06-10 22:19:19] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3335109179346504160
Running compilation step : cd /tmp/ltsmin3335109179346504160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 798 ms.
Running link step : cd /tmp/ltsmin3335109179346504160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3335109179346504160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18288551693619437949.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 264/264 transitions.
Applied a total of 0 rules in 2 ms. Remains 181 /181 variables (removed 0) and now considering 264/264 (removed 0) transitions.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:19:34] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:19:34] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:19:34] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:19:34] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:19:34] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 22:19:34] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/181 places, 264/264 transitions.
Built C files in :
/tmp/ltsmin1424487004158323325
[2022-06-10 22:19:34] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1424487004158323325
Running compilation step : cd /tmp/ltsmin1424487004158323325;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 784 ms.
Running link step : cd /tmp/ltsmin1424487004158323325;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1424487004158323325;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1865416014956486251.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 22:19:50] [INFO ] Flatten gal took : 24 ms
[2022-06-10 22:19:50] [INFO ] Flatten gal took : 23 ms
[2022-06-10 22:19:50] [INFO ] Time to serialize gal into /tmp/LTL15935050454278847749.gal : 7 ms
[2022-06-10 22:19:50] [INFO ] Time to serialize properties into /tmp/LTL7742742115687301276.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15935050454278847749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7742742115687301276.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1593505...267
Read 1 LTL properties
Checking formula 0 : !(((F("(p18==1)"))U(!(X(X((G(X(F("(((p6==1)&&(p15==1))&&((p107==1)&&(p178==1)))"))))U((F("(p167==1)"))&&("(p167==1)"))))))))
Formula 0 simplified : !(F"(p18==1)" U !XX(GXF"(((p6==1)&&(p15==1))&&((p107==1)&&(p178==1)))" U ("(p167==1)" & F"(p167==1)")))
Detected timeout of ITS tools.
[2022-06-10 22:20:05] [INFO ] Flatten gal took : 23 ms
[2022-06-10 22:20:05] [INFO ] Applying decomposition
[2022-06-10 22:20:05] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4091286903138095095.txt' '-o' '/tmp/graph4091286903138095095.bin' '-w' '/tmp/graph4091286903138095095.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4091286903138095095.bin' '-l' '-1' '-v' '-w' '/tmp/graph4091286903138095095.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:20:05] [INFO ] Decomposing Gal with order
[2022-06-10 22:20:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:20:05] [INFO ] Removed a total of 243 redundant transitions.
[2022-06-10 22:20:05] [INFO ] Flatten gal took : 125 ms
[2022-06-10 22:20:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 20 ms.
[2022-06-10 22:20:05] [INFO ] Time to serialize gal into /tmp/LTL9834867140915845906.gal : 11 ms
[2022-06-10 22:20:05] [INFO ] Time to serialize properties into /tmp/LTL5839043906489427489.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9834867140915845906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5839043906489427489.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9834867...245
Read 1 LTL properties
Checking formula 0 : !(((F("(i1.i1.u6.p18==1)"))U(!(X(X((G(X(F("(((i0.u1.p6==1)&&(i0.u1.p15==1))&&((i8.i1.u32.p107==1)&&(i0.u1.p178==1)))"))))U((F("(i11.i1...204
Formula 0 simplified : !(F"(i1.i1.u6.p18==1)" U !XX(GXF"(((i0.u1.p6==1)&&(i0.u1.p15==1))&&((i8.i1.u32.p107==1)&&(i0.u1.p178==1)))" U ("(i11.i1.u51.p167==1)...185
Reverse transition relation is NOT exact ! Due to transitions t175, t183, t195, t215, t239, t268, u54.t34, u54.t37, u54.t38, u54.t39, i0.t173, i4.t166, i4....616
Computing Next relation with stutter on 3616 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13544830057314805935
[2022-06-10 22:20:20] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13544830057314805935
Running compilation step : cd /tmp/ltsmin13544830057314805935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 779 ms.
Running link step : cd /tmp/ltsmin13544830057314805935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13544830057314805935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true)) U !X(X(([](X(<>((LTLAPp1==true)))) U (<>((LTLAPp2==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-04b-LTLFireability-07 finished in 85647 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(G((F(X(!G((p0 U p1))))&&p2))) U p3))'
Support contains 11 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 271/271 transitions.
Graph (trivial) has 161 edges and 188 vertex of which 4 / 188 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 185 transition count 200
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 94 rules applied. Total rules applied 163 place count 117 transition count 174
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 17 rules applied. Total rules applied 180 place count 102 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 182 place count 100 transition count 172
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 182 place count 100 transition count 165
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 196 place count 93 transition count 165
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 199 place count 90 transition count 162
Iterating global reduction 4 with 3 rules applied. Total rules applied 202 place count 90 transition count 162
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 203 place count 89 transition count 158
Iterating global reduction 4 with 1 rules applied. Total rules applied 204 place count 89 transition count 158
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 206 place count 89 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 207 place count 88 transition count 156
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 265 place count 59 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 266 place count 59 transition count 125
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 270 place count 55 transition count 111
Iterating global reduction 7 with 4 rules applied. Total rules applied 274 place count 55 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 276 place count 55 transition count 109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 280 place count 53 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 282 place count 52 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 283 place count 51 transition count 119
Applied a total of 283 rules in 47 ms. Remains 51 /188 variables (removed 137) and now considering 119/271 (removed 152) transitions.
// Phase 1: matrix 119 rows 51 cols
[2022-06-10 22:20:35] [INFO ] Computed 8 place invariants in 0 ms
[2022-06-10 22:20:35] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 119 rows 51 cols
[2022-06-10 22:20:35] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-10 22:20:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-06-10 22:20:36] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [46, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 139 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/188 places, 119/271 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 48 transition count 118
Applied a total of 2 rules in 9 ms. Remains 48 /49 variables (removed 1) and now considering 118/119 (removed 1) transitions.
// Phase 1: matrix 118 rows 48 cols
[2022-06-10 22:20:36] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:20:36] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 118 rows 48 cols
[2022-06-10 22:20:36] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 22:20:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-10 22:20:36] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/188 places, 118/271 transitions.
Finished structural reductions, in 2 iterations. Remains : 48/188 places, 118/271 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p3), (OR (NOT p3) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={} source=1 dest: 2}, { cond=(AND p3 p2 (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s44 1), p2:(NEQ s10 1), p1:(AND (EQ s2 1) (EQ s3 1) (EQ s23 1) (EQ s41 1)), p0:(AND (EQ s16 1) (EQ s20 1) (EQ s28 1) (EQ s35 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 29 steps with 2 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-08 finished in 501 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))||F(G(X(p1)))||G(p2)))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 271/271 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 181 transition count 264
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 181 transition count 264
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 179 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 179 transition count 262
Applied a total of 18 rules in 9 ms. Remains 179 /188 variables (removed 9) and now considering 262/271 (removed 9) transitions.
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:20:36] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:20:36] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:20:36] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:20:36] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:20:36] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 22:20:37] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/188 places, 262/271 transitions.
Finished structural reductions, in 1 iterations. Remains : 179/188 places, 262/271 transitions.
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s4 1) (EQ s6 1) (EQ s80 1) (EQ s145 1)), p0:(OR (EQ s4 0) (EQ s6 0) (EQ s80 0) (EQ s145 0)), p1:(EQ s142 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, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-09 finished in 1020 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(F(p0))||G(p1)))||X(p2)||F(p3))))'
Support contains 8 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 271/271 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 182 transition count 265
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 182 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 181 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 181 transition count 264
Applied a total of 14 rules in 12 ms. Remains 181 /188 variables (removed 7) and now considering 264/271 (removed 7) transitions.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:20:37] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:20:37] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:20:37] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:20:37] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:20:37] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:20:38] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/188 places, 264/271 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/188 places, 264/271 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(AND (EQ s4 1) (EQ s13 1) (EQ s89 1) (EQ s145 1)), p2:(AND (EQ s4 1) (EQ s11 1) (EQ s43 1) (EQ s145 1)), p1:(EQ s165 1), p0:(EQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-11 finished in 977 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&X(F((F((X(p2) U p3))&&p1))))))'
Support contains 7 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 271/271 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 182 transition count 265
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 182 transition count 265
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 180 transition count 263
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 180 transition count 263
Applied a total of 16 rules in 10 ms. Remains 180 /188 variables (removed 8) and now considering 263/271 (removed 8) transitions.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:20:38] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:20:38] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:20:38] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:20:38] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:20:38] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:20:39] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/188 places, 263/271 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/188 places, 263/271 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s76 1), p1:(AND (EQ s4 1) (EQ s11 1) (EQ s70 1) (EQ s146 1)), p3:(AND (EQ s4 1) (EQ s6 1) (EQ s121 1) (EQ s146 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-12 finished in 1008 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 271/271 transitions.
Graph (trivial) has 177 edges and 188 vertex of which 4 / 188 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 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 185 transition count 194
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 101 rules applied. Total rules applied 176 place count 111 transition count 167
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 192 place count 95 transition count 167
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 192 place count 95 transition count 160
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 206 place count 88 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 209 place count 85 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 212 place count 85 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 213 place count 84 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 84 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 216 place count 84 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 217 place count 83 transition count 151
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 289 place count 47 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 290 place count 47 transition count 113
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 297 place count 40 transition count 85
Iterating global reduction 6 with 7 rules applied. Total rules applied 304 place count 40 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 307 place count 40 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 311 place count 38 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 313 place count 37 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 315 place count 35 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 316 place count 34 transition count 91
Applied a total of 316 rules in 39 ms. Remains 34 /188 variables (removed 154) and now considering 91/271 (removed 180) transitions.
// Phase 1: matrix 91 rows 34 cols
[2022-06-10 22:20:39] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:20:39] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 91 rows 34 cols
[2022-06-10 22:20:39] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:20:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 22:20:39] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [29, 33]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 197 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/188 places, 91/271 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 31 transition count 90
Applied a total of 2 rules in 7 ms. Remains 31 /32 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 31 cols
[2022-06-10 22:20:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:20:39] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 90 rows 31 cols
[2022-06-10 22:20:39] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-10 22:20:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:20:39] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/188 places, 90/271 transitions.
Finished structural reductions, in 2 iterations. Remains : 31/188 places, 90/271 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-15 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:(NEQ s20 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 480 reset in 166 ms.
Product exploration explored 100000 steps with 259 reset in 183 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 90/90 transitions.
Applied a total of 0 rules in 11 ms. Remains 31 /31 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 31 cols
[2022-06-10 22:20:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:20:41] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 90 rows 31 cols
[2022-06-10 22:20:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:20:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:20:41] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2022-06-10 22:20:41] [INFO ] Redundant transitions in 14 ms returned [27]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 89 rows 31 cols
[2022-06-10 22:20:41] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:20:41] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/31 places, 89/90 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 29 transition count 87
Applied a total of 2 rules in 9 ms. Remains 29 /31 variables (removed 2) and now considering 87/89 (removed 2) transitions.
// Phase 1: matrix 87 rows 29 cols
[2022-06-10 22:20:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:20:41] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 87 rows 29 cols
[2022-06-10 22:20:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:20:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:20:41] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/31 places, 87/90 transitions.
Finished structural reductions, in 2 iterations. Remains : 29/31 places, 87/90 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 66 steps, including 5 resets, run visited all 1 properties in 1 ms. (steps per millisecond=66 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-15 finished in 2464 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !X(X((G(X(F(p1))) U (F(p2)&&p2))))))'
[2022-06-10 22:20:41] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9274154573646326004
[2022-06-10 22:20:42] [INFO ] Computing symmetric may disable matrix : 271 transitions.
[2022-06-10 22:20:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:20:42] [INFO ] Computing symmetric may enable matrix : 271 transitions.
[2022-06-10 22:20:42] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:20:42] [INFO ] Applying decomposition
[2022-06-10 22:20:42] [INFO ] Computing Do-Not-Accords matrix : 271 transitions.
[2022-06-10 22:20:42] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:20:42] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9274154573646326004
Running compilation step : cd /tmp/ltsmin9274154573646326004;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-10 22:20:42] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5178818364908086636.txt' '-o' '/tmp/graph5178818364908086636.bin' '-w' '/tmp/graph5178818364908086636.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5178818364908086636.bin' '-l' '-1' '-v' '-w' '/tmp/graph5178818364908086636.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:20:42] [INFO ] Decomposing Gal with order
[2022-06-10 22:20:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:20:42] [INFO ] Removed a total of 243 redundant transitions.
[2022-06-10 22:20:42] [INFO ] Flatten gal took : 111 ms
[2022-06-10 22:20:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 9 ms.
[2022-06-10 22:20:42] [INFO ] Time to serialize gal into /tmp/LTLFireability13147865061533530655.gal : 26 ms
[2022-06-10 22:20:42] [INFO ] Time to serialize properties into /tmp/LTLFireability14536362889276884457.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13147865061533530655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14536362889276884457.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !(((F("(i0.u4.p18==1)"))U(!(X(X((G(X(F("(((i4.u2.p6==1)&&(i4.u2.p15==1))&&((i9.i0.u36.p107==1)&&(i4.u2.p178==1)))"))))U((F("(i12.i1.u5...201
Formula 0 simplified : !(F"(i0.u4.p18==1)" U !XX(GXF"(((i4.u2.p6==1)&&(i4.u2.p15==1))&&((i9.i0.u36.p107==1)&&(i4.u2.p178==1)))" U ("(i12.i1.u57.p167==1)" &...182
Reverse transition relation is NOT exact ! Due to transitions t175, t184, t196, t212, t240, t268, i0.u58.t34, i0.u58.t37, i0.u58.t38, i0.u58.t39, i2.i1.t16...644
Computing Next relation with stutter on 3616 deadlock states
Compilation finished in 1157 ms.
Running link step : cd /tmp/ltsmin9274154573646326004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9274154573646326004;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true)) U !X(X(([](X(<>((LTLAPp1==true)))) U (<>((LTLAPp2==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
75503 unique states visited
0 strongly connected components in search stack
113539 transitions explored
271 items max in DFS search stack
19894 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,199.003,3202940,1,0,5.71913e+06,3277,3127,9.1639e+06,396,30173,14462713
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutonomousCar-PT-04b-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 616723 ms.

BK_STOP 1654900145103

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463873000468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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