Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 75K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678351471046

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:44:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:44:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:44:33] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-09 08:44:33] [INFO ] Transformed 190 places.
[2023-03-09 08:44:33] [INFO ] Transformed 273 transitions.
[2023-03-09 08:44:33] [INFO ] Found NUPN structural information;
[2023-03-09 08:44:33] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-03b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 166 transition count 249
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 166 transition count 249
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 84 place count 166 transition count 213
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 161 transition count 208
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 161 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 160 transition count 207
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 160 transition count 207
Applied a total of 96 rules in 53 ms. Remains 160 /190 variables (removed 30) and now considering 207/273 (removed 66) transitions.
// Phase 1: matrix 207 rows 160 cols
[2023-03-09 08:44:33] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-09 08:44:33] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-09 08:44:33] [INFO ] Invariant cache hit.
[2023-03-09 08:44:34] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-09 08:44:34] [INFO ] Invariant cache hit.
[2023-03-09 08:44:34] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 160/190 places, 207/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 928 ms. Remains : 160/190 places, 207/273 transitions.
Support contains 36 out of 160 places after structural reductions.
[2023-03-09 08:44:34] [INFO ] Flatten gal took : 40 ms
[2023-03-09 08:44:34] [INFO ] Flatten gal took : 19 ms
[2023-03-09 08:44:34] [INFO ] Input system was already deterministic with 207 transitions.
Support contains 34 out of 160 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 34) seen :28
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-09 08:44:35] [INFO ] Invariant cache hit.
[2023-03-09 08:44:35] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-09 08:44:35] [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.
FORMULA AutonomousCar-PT-03b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-03b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 36 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G((G(p2)||p1))))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Graph (trivial) has 147 edges and 160 vertex of which 4 / 160 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 157 transition count 140
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 85 rules applied. Total rules applied 150 place count 93 transition count 119
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 162 place count 81 transition count 119
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 162 place count 81 transition count 113
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 174 place count 75 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 178 place count 71 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 182 place count 71 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 70 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 70 transition count 106
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 186 place count 70 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 69 transition count 104
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 243 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 41 transition count 74
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 248 place count 37 transition count 60
Iterating global reduction 6 with 4 rules applied. Total rules applied 252 place count 37 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 254 place count 37 transition count 58
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 256 place count 36 transition count 57
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 262 place count 33 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 264 place count 31 transition count 73
Applied a total of 264 rules in 88 ms. Remains 31 /160 variables (removed 129) and now considering 73/207 (removed 134) transitions.
// Phase 1: matrix 73 rows 31 cols
[2023-03-09 08:44:35] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-09 08:44:36] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-09 08:44:36] [INFO ] Invariant cache hit.
[2023-03-09 08:44:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:44:36] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [24, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 227 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/160 places, 73/207 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 28 transition count 72
Applied a total of 2 rules in 3 ms. Remains 28 /29 variables (removed 1) and now considering 72/73 (removed 1) transitions.
// Phase 1: matrix 72 rows 28 cols
[2023-03-09 08:44:36] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:36] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-09 08:44:36] [INFO ] Invariant cache hit.
[2023-03-09 08:44:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:44:36] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/160 places, 72/207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 789 ms. Remains : 28/160 places, 72/207 transitions.
Stuttering acceptance computed with spot in 512 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p2:(OR (EQ s1 0) (EQ s3 0) (EQ s22 0) (EQ s26 0)), p0:(AND (EQ s1 1) (EQ s3 1) (EQ s22 1) (EQ s26 1)), p1:(OR (EQ s1 0) (EQ s4 0) (EQ s15 0) (EQ s22 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-00 finished in 1473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&G((!p1||G(p2))))))))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 155 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 154 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 154 transition count 201
Applied a total of 12 rules in 27 ms. Remains 154 /160 variables (removed 6) and now considering 201/207 (removed 6) transitions.
// Phase 1: matrix 201 rows 154 cols
[2023-03-09 08:44:37] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-09 08:44:37] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-09 08:44:37] [INFO ] Invariant cache hit.
[2023-03-09 08:44:37] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-09 08:44:37] [INFO ] Invariant cache hit.
[2023-03-09 08:44:37] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/160 places, 201/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 562 ms. Remains : 154/160 places, 201/207 transitions.
Stuttering acceptance computed with spot in 350 ms :[true, p0, p0, (AND p0 (NOT p2)), (NOT p2), (AND p0 p1 (NOT p2)), (AND (NOT p2) p1)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p1 p2), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s4 1) (EQ s6 1) (EQ s64 1) (EQ s120 1)), p1:(AND (EQ s4 1) (EQ s6 1) (EQ s55 1) (EQ s120 1)), p2:(NEQ s109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18 reset in 322 ms.
Product exploration explored 100000 steps with 4 reset in 181 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1185 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter sensitive) to 7 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 434 ms :[true, p0, p0, (NOT p2), (AND p0 (NOT p2)), (AND (NOT p2) p1), (AND p0 p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-09 08:44:41] [INFO ] Invariant cache hit.
[2023-03-09 08:44:41] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:44:41] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:1
[2023-03-09 08:44:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:44:41] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND (NOT p2) p0))), (G (NOT (AND p1 (NOT p2) (NOT p0)))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (AND p1 p2)), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p2 p0)), (F (AND (NOT p1) p0)), (F p0), (F (AND p1 p2 (NOT p0)))]
Knowledge based reduction with 20 factoid took 1468 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 201/201 transitions.
Applied a total of 0 rules in 7 ms. Remains 154 /154 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-09 08:44:43] [INFO ] Invariant cache hit.
[2023-03-09 08:44:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-09 08:44:43] [INFO ] Invariant cache hit.
[2023-03-09 08:44:43] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-09 08:44:43] [INFO ] Invariant cache hit.
[2023-03-09 08:44:44] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 154/154 places, 201/201 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 p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 287 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 414 ms :[(OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false, false, false, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-09 08:44:45] [INFO ] Invariant cache hit.
[2023-03-09 08:44:45] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:44:45] [INFO ] After 33ms 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 p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 469 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[true, (NOT p2), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 460 ms :[true, (NOT p2), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 397 ms :[true, (NOT p2), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 30 reset in 188 ms.
Product exploration explored 100000 steps with 10 reset in 195 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 438 ms :[true, (NOT p2), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND p0 (NOT p2)), (AND p1 (NOT p2))]
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 201/201 transitions.
Graph (trivial) has 139 edges and 154 vertex of which 4 / 154 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 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 152 transition count 199
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 64 place count 152 transition count 191
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 64 place count 152 transition count 191
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 152 transition count 191
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 121 place count 107 transition count 146
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 166 place count 107 transition count 146
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 204 place count 107 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 107 transition count 149
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 237 place count 76 transition count 105
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 3 with 31 rules applied. Total rules applied 268 place count 76 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 272 place count 76 transition count 101
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 275 place count 73 transition count 98
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 278 place count 73 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 279 place count 73 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 281 place count 71 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 71 transition count 96
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 286 place count 71 transition count 122
Deduced a syphon composed of 35 places in 0 ms
Applied a total of 286 rules in 46 ms. Remains 71 /154 variables (removed 83) and now considering 122/201 (removed 79) transitions.
[2023-03-09 08:44:47] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 122 rows 71 cols
[2023-03-09 08:44:47] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-09 08:44:48] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/154 places, 122/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 71/154 places, 122/201 transitions.
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 154 cols
[2023-03-09 08:44:48] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-09 08:44:48] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-09 08:44:48] [INFO ] Invariant cache hit.
[2023-03-09 08:44:48] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-09 08:44:48] [INFO ] Invariant cache hit.
[2023-03-09 08:44:48] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 154/154 places, 201/201 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-01 finished in 11284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Graph (trivial) has 148 edges and 160 vertex of which 4 / 160 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 157 transition count 141
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 84 rules applied. Total rules applied 148 place count 94 transition count 120
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 160 place count 82 transition count 120
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 160 place count 82 transition count 113
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 174 place count 75 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 178 place count 71 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 182 place count 71 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 70 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 70 transition count 106
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 186 place count 70 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 69 transition count 104
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 241 place count 42 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 42 transition count 75
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 247 place count 37 transition count 59
Iterating global reduction 6 with 5 rules applied. Total rules applied 252 place count 37 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 253 place count 37 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 257 place count 35 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 261 place count 33 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 262 place count 32 transition count 73
Applied a total of 262 rules in 18 ms. Remains 32 /160 variables (removed 128) and now considering 73/207 (removed 134) transitions.
// Phase 1: matrix 73 rows 32 cols
[2023-03-09 08:44:48] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-09 08:44:48] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 08:44:48] [INFO ] Invariant cache hit.
[2023-03-09 08:44:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:44:48] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [27, 31]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 77 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/160 places, 73/207 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 72
Applied a total of 2 rules in 3 ms. Remains 29 /30 variables (removed 1) and now considering 72/73 (removed 1) transitions.
// Phase 1: matrix 72 rows 29 cols
[2023-03-09 08:44:48] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:44:48] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 08:44:48] [INFO ] Invariant cache hit.
[2023-03-09 08:44:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:44:48] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/160 places, 72/207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 29/160 places, 72/207 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s3 0) (EQ s13 0) (EQ s25 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15 reset in 134 ms.
Product exploration explored 100000 steps with 2 reset in 83 ms.
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 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 104 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=52 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 72/72 transitions.
Applied a total of 0 rules in 6 ms. Remains 29 /29 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-09 08:44:49] [INFO ] Invariant cache hit.
[2023-03-09 08:44:49] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-09 08:44:49] [INFO ] Invariant cache hit.
[2023-03-09 08:44:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:44:49] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-09 08:44:49] [INFO ] Redundant transitions in 23 ms returned [18]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 71 rows 29 cols
[2023-03-09 08:44:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:49] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/29 places, 71/72 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 27 transition count 69
Applied a total of 2 rules in 8 ms. Remains 27 /29 variables (removed 2) and now considering 69/71 (removed 2) transitions.
// Phase 1: matrix 69 rows 27 cols
[2023-03-09 08:44:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-09 08:44:49] [INFO ] Invariant cache hit.
[2023-03-09 08:44:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:44:50] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/29 places, 69/72 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 554 ms. Remains : 27/29 places, 69/72 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5 reset in 132 ms.
Product exploration explored 100000 steps with 5 reset in 143 ms.
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 69/69 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-09 08:44:50] [INFO ] Invariant cache hit.
[2023-03-09 08:44:51] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-09 08:44:51] [INFO ] Invariant cache hit.
[2023-03-09 08:44:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:44:51] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-09 08:44:51] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-09 08:44:51] [INFO ] Invariant cache hit.
[2023-03-09 08:44:51] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 407 ms. Remains : 27/27 places, 69/69 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-03 finished in 2842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&(!p1||(p2&&F(!p1))))))))'
Support contains 9 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 155 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 154 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 154 transition count 201
Applied a total of 12 rules in 6 ms. Remains 154 /160 variables (removed 6) and now considering 201/207 (removed 6) transitions.
// Phase 1: matrix 201 rows 154 cols
[2023-03-09 08:44:51] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-09 08:44:51] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-09 08:44:51] [INFO ] Invariant cache hit.
[2023-03-09 08:44:51] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-09 08:44:51] [INFO ] Invariant cache hit.
[2023-03-09 08:44:51] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/160 places, 201/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 154/160 places, 201/207 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, p1, p0, p0, (AND p1 p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s49 1) (EQ s69 1) (EQ s99 1) (EQ s121 1)), p0:(AND (EQ s4 1) (EQ s6 1) (EQ s39 1) (EQ s120 1)), p2:(NEQ s48 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 378 ms.
Product exploration explored 100000 steps with 50000 reset in 162 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 p1) (NOT p0) p2), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 10 factoid took 405 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-03b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03b-LTLFireability-04 finished in 1644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 155 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 154 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 154 transition count 201
Applied a total of 12 rules in 8 ms. Remains 154 /160 variables (removed 6) and now considering 201/207 (removed 6) transitions.
[2023-03-09 08:44:52] [INFO ] Invariant cache hit.
[2023-03-09 08:44:53] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-09 08:44:53] [INFO ] Invariant cache hit.
[2023-03-09 08:44:53] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-09 08:44:53] [INFO ] Invariant cache hit.
[2023-03-09 08:44:53] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/160 places, 201/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 154/160 places, 201/207 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s4 1) (EQ s11 1) (EQ s70 1) (EQ s120 1)), p0:(OR (EQ s4 0) (EQ s12 0) (EQ s55 0) (EQ s120 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 138 ms.
Product exploration explored 100000 steps with 2 reset in 129 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 p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2614927 steps, run timeout after 3001 ms. (steps per millisecond=871 ) properties seen :{}
Probabilistic random walk after 2614927 steps, saw 401888 distinct states, run finished after 3003 ms. (steps per millisecond=870 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:44:57] [INFO ] Invariant cache hit.
[2023-03-09 08:44:57] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:44:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:44:57] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:44:57] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 4 ms to minimize.
[2023-03-09 08:44:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-09 08:44:57] [INFO ] After 354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 08:44:57] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 201/201 transitions.
Graph (trivial) has 143 edges and 154 vertex of which 4 / 154 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 381 edges and 152 vertex of which 150 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 150 transition count 137
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 82 rules applied. Total rules applied 144 place count 92 transition count 113
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 158 place count 78 transition count 113
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 158 place count 78 transition count 107
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 170 place count 72 transition count 107
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 236 place count 39 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 237 place count 39 transition count 73
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 243 place count 33 transition count 54
Iterating global reduction 4 with 6 rules applied. Total rules applied 249 place count 33 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 251 place count 33 transition count 52
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 5 with 2 rules applied. Total rules applied 253 place count 32 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 257 place count 30 transition count 69
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 30 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 261 place count 28 transition count 67
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 28 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 263 place count 27 transition count 66
Applied a total of 263 rules in 29 ms. Remains 27 /154 variables (removed 127) and now considering 66/201 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 27/154 places, 66/201 transitions.
Finished random walk after 401 steps, including 26 resets, run visited all 1 properties in 2 ms. (steps per millisecond=200 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 4 out of 154 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 201/201 transitions.
Graph (trivial) has 141 edges and 154 vertex of which 4 / 154 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 151 transition count 142
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 78 rules applied. Total rules applied 135 place count 95 transition count 120
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 148 place count 82 transition count 120
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 148 place count 82 transition count 114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 160 place count 76 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 75 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 75 transition count 113
Performed 32 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 226 place count 43 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 43 transition count 79
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 232 place count 38 transition count 64
Iterating global reduction 4 with 5 rules applied. Total rules applied 237 place count 38 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 239 place count 38 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 243 place count 36 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 247 place count 34 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 249 place count 32 transition count 76
Applied a total of 249 rules in 56 ms. Remains 32 /154 variables (removed 122) and now considering 76/201 (removed 125) transitions.
// Phase 1: matrix 76 rows 32 cols
[2023-03-09 08:44:57] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-09 08:44:57] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-09 08:44:57] [INFO ] Invariant cache hit.
[2023-03-09 08:44:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:44:58] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [27, 31]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 207 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/154 places, 76/201 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 75
Applied a total of 2 rules in 1 ms. Remains 29 /30 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 29 cols
[2023-03-09 08:44:58] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:44:58] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 08:44:58] [INFO ] Invariant cache hit.
[2023-03-09 08:44:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:44:58] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/154 places, 75/201 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 396 ms. Remains : 29/154 places, 75/201 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 79 steps, including 5 resets, run visited all 1 properties in 1 ms. (steps per millisecond=79 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8 reset in 81 ms.
Product exploration explored 100000 steps with 4 reset in 84 ms.
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 75/75 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 29 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 28 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 27 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 27 transition count 70
Applied a total of 4 rules in 4 ms. Remains 27 /29 variables (removed 2) and now considering 70/75 (removed 5) transitions.
// Phase 1: matrix 70 rows 27 cols
[2023-03-09 08:44:58] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 08:44:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-09 08:44:59] [INFO ] Invariant cache hit.
[2023-03-09 08:44:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:44:59] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-09 08:44:59] [INFO ] Redundant transitions in 17 ms returned [16]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 69 rows 27 cols
[2023-03-09 08:44:59] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:44:59] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/29 places, 69/75 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 25 transition count 67
Applied a total of 2 rules in 3 ms. Remains 25 /27 variables (removed 2) and now considering 67/69 (removed 2) transitions.
// Phase 1: matrix 67 rows 25 cols
[2023-03-09 08:44:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:44:59] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-09 08:44:59] [INFO ] Invariant cache hit.
[2023-03-09 08:44:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:44:59] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/29 places, 67/75 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 511 ms. Remains : 25/29 places, 67/75 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-05 finished in 6558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 155 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 154 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 154 transition count 201
Applied a total of 12 rules in 12 ms. Remains 154 /160 variables (removed 6) and now considering 201/207 (removed 6) transitions.
// Phase 1: matrix 201 rows 154 cols
[2023-03-09 08:44:59] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-09 08:44:59] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-09 08:44:59] [INFO ] Invariant cache hit.
[2023-03-09 08:44:59] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-09 08:44:59] [INFO ] Invariant cache hit.
[2023-03-09 08:44:59] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/160 places, 201/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 154/160 places, 201/207 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s151 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 29 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-07 finished in 492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Graph (trivial) has 149 edges and 160 vertex of which 4 / 160 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 157 transition count 141
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 83 rules applied. Total rules applied 147 place count 94 transition count 121
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 158 place count 83 transition count 121
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 158 place count 83 transition count 114
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 172 place count 76 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 176 place count 72 transition count 110
Iterating global reduction 3 with 4 rules applied. Total rules applied 180 place count 72 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 71 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 71 transition count 107
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 242 place count 41 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 243 place count 41 transition count 75
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 249 place count 35 transition count 56
Iterating global reduction 4 with 6 rules applied. Total rules applied 255 place count 35 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 257 place count 35 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 261 place count 33 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 265 place count 31 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 29 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 268 place count 28 transition count 68
Applied a total of 268 rules in 39 ms. Remains 28 /160 variables (removed 132) and now considering 68/207 (removed 139) transitions.
// Phase 1: matrix 68 rows 28 cols
[2023-03-09 08:45:00] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:45:00] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-09 08:45:00] [INFO ] Invariant cache hit.
[2023-03-09 08:45:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:45:00] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [23, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 456 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/160 places, 68/207 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 67
Applied a total of 2 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 67/68 (removed 1) transitions.
// Phase 1: matrix 67 rows 25 cols
[2023-03-09 08:45:00] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 08:45:00] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 08:45:00] [INFO ] Invariant cache hit.
[2023-03-09 08:45:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:00] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/160 places, 67/207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 693 ms. Remains : 25/160 places, 67/207 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s14 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 3 reset in 86 ms.
Product exploration explored 100000 steps with 2 reset in 59 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 17 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2023-03-09 08:45:01] [INFO ] Invariant cache hit.
[2023-03-09 08:45:01] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-09 08:45:01] [INFO ] Invariant cache hit.
[2023-03-09 08:45:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:01] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-09 08:45:01] [INFO ] Redundant transitions in 27 ms returned [16]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 66 rows 25 cols
[2023-03-09 08:45:01] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 08:45:01] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/25 places, 66/67 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 23 transition count 64
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 23 cols
[2023-03-09 08:45:01] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:45:01] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-09 08:45:01] [INFO ] Invariant cache hit.
[2023-03-09 08:45:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:01] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/25 places, 64/67 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 360 ms. Remains : 23/25 places, 64/67 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 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Finished random walk after 23 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 35 ms.
Product exploration explored 100000 steps with 3 reset in 37 ms.
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-09 08:45:02] [INFO ] Invariant cache hit.
[2023-03-09 08:45:02] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-09 08:45:02] [INFO ] Invariant cache hit.
[2023-03-09 08:45:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:02] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-09 08:45:02] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-09 08:45:02] [INFO ] Invariant cache hit.
[2023-03-09 08:45:03] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 213 ms. Remains : 23/23 places, 64/64 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-08 finished in 3056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(p1)||G(p2))))))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 157 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 157 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 156 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 156 transition count 203
Applied a total of 8 rules in 5 ms. Remains 156 /160 variables (removed 4) and now considering 203/207 (removed 4) transitions.
// Phase 1: matrix 203 rows 156 cols
[2023-03-09 08:45:03] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-09 08:45:03] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-09 08:45:03] [INFO ] Invariant cache hit.
[2023-03-09 08:45:03] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-09 08:45:03] [INFO ] Invariant cache hit.
[2023-03-09 08:45:03] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/160 places, 203/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 156/160 places, 203/207 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s129 1), p1:(EQ s88 0), p2:(OR (EQ s4 0) (EQ s12 0) (EQ s43 0) (EQ s121 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 119 ms.
Product exploration explored 100000 steps with 8 reset in 95 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 399 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:45:04] [INFO ] Invariant cache hit.
[2023-03-09 08:45:04] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:45:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 08:45:04] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:45:04] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 08:45:04] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 203/203 transitions.
Graph (trivial) has 143 edges and 156 vertex of which 4 / 156 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 383 edges and 154 vertex of which 152 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 152 transition count 137
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 81 rules applied. Total rules applied 145 place count 92 transition count 116
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 157 place count 80 transition count 116
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 157 place count 80 transition count 109
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 171 place count 73 transition count 109
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 237 place count 40 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 40 transition count 75
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 244 place count 34 transition count 57
Iterating global reduction 4 with 6 rules applied. Total rules applied 250 place count 34 transition count 57
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 253 place count 34 transition count 54
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 5 with 2 rules applied. Total rules applied 255 place count 33 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 259 place count 31 transition count 71
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 260 place count 31 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 261 place count 30 transition count 70
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 30 transition count 69
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 263 place count 30 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 264 place count 29 transition count 68
Applied a total of 264 rules in 19 ms. Remains 29 /156 variables (removed 127) and now considering 68/203 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 29/156 places, 68/203 transitions.
Finished random walk after 2058 steps, including 136 resets, run visited all 1 properties in 5 ms. (steps per millisecond=411 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 6 factoid took 344 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p2))]
Support contains 5 out of 156 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 203/203 transitions.
Graph (trivial) has 141 edges and 156 vertex of which 4 / 156 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 153 transition count 142
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 76 rules applied. Total rules applied 135 place count 95 transition count 124
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 146 place count 84 transition count 124
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 146 place count 84 transition count 118
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 158 place count 78 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 77 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 77 transition count 117
Performed 32 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 224 place count 45 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 225 place count 45 transition count 83
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 231 place count 39 transition count 65
Iterating global reduction 4 with 6 rules applied. Total rules applied 237 place count 39 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 240 place count 39 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 244 place count 37 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 248 place count 35 transition count 78
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 35 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 251 place count 33 transition count 76
Applied a total of 251 rules in 37 ms. Remains 33 /156 variables (removed 123) and now considering 76/203 (removed 127) transitions.
// Phase 1: matrix 76 rows 33 cols
[2023-03-09 08:45:05] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-09 08:45:05] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-09 08:45:05] [INFO ] Invariant cache hit.
[2023-03-09 08:45:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:45:05] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [27, 32]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 235 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/156 places, 76/203 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 30 transition count 75
Applied a total of 2 rules in 2 ms. Remains 30 /31 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 30 cols
[2023-03-09 08:45:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:45:05] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-09 08:45:05] [INFO ] Invariant cache hit.
[2023-03-09 08:45:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:05] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/156 places, 75/203 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 447 ms. Remains : 30/156 places, 75/203 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 462 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p2))]
Finished random walk after 1667 steps, including 130 resets, run visited all 4 properties in 9 ms. (steps per millisecond=185 )
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 433 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 39 reset in 95 ms.
Product exploration explored 100000 steps with 7 reset in 65 ms.
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 75/75 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 29 transition count 74
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 2 with 2 rules applied. Total rules applied 4 place count 28 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 28 transition count 72
Applied a total of 5 rules in 3 ms. Remains 28 /30 variables (removed 2) and now considering 72/75 (removed 3) transitions.
// Phase 1: matrix 72 rows 28 cols
[2023-03-09 08:45:06] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:45:06] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-09 08:45:06] [INFO ] Invariant cache hit.
[2023-03-09 08:45:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:06] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-09 08:45:07] [INFO ] Redundant transitions in 20 ms returned [18]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 71 rows 28 cols
[2023-03-09 08:45:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:45:07] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 71/75 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 26 transition count 69
Applied a total of 2 rules in 3 ms. Remains 26 /28 variables (removed 2) and now considering 69/71 (removed 2) transitions.
// Phase 1: matrix 69 rows 26 cols
[2023-03-09 08:45:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:45:07] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-09 08:45:07] [INFO ] Invariant cache hit.
[2023-03-09 08:45:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:07] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/30 places, 69/75 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 586 ms. Remains : 26/30 places, 69/75 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-09 finished in 4370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((p1||X(F(p2)))))))'
Support contains 7 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 156 transition count 203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 156 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 155 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 155 transition count 202
Applied a total of 10 rules in 3 ms. Remains 155 /160 variables (removed 5) and now considering 202/207 (removed 5) transitions.
// Phase 1: matrix 202 rows 155 cols
[2023-03-09 08:45:07] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-09 08:45:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-09 08:45:07] [INFO ] Invariant cache hit.
[2023-03-09 08:45:07] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-09 08:45:07] [INFO ] Invariant cache hit.
[2023-03-09 08:45:07] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/160 places, 202/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 373 ms. Remains : 155/160 places, 202/207 transitions.
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s11 1) (EQ s90 1) (EQ s121 1)), p1:(AND (EQ s4 1) (EQ s12 1) (EQ s70 1) (EQ s121 1)), p2:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-11 finished in 702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U X(G(p1)))&&X(p2)) U X(p0)))'
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 155 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 154 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 154 transition count 201
Applied a total of 12 rules in 7 ms. Remains 154 /160 variables (removed 6) and now considering 201/207 (removed 6) transitions.
// Phase 1: matrix 201 rows 154 cols
[2023-03-09 08:45:08] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-09 08:45:08] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-09 08:45:08] [INFO ] Invariant cache hit.
[2023-03-09 08:45:08] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-09 08:45:08] [INFO ] Invariant cache hit.
[2023-03-09 08:45:08] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/160 places, 201/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 438 ms. Remains : 154/160 places, 201/207 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}]], initial=3, aps=[p1:(EQ s93 1), p0:(EQ s98 1), p2:(NEQ s147 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-12 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1 U p2))))'
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 157 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 157 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 156 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 156 transition count 203
Applied a total of 8 rules in 7 ms. Remains 156 /160 variables (removed 4) and now considering 203/207 (removed 4) transitions.
// Phase 1: matrix 203 rows 156 cols
[2023-03-09 08:45:08] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-09 08:45:09] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 08:45:09] [INFO ] Invariant cache hit.
[2023-03-09 08:45:09] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-09 08:45:09] [INFO ] Invariant cache hit.
[2023-03-09 08:45:09] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/160 places, 203/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 156/160 places, 203/207 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s93 1), p1:(EQ s100 1), p0:(AND (EQ s89 0) (EQ s100 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-13 finished in 731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Graph (trivial) has 149 edges and 160 vertex of which 4 / 160 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 157 transition count 142
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 83 rules applied. Total rules applied 146 place count 95 transition count 121
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 158 place count 83 transition count 121
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 158 place count 83 transition count 113
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 174 place count 75 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 177 place count 72 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 180 place count 72 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 71 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 71 transition count 107
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 184 place count 71 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 185 place count 70 transition count 105
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 243 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 41 transition count 74
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 250 place count 35 transition count 55
Iterating global reduction 6 with 6 rules applied. Total rules applied 256 place count 35 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 258 place count 35 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 262 place count 33 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 266 place count 31 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 268 place count 29 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 269 place count 28 transition count 67
Applied a total of 269 rules in 29 ms. Remains 28 /160 variables (removed 132) and now considering 67/207 (removed 140) transitions.
// Phase 1: matrix 67 rows 28 cols
[2023-03-09 08:45:09] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:45:09] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-09 08:45:09] [INFO ] Invariant cache hit.
[2023-03-09 08:45:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:45:09] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [23, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 166 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/160 places, 67/207 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 66
Applied a total of 2 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 66/67 (removed 1) transitions.
// Phase 1: matrix 66 rows 25 cols
[2023-03-09 08:45:09] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-09 08:45:09] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-09 08:45:09] [INFO ] Invariant cache hit.
[2023-03-09 08:45:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:09] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/160 places, 66/207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 290 ms. Remains : 25/160 places, 66/207 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s18 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 49 ms.
Product exploration explored 100000 steps with 27 reset in 39 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Detected a total of 3/25 stabilizing places and 6/66 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2023-03-09 08:45:10] [INFO ] Invariant cache hit.
[2023-03-09 08:45:11] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-09 08:45:11] [INFO ] Invariant cache hit.
[2023-03-09 08:45:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:11] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-09 08:45:11] [INFO ] Redundant transitions in 20 ms returned [15]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 65 rows 25 cols
[2023-03-09 08:45:11] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 08:45:11] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/25 places, 65/66 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 23 transition count 63
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 63/65 (removed 2) transitions.
// Phase 1: matrix 63 rows 23 cols
[2023-03-09 08:45:11] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:45:11] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-09 08:45:11] [INFO ] Invariant cache hit.
[2023-03-09 08:45:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:11] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/25 places, 63/66 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 691 ms. Remains : 23/25 places, 63/66 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/23 stabilizing places and 5/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18 reset in 89 ms.
Product exploration explored 100000 steps with 4 reset in 74 ms.
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-09 08:45:12] [INFO ] Invariant cache hit.
[2023-03-09 08:45:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-09 08:45:12] [INFO ] Invariant cache hit.
[2023-03-09 08:45:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:12] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-09 08:45:12] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-09 08:45:12] [INFO ] Invariant cache hit.
[2023-03-09 08:45:12] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 ms. Remains : 23/23 places, 63/63 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-14 finished in 3379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((G(p0) U p1)))||G((F(p0)&&p2))))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Graph (trivial) has 144 edges and 160 vertex of which 4 / 160 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 157 transition count 143
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 80 rules applied. Total rules applied 142 place count 96 transition count 124
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 155 place count 85 transition count 122
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 159 place count 83 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 82 transition count 120
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 160 place count 82 transition count 115
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 170 place count 77 transition count 115
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 174 place count 73 transition count 111
Iterating global reduction 5 with 4 rules applied. Total rules applied 178 place count 73 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 179 place count 72 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 72 transition count 108
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 5 with 2 rules applied. Total rules applied 182 place count 72 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 183 place count 71 transition count 106
Performed 30 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 243 place count 41 transition count 74
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 248 place count 36 transition count 58
Iterating global reduction 7 with 5 rules applied. Total rules applied 253 place count 36 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 254 place count 36 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 256 place count 35 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 260 place count 33 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 262 place count 31 transition count 72
Applied a total of 262 rules in 20 ms. Remains 31 /160 variables (removed 129) and now considering 72/207 (removed 135) transitions.
// Phase 1: matrix 72 rows 31 cols
[2023-03-09 08:45:13] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-09 08:45:13] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-09 08:45:13] [INFO ] Invariant cache hit.
[2023-03-09 08:45:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:45:13] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [26, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 212 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/160 places, 72/207 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 28 transition count 71
Applied a total of 2 rules in 2 ms. Remains 28 /29 variables (removed 1) and now considering 71/72 (removed 1) transitions.
// Phase 1: matrix 71 rows 28 cols
[2023-03-09 08:45:13] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 08:45:13] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-09 08:45:13] [INFO ] Invariant cache hit.
[2023-03-09 08:45:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:13] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/160 places, 71/207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 409 ms. Remains : 28/160 places, 71/207 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(OR p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s5 1) (EQ s10 1) (EQ s24 1)), p0:(EQ s23 1), p1:(EQ s15 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-15 finished in 648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&G((!p1||G(p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Found a Lengthening insensitive property : AutonomousCar-PT-03b-LTLFireability-05
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 160/160 places, 207/207 transitions.
Graph (trivial) has 147 edges and 160 vertex of which 4 / 160 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 157 transition count 142
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 83 rules applied. Total rules applied 146 place count 95 transition count 121
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 158 place count 83 transition count 121
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 158 place count 83 transition count 115
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 170 place count 77 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 174 place count 73 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 178 place count 73 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 72 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 72 transition count 108
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 182 place count 72 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 183 place count 71 transition count 106
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 241 place count 42 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 42 transition count 75
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 246 place count 38 transition count 63
Iterating global reduction 6 with 4 rules applied. Total rules applied 250 place count 38 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 251 place count 38 transition count 62
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 255 place count 36 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 259 place count 34 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 261 place count 32 transition count 76
Applied a total of 261 rules in 27 ms. Remains 32 /160 variables (removed 128) and now considering 76/207 (removed 131) transitions.
// Phase 1: matrix 76 rows 32 cols
[2023-03-09 08:45:14] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-09 08:45:14] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-09 08:45:14] [INFO ] Invariant cache hit.
[2023-03-09 08:45:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:45:14] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [27, 31]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 187 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 30/160 places, 76/207 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 75
Applied a total of 2 rules in 2 ms. Remains 29 /30 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 29 cols
[2023-03-09 08:45:14] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:45:14] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-09 08:45:14] [INFO ] Invariant cache hit.
[2023-03-09 08:45:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:14] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 29/160 places, 75/207 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 362 ms. Remains : 29/160 places, 75/207 transitions.
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s1 1) (EQ s4 1) (EQ s15 1) (EQ s25 1)), p0:(OR (EQ s1 0) (EQ s5 0) (EQ s10 0) (EQ s25 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 77 ms.
Product exploration explored 100000 steps with 0 reset in 48 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 162 steps, including 11 resets, run visited all 1 properties in 1 ms. (steps per millisecond=162 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Support contains 4 out of 29 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-09 08:45:15] [INFO ] Invariant cache hit.
[2023-03-09 08:45:15] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-09 08:45:15] [INFO ] Invariant cache hit.
[2023-03-09 08:45:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:15] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-09 08:45:15] [INFO ] Redundant transitions in 14 ms returned [18]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 74 rows 29 cols
[2023-03-09 08:45:15] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:45:15] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/29 places, 74/75 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 27 transition count 72
Applied a total of 2 rules in 15 ms. Remains 27 /29 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 27 cols
[2023-03-09 08:45:15] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:45:15] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 08:45:15] [INFO ] Invariant cache hit.
[2023-03-09 08:45:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:15] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/29 places, 72/75 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 509 ms. Remains : 27/29 places, 72/75 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 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Finished random walk after 31 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6 reset in 103 ms.
Product exploration explored 100000 steps with 33 reset in 92 ms.
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 72/72 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 26 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 25 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 25 transition count 67
Applied a total of 4 rules in 5 ms. Remains 25 /27 variables (removed 2) and now considering 67/72 (removed 5) transitions.
// Phase 1: matrix 67 rows 25 cols
[2023-03-09 08:45:16] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:45:16] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-09 08:45:16] [INFO ] Invariant cache hit.
[2023-03-09 08:45:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:45:16] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2023-03-09 08:45:16] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-09 08:45:16] [INFO ] Invariant cache hit.
[2023-03-09 08:45:17] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/27 places, 67/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 575 ms. Remains : 25/27 places, 67/72 transitions.
Treatment of property AutonomousCar-PT-03b-LTLFireability-05 finished in 3148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(p1)||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-09 08:45:17] [INFO ] Flatten gal took : 42 ms
[2023-03-09 08:45:17] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-09 08:45:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 160 places, 207 transitions and 703 arcs took 3 ms.
Total runtime 44113 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-03b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
LTLFireability

