fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r294-smll-165463873000476
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for AutonomousCar-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
311.731 29659.00 56958.00 340.60 FTTFTFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.4K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Jun 7 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Jun 7 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 114K Jun 3 16:02 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654900157355

Running Version 202205111006
[2022-06-10 22:29:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 22:29:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 22:29:20] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2022-06-10 22:29:20] [INFO ] Transformed 57 places.
[2022-06-10 22:29:20] [INFO ] Transformed 289 transitions.
[2022-06-10 22:29:20] [INFO ] Found NUPN structural information;
[2022-06-10 22:29:20] [INFO ] Parsed PT model containing 57 places and 289 transitions in 515 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 113 transitions
Reduce redundant transitions removed 113 transitions.
FORMULA AutonomousCar-PT-05a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 176/176 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 175
Applied a total of 2 rules in 48 ms. Remains 56 /57 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 56 cols
[2022-06-10 22:29:20] [INFO ] Computed 9 place invariants in 20 ms
[2022-06-10 22:29:21] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 175 rows 56 cols
[2022-06-10 22:29:21] [INFO ] Computed 9 place invariants in 7 ms
[2022-06-10 22:29:21] [INFO ] State equation strengthened by 103 read => feed constraints.
[2022-06-10 22:29:21] [INFO ] Implicit Places using invariants and state equation in 277 ms returned [52, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 620 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/57 places, 175/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/57 places, 175/176 transitions.
Support contains 34 out of 54 places after structural reductions.
[2022-06-10 22:29:21] [INFO ] Flatten gal took : 118 ms
[2022-06-10 22:29:22] [INFO ] Flatten gal took : 58 ms
[2022-06-10 22:29:22] [INFO ] Input system was already deterministic with 175 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 862 ms. (steps per millisecond=11 ) properties (out of 28) seen :23
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 175 rows 54 cols
[2022-06-10 22:29:23] [INFO ] Computed 7 place invariants in 5 ms
[2022-06-10 22:29:23] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2022-06-10 22:29:23] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 22:29:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2022-06-10 22:29:23] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 22:29:23] [INFO ] State equation strengthened by 103 read => feed constraints.
[2022-06-10 22:29:23] [INFO ] After 53ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 22:29:23] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-06-10 22:29:23] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 54/54 places, 175/175 transitions.
Graph (complete) has 386 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 53 transition count 166
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 48 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 47 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 47 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 46 transition count 164
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 24 place count 40 transition count 133
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 40 transition count 133
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 36 place count 37 transition count 130
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 37 transition count 126
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 59 place count 33 transition count 111
Applied a total of 59 rules in 117 ms. Remains 33 /54 variables (removed 21) and now considering 111/175 (removed 64) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/54 places, 111/175 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished probabilistic random walk after 23163 steps, run visited all 1 properties in 150 ms. (steps per millisecond=154 )
Probabilistic random walk after 23163 steps, saw 4526 distinct states, run finished after 151 ms. (steps per millisecond=153 ) properties seen :1
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 54 transition count 169
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 48 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 47 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 47 transition count 167
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 46 transition count 167
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 21 place count 41 transition count 137
Iterating global reduction 3 with 5 rules applied. Total rules applied 26 place count 41 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 39 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 38 transition count 135
Applied a total of 32 rules in 55 ms. Remains 38 /54 variables (removed 16) and now considering 135/175 (removed 40) transitions.
// Phase 1: matrix 135 rows 38 cols
[2022-06-10 22:29:24] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:24] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 135 rows 38 cols
[2022-06-10 22:29:25] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 22:29:25] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-10 22:29:25] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2022-06-10 22:29:25] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 135 rows 38 cols
[2022-06-10 22:29:25] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 22:29:25] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/54 places, 135/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/54 places, 135/175 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s11 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-00 finished in 1006 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&p0))))'
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 145
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 145
Applied a total of 10 rules in 6 ms. Remains 49 /54 variables (removed 5) and now considering 145/175 (removed 30) transitions.
// Phase 1: matrix 145 rows 49 cols
[2022-06-10 22:29:25] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:26] [INFO ] Implicit Places using invariants in 204 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 213 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/54 places, 145/175 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 48/54 places, 145/175 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s21 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 830 ms.
Product exploration explored 100000 steps with 50000 reset in 419 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-05a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05a-LTLFireability-01 finished in 1731 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 54 transition count 170
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 49 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 49 transition count 168
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 47 transition count 168
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 42 transition count 138
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 42 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 41 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 28 place count 40 transition count 137
Applied a total of 28 rules in 35 ms. Remains 40 /54 variables (removed 14) and now considering 137/175 (removed 38) transitions.
// Phase 1: matrix 137 rows 40 cols
[2022-06-10 22:29:27] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:27] [INFO ] Implicit Places using invariants in 144 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/54 places, 137/175 transitions.
Applied a total of 0 rules in 11 ms. Remains 39 /39 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 39/54 places, 137/175 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s16 1) (EQ s21 1) (EQ s26 1) (EQ s29 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-03 finished in 322 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(X(F((F(p0)||p1)))))||X(p2))))'
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 157
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 157
Applied a total of 6 rules in 6 ms. Remains 51 /54 variables (removed 3) and now considering 157/175 (removed 18) transitions.
// Phase 1: matrix 157 rows 51 cols
[2022-06-10 22:29:27] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 22:29:27] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 157 rows 51 cols
[2022-06-10 22:29:27] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:28] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-10 22:29:28] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 51 cols
[2022-06-10 22:29:28] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:28] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 157/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/54 places, 157/175 transitions.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s2 1) (EQ s20 1) (EQ s46 1)), p0:(OR (EQ s1 0) (EQ s6 0) (EQ s19 0) (EQ s46 0)), p1:(AND (EQ s1 1) (EQ s6 1) (EQ s36 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 776 ms.
Product exploration explored 100000 steps with 33333 reset in 527 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-05a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05a-LTLFireability-04 finished in 2216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((G(p0)&&p1)))||G(p2)))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 54 transition count 170
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 49 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 47 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 47 transition count 167
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 46 transition count 167
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 21 place count 41 transition count 137
Iterating global reduction 3 with 5 rules applied. Total rules applied 26 place count 41 transition count 137
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 3 with 2 rules applied. Total rules applied 28 place count 40 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 39 transition count 136
Applied a total of 30 rules in 19 ms. Remains 39 /54 variables (removed 15) and now considering 136/175 (removed 39) transitions.
// Phase 1: matrix 136 rows 39 cols
[2022-06-10 22:29:30] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:30] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 136 rows 39 cols
[2022-06-10 22:29:30] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-10 22:29:30] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-10 22:29:30] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2022-06-10 22:29:30] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 136 rows 39 cols
[2022-06-10 22:29:30] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:30] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/54 places, 136/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/54 places, 136/175 transitions.
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2 p1), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s22 0), p2:(AND (EQ s1 1) (EQ s2 1) (EQ s17 1) (EQ s35 1)), p1:(AND (EQ s1 1) (EQ s5 1) (EQ s17 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-05 finished in 710 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G((p0 U p1)))||p2)))'
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 54 transition count 168
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 47 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 47 transition count 167
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 16 place count 46 transition count 167
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 43 transition count 149
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 43 transition count 149
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 24 place count 42 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 26 place count 41 transition count 148
Applied a total of 26 rules in 19 ms. Remains 41 /54 variables (removed 13) and now considering 148/175 (removed 27) transitions.
// Phase 1: matrix 148 rows 41 cols
[2022-06-10 22:29:30] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:30] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 148 rows 41 cols
[2022-06-10 22:29:30] [INFO ] Computed 7 place invariants in 11 ms
[2022-06-10 22:29:30] [INFO ] State equation strengthened by 90 read => feed constraints.
[2022-06-10 22:29:31] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2022-06-10 22:29:31] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 148 rows 41 cols
[2022-06-10 22:29:31] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-10 22:29:31] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/54 places, 148/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/54 places, 148/175 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s7 1) (EQ s17 1) (EQ s37 1)), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s28 1) (EQ s37 1)), p0:(AND (EQ s1 1) (EQ s6 1) (EQ s26 1) (EQ s37 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-06 finished in 624 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(G(p1) U p2))))'
Support contains 13 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 145
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 145
Applied a total of 10 rules in 3 ms. Remains 49 /54 variables (removed 5) and now considering 145/175 (removed 30) transitions.
// Phase 1: matrix 145 rows 49 cols
[2022-06-10 22:29:31] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:31] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 145 rows 49 cols
[2022-06-10 22:29:31] [INFO ] Computed 7 place invariants in 8 ms
[2022-06-10 22:29:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-06-10 22:29:31] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
// Phase 1: matrix 145 rows 49 cols
[2022-06-10 22:29:31] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:31] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/54 places, 145/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/54 places, 145/175 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s5 1) (EQ s31 1) (EQ s44 1)), p1:(AND (EQ s14 1) (EQ s20 1) (EQ s24 1) (EQ s32 1) (EQ s38 1) (EQ s45 1)), p0:(AND (EQ s1 1) (EQ s6 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-08 finished in 675 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 54 transition count 168
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 47 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 47 transition count 167
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 46 transition count 167
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 42 transition count 143
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 42 transition count 143
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 2 with 4 rules applied. Total rules applied 28 place count 40 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 39 transition count 141
Applied a total of 30 rules in 32 ms. Remains 39 /54 variables (removed 15) and now considering 141/175 (removed 34) transitions.
// Phase 1: matrix 141 rows 39 cols
[2022-06-10 22:29:32] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:32] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 141 rows 39 cols
[2022-06-10 22:29:32] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:32] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-06-10 22:29:32] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2022-06-10 22:29:32] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 141 rows 39 cols
[2022-06-10 22:29:32] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:32] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/54 places, 141/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/54 places, 141/175 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s29 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-09 finished in 571 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !(G(p1) U (p1 U F(p1)))))'
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 54 transition count 169
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 48 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 48 transition count 168
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 14 place count 47 transition count 168
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 42 transition count 138
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 42 transition count 138
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 2 with 4 rules applied. Total rules applied 28 place count 40 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 30 place count 39 transition count 136
Applied a total of 30 rules in 30 ms. Remains 39 /54 variables (removed 15) and now considering 136/175 (removed 39) transitions.
// Phase 1: matrix 136 rows 39 cols
[2022-06-10 22:29:32] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:32] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 136 rows 39 cols
[2022-06-10 22:29:32] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:32] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-10 22:29:32] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2022-06-10 22:29:32] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 136 rows 39 cols
[2022-06-10 22:29:32] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:33] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/54 places, 136/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/54 places, 136/175 transitions.
Stuttering acceptance computed with spot in 124 ms :[p1, true, p1]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s7 1) (EQ s28 1) (EQ s35 1)), p0:(AND (EQ s1 1) (EQ s6 1) (EQ s28 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 16 reset in 222 ms.
Product exploration explored 100000 steps with 9 reset in 183 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 520 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[true, p1, p1]
Finished random walk after 2832 steps, including 221 resets, run visited all 1 properties in 16 ms. (steps per millisecond=177 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 12 factoid took 543 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 108 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 111 ms :[true, p1, p1]
Support contains 4 out of 39 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 136/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 136/136 (removed 0) transitions.
// Phase 1: matrix 136 rows 39 cols
[2022-06-10 22:29:35] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:35] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 136 rows 39 cols
[2022-06-10 22:29:35] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:35] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-10 22:29:35] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
// Phase 1: matrix 136 rows 39 cols
[2022-06-10 22:29:35] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:35] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 136/136 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 113 ms :[true, p1, p1]
Finished random walk after 5096 steps, including 329 resets, run visited all 1 properties in 38 ms. (steps per millisecond=134 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 124 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 198 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 110 ms :[true, p1, p1]
Product exploration explored 100000 steps with 5 reset in 151 ms.
Product exploration explored 100000 steps with 27 reset in 507 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 106 ms :[true, p1, p1]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 136/136 transitions.
Applied a total of 0 rules in 8 ms. Remains 39 /39 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2022-06-10 22:29:37] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 136 rows 39 cols
[2022-06-10 22:29:37] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:37] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 136/136 transitions.
Entered a terminal (fully accepting) state of product in 579 steps with 45 reset in 8 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-10 finished in 5254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||X(p1)) U X(p1)))'
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 157
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 157
Applied a total of 6 rules in 4 ms. Remains 51 /54 variables (removed 3) and now considering 157/175 (removed 18) transitions.
// Phase 1: matrix 157 rows 51 cols
[2022-06-10 22:29:37] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:37] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 157 rows 51 cols
[2022-06-10 22:29:37] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:38] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-10 22:29:38] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 51 cols
[2022-06-10 22:29:38] [INFO ] Computed 7 place invariants in 8 ms
[2022-06-10 22:29:38] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 157/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/54 places, 157/175 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s13 1) (EQ s46 1)), p1:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-11 finished in 735 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X((!p0 U (!p1||G(!p0))))&&!p0))))'
Support contains 10 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 145
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 145
Applied a total of 10 rules in 3 ms. Remains 49 /54 variables (removed 5) and now considering 145/175 (removed 30) transitions.
// Phase 1: matrix 145 rows 49 cols
[2022-06-10 22:29:38] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:38] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 145 rows 49 cols
[2022-06-10 22:29:38] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:38] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-06-10 22:29:38] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
// Phase 1: matrix 145 rows 49 cols
[2022-06-10 22:29:38] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:38] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/54 places, 145/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/54 places, 145/175 transitions.
Stuttering acceptance computed with spot in 110 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s8 1) (EQ s25 1) (EQ s44 1)), p1:(AND (EQ s12 1) (EQ s18 1) (EQ s26 1) (EQ s30 1) (EQ s38 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33315 reset in 579 ms.
Product exploration explored 100000 steps with 33348 reset in 723 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 376 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 563 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 49 cols
[2022-06-10 22:29:40] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:41] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-06-10 22:29:41] [INFO ] After 45ms 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)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 579 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[p0, p0]
Stuttering acceptance computed with spot in 96 ms :[p0, p0]
Support contains 4 out of 49 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 : 49/49 places, 145/145 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 49 transition count 141
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 45 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 44 transition count 140
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 44 transition count 138
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 42 transition count 138
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 3 with 2 rules applied. Total rules applied 16 place count 41 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 40 transition count 137
Applied a total of 18 rules in 23 ms. Remains 40 /49 variables (removed 9) and now considering 137/145 (removed 8) transitions.
// Phase 1: matrix 137 rows 40 cols
[2022-06-10 22:29:41] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:41] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 137 rows 40 cols
[2022-06-10 22:29:41] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:42] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-10 22:29:42] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2022-06-10 22:29:42] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 137 rows 40 cols
[2022-06-10 22:29:42] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:42] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/49 places, 137/145 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/49 places, 137/145 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Finished random walk after 85 steps, including 7 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Product exploration explored 100000 steps with 58 reset in 66 ms.
Product exploration explored 100000 steps with 53 reset in 141 ms.
Built C files in :
/tmp/ltsmin13051252309026373258
[2022-06-10 22:29:43] [INFO ] Computing symmetric may disable matrix : 137 transitions.
[2022-06-10 22:29:43] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:29:43] [INFO ] Computing symmetric may enable matrix : 137 transitions.
[2022-06-10 22:29:43] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:29:43] [INFO ] Computing Do-Not-Accords matrix : 137 transitions.
[2022-06-10 22:29:43] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 22:29:43] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13051252309026373258
Running compilation step : cd /tmp/ltsmin13051252309026373258;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1022 ms.
Running link step : cd /tmp/ltsmin13051252309026373258;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin13051252309026373258;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15944848581731833817.hoa' '--buchi-type=spotba'
LTSmin run took 363 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05a-LTLFireability-12 finished in 6070 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(!p0) U p1)&&(G(G(p2))||X(p3))))))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 157
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 157
Applied a total of 6 rules in 3 ms. Remains 51 /54 variables (removed 3) and now considering 157/175 (removed 18) transitions.
// Phase 1: matrix 157 rows 51 cols
[2022-06-10 22:29:44] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:44] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 157 rows 51 cols
[2022-06-10 22:29:44] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:44] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-10 22:29:44] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 51 cols
[2022-06-10 22:29:44] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:45] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 157/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/54 places, 157/175 transitions.
Stuttering acceptance computed with spot in 453 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p1) p0), (AND (NOT p2) (NOT p3)), true, (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(OR (EQ s1 0) (EQ s6 0) (EQ s38 0) (EQ s46 0)), p1:(AND (EQ s1 1) (EQ s6 1) (EQ s32 1) (EQ s46 1)), p3:(AND (EQ s1 1) (EQ s6 1) (EQ s38 1) (EQ s46 1)),...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-13 finished in 977 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!p0 U p1))'
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 54 transition count 169
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 48 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 48 transition count 168
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 14 place count 47 transition count 168
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 43 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 43 transition count 144
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 2 with 4 rules applied. Total rules applied 26 place count 41 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 28 place count 40 transition count 142
Applied a total of 28 rules in 34 ms. Remains 40 /54 variables (removed 14) and now considering 142/175 (removed 33) transitions.
// Phase 1: matrix 142 rows 40 cols
[2022-06-10 22:29:45] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:45] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 142 rows 40 cols
[2022-06-10 22:29:45] [INFO ] Computed 7 place invariants in 5 ms
[2022-06-10 22:29:45] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-06-10 22:29:45] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2022-06-10 22:29:45] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 142 rows 40 cols
[2022-06-10 22:29:46] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:46] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/54 places, 142/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/54 places, 142/175 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, p1]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s20 1), p0:(AND (EQ s1 1) (EQ s7 1) (EQ s16 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-14 finished in 608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 151
Applied a total of 8 rules in 4 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2022-06-10 22:29:46] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:46] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 151 rows 50 cols
[2022-06-10 22:29:46] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:29:46] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-06-10 22:29:46] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
// Phase 1: matrix 151 rows 50 cols
[2022-06-10 22:29:46] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:29:46] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s8 1) (EQ s25 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-15 finished in 588 ms.
All properties solved by simple procedures.
Total runtime 26976 ms.

BK_STOP 1654900187014

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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