FORMULA AutonomousCar-PT-03b-LTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-03b-LTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-03b-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-03b-LTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678351617854

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/380/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/380/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/380/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 10 (type EXCL) for 9 AutonomousCar-PT-03b-LTLFireability-08
lola: time limit : 600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for AutonomousCar-PT-03b-LTLFireability-08
lola: result : false
lola: markings : 2814
lola: fired transitions : 6169
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 12 AutonomousCar-PT-03b-LTLFireability-09
lola: time limit : 720 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 5/720 6/32 AutonomousCar-PT-03b-LTLFireability-09 707418 m, 141483 m/sec, 3827355 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 6
lola: FINISHED task # 13 (type EXCL) for AutonomousCar-PT-03b-LTLFireability-09
lola: result : false
lola: markings : 967283
lola: fired transitions : 5237722
lola: time used : 7.000000
lola: memory pages used : 7
lola: LAUNCH task # 7 (type EXCL) for 6 AutonomousCar-PT-03b-LTLFireability-05
lola: time limit : 898 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 3/898 4/32 AutonomousCar-PT-03b-LTLFireability-05 449530 m, 89906 m/sec, 2421271 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 8/898 9/32 AutonomousCar-PT-03b-LTLFireability-05 1142636 m, 138621 m/sec, 6295104 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 13/898 13/32 AutonomousCar-PT-03b-LTLFireability-05 1783067 m, 128086 m/sec, 10155535 t fired, .

Time elapsed: 20 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 18/898 16/32 AutonomousCar-PT-03b-LTLFireability-05 2318596 m, 107105 m/sec, 13525777 t fired, .

Time elapsed: 25 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 23/898 21/32 AutonomousCar-PT-03b-LTLFireability-05 2958837 m, 128048 m/sec, 17078204 t fired, .

Time elapsed: 30 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 28/898 24/32 AutonomousCar-PT-03b-LTLFireability-05 3505879 m, 109408 m/sec, 20489153 t fired, .

Time elapsed: 35 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 33/898 28/32 AutonomousCar-PT-03b-LTLFireability-05 4086543 m, 116132 m/sec, 23989466 t fired, .

Time elapsed: 40 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 38/898 32/32 AutonomousCar-PT-03b-LTLFireability-05 4625827 m, 107856 m/sec, 27433452 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 7 (type EXCL) for AutonomousCar-PT-03b-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 1 (type EXCL) for 0 AutonomousCar-PT-03b-LTLFireability-01
lola: time limit : 1183 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1183 5/32 AutonomousCar-PT-03b-LTLFireability-01 571353 m, 114270 m/sec, 3141186 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1183 8/32 AutonomousCar-PT-03b-LTLFireability-01 1137475 m, 113224 m/sec, 6264836 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1183 12/32 AutonomousCar-PT-03b-LTLFireability-01 1669001 m, 106305 m/sec, 9395802 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1183 15/32 AutonomousCar-PT-03b-LTLFireability-01 2121323 m, 90464 m/sec, 12309141 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1183 18/32 AutonomousCar-PT-03b-LTLFireability-01 2569819 m, 89699 m/sec, 14939790 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1183 22/32 AutonomousCar-PT-03b-LTLFireability-01 3099024 m, 105841 m/sec, 17921319 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1183 25/32 AutonomousCar-PT-03b-LTLFireability-01 3553198 m, 90834 m/sec, 20735284 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1183 28/32 AutonomousCar-PT-03b-LTLFireability-01 4030120 m, 95384 m/sec, 23611914 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/1183 31/32 AutonomousCar-PT-03b-LTLFireability-01 4476919 m, 89359 m/sec, 26430194 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 1 (type EXCL) for AutonomousCar-PT-03b-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-03b-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-03b-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-03b-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-03b-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 16 (type EXCL) for 15 AutonomousCar-PT-03b-LTLFireability-14
lola: time limit : 1750 sec
lola: memory limit: 32 pages
lola: FINISHED task # 16 (type EXCL) for AutonomousCar-PT-03b-LTLFireability-14
lola: result : true
lola: markings : 7516
lola: fired transitions : 15392
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 AutonomousCar-PT-03b-LTLFireability-03
lola: time limit : 3500 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for AutonomousCar-PT-03b-LTLFireability-03
lola: result : false
lola: markings : 653
lola: fired transitions : 1698
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 6

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-03b-LTLFireability-01: LTL unknown AGGR
AutonomousCar-PT-03b-LTLFireability-03: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-05: LTL unknown AGGR
AutonomousCar-PT-03b-LTLFireability-08: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-09: LTL false LTL model checker
AutonomousCar-PT-03b-LTLFireability-14: LTL true LTL model checker


Time elapsed: 100 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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