About the Execution of ITS-Tools for AutonomousCar-PT-07a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
698.720 | 105464.00 | 260853.00 | 577.70 | FFFFTFTFFFFFFFFF | 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-165463873000508.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-07a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463873000508
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.0K Jun 7 15:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 7 15:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 8.6K Jun 7 15:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 7 15:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Jun 7 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 7 15:49 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 276K 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-07a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1654902959055
Running Version 202205111006
[2022-06-10 23:16:00] [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 23:16:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 23:16:01] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2022-06-10 23:16:01] [INFO ] Transformed 73 places.
[2022-06-10 23:16:01] [INFO ] Transformed 593 transitions.
[2022-06-10 23:16:01] [INFO ] Found NUPN structural information;
[2022-06-10 23:16:01] [INFO ] Parsed PT model containing 73 places and 593 transitions in 458 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
FORMULA AutonomousCar-PT-07a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 371
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 371
Applied a total of 4 rules in 35 ms. Remains 71 /73 variables (removed 2) and now considering 371/380 (removed 9) transitions.
// Phase 1: matrix 371 rows 71 cols
[2022-06-10 23:16:01] [INFO ] Computed 11 place invariants in 27 ms
[2022-06-10 23:16:02] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 371 rows 71 cols
[2022-06-10 23:16:02] [INFO ] Computed 11 place invariants in 9 ms
[2022-06-10 23:16:02] [INFO ] State equation strengthened by 192 read => feed constraints.
[2022-06-10 23:16:02] [INFO ] Implicit Places using invariants and state equation in 371 ms returned [67, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 691 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/73 places, 371/380 transitions.
Applied a total of 0 rules in 8 ms. Remains 69 /69 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 69/73 places, 371/380 transitions.
Support contains 34 out of 69 places after structural reductions.
[2022-06-10 23:16:02] [INFO ] Flatten gal took : 140 ms
[2022-06-10 23:16:03] [INFO ] Flatten gal took : 85 ms
[2022-06-10 23:16:03] [INFO ] Input system was already deterministic with 371 transitions.
Incomplete random walk after 10000 steps, including 516 resets, run finished after 893 ms. (steps per millisecond=11 ) properties (out of 26) seen :15
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :2
Running SMT prover for 6 properties.
// Phase 1: matrix 371 rows 69 cols
[2022-06-10 23:16:04] [INFO ] Computed 9 place invariants in 10 ms
[2022-06-10 23:16:05] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-10 23:16:05] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-10 23:16:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-06-10 23:16:05] [INFO ] After 456ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2022-06-10 23:16:05] [INFO ] State equation strengthened by 192 read => feed constraints.
[2022-06-10 23:16:05] [INFO ] After 253ms SMT Verify possible using 192 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2022-06-10 23:16:06] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 332 ms.
[2022-06-10 23:16:06] [INFO ] After 1564ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 113 ms.
Support contains 9 out of 69 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 69/69 places, 371/371 transitions.
Graph (complete) has 661 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 68 transition count 360
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 61 transition count 360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 61 transition count 359
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 60 transition count 359
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 26 place count 54 transition count 318
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 54 transition count 318
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 2 with 6 rules applied. Total rules applied 38 place count 51 transition count 315
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 45 place count 51 transition count 308
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 87 place count 44 transition count 273
Applied a total of 87 rules in 194 ms. Remains 44 /69 variables (removed 25) and now considering 273/371 (removed 98) transitions.
Finished structural reductions, in 1 iterations. Remains : 44/69 places, 273/371 transitions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 273 rows 44 cols
[2022-06-10 23:16:07] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-10 23:16:07] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 23:16:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-06-10 23:16:07] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 23:16:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-06-10 23:16:07] [INFO ] After 74ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 23:16:07] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-06-10 23:16:08] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44/44 places, 273/273 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 272
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 43 transition count 265
Applied a total of 9 rules in 58 ms. Remains 43 /44 variables (removed 1) and now considering 265/273 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 43/44 places, 265/273 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Finished probabilistic random walk after 289677 steps, run visited all 2 properties in 1178 ms. (steps per millisecond=245 )
Probabilistic random walk after 289677 steps, saw 41970 distinct states, run finished after 1178 ms. (steps per millisecond=245 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
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(G((G(p1)||p0))))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 69 transition count 362
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 60 transition count 362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 60 transition count 361
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 20 place count 59 transition count 361
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 55 transition count 329
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 55 transition count 329
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 32 place count 53 transition count 327
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 34 place count 52 transition count 327
Applied a total of 34 rules in 103 ms. Remains 52 /69 variables (removed 17) and now considering 327/371 (removed 44) transitions.
// Phase 1: matrix 327 rows 52 cols
[2022-06-10 23:16:10] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:10] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 327 rows 52 cols
[2022-06-10 23:16:10] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:10] [INFO ] State equation strengthened by 166 read => feed constraints.
[2022-06-10 23:16:10] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2022-06-10 23:16:10] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 327 rows 52 cols
[2022-06-10 23:16:10] [INFO ] Computed 9 place invariants in 4 ms
[2022-06-10 23:16:10] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/69 places, 327/371 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/69 places, 327/371 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s7 1) (EQ s21 1) (EQ s48 1)), p0:(OR (EQ s1 0) (EQ s4 0) (EQ s37 0) (EQ s48 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 12 reset in 411 ms.
Product exploration explored 100000 steps with 97 reset in 312 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) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 411 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 741 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 327 rows 52 cols
[2022-06-10 23:16:12] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:12] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 23:16:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-10 23:16:12] [INFO ] After 33ms SMT Verify possible using all constraints in natural 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 p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 576 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 4 out of 52 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 : 52/52 places, 327/327 transitions.
Applied a total of 0 rules in 21 ms. Remains 52 /52 variables (removed 0) and now considering 327/327 (removed 0) transitions.
// Phase 1: matrix 327 rows 52 cols
[2022-06-10 23:16:13] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:13] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 327 rows 52 cols
[2022-06-10 23:16:13] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 23:16:13] [INFO ] State equation strengthened by 166 read => feed constraints.
[2022-06-10 23:16:13] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2022-06-10 23:16:13] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 327 rows 52 cols
[2022-06-10 23:16:13] [INFO ] Computed 9 place invariants in 4 ms
[2022-06-10 23:16:13] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 327/327 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 1402 steps, including 104 resets, run visited all 1 properties in 12 ms. (steps per millisecond=116 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 127 reset in 255 ms.
Product exploration explored 100000 steps with 36 reset in 189 ms.
Built C files in :
/tmp/ltsmin9576137440469676397
[2022-06-10 23:16:14] [INFO ] Computing symmetric may disable matrix : 327 transitions.
[2022-06-10 23:16:14] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:16:14] [INFO ] Computing symmetric may enable matrix : 327 transitions.
[2022-06-10 23:16:14] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:16:14] [INFO ] Computing Do-Not-Accords matrix : 327 transitions.
[2022-06-10 23:16:15] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:16:15] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9576137440469676397
Running compilation step : cd /tmp/ltsmin9576137440469676397;'/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 1696 ms.
Running link step : cd /tmp/ltsmin9576137440469676397;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin9576137440469676397;'/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/stateBased290104720885244901.hoa' '--buchi-type=spotba'
LTSmin run took 7861 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-07a-LTLFireability-00 finished in 14773 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(G((G(p0)&&p0)))||!p1)) U p1)))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 331
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 331
Applied a total of 10 rules in 8 ms. Remains 64 /69 variables (removed 5) and now considering 331/371 (removed 40) transitions.
// Phase 1: matrix 331 rows 64 cols
[2022-06-10 23:16:24] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:24] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 331 rows 64 cols
[2022-06-10 23:16:24] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 23:16:24] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-10 23:16:25] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
// Phase 1: matrix 331 rows 64 cols
[2022-06-10 23:16:25] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:25] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/69 places, 331/371 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/69 places, 331/371 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(EQ s25 1), p1:(AND (EQ s1 1) (EQ s7 1) (EQ s25 1) (EQ s59 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]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-01 finished in 863 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(F(p0))&&F(p1)))||G(p2)))'
Support contains 12 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 6 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
// Phase 1: matrix 323 rows 63 cols
[2022-06-10 23:16:25] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:25] [INFO ] Implicit Places using invariants in 153 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 154 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 323/371 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s14 1), p1:(OR (EQ s13 0) (EQ s21 0) (EQ s27 0) (EQ s31 0) (EQ s39 0) (EQ s45 0) (EQ s51 0) (EQ s58 0)), p0:(AND (EQ s15 1) (EQ s21 1) (EQ s25 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]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-02 finished in 383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 69 transition count 363
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 61 transition count 363
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 61 transition count 362
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 18 place count 60 transition count 362
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 54 transition count 314
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 54 transition count 314
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 34 place count 52 transition count 312
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 36 place count 51 transition count 312
Applied a total of 36 rules in 43 ms. Remains 51 /69 variables (removed 18) and now considering 312/371 (removed 59) transitions.
// Phase 1: matrix 312 rows 51 cols
[2022-06-10 23:16:25] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:26] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 312 rows 51 cols
[2022-06-10 23:16:26] [INFO ] Computed 9 place invariants in 9 ms
[2022-06-10 23:16:26] [INFO ] State equation strengthened by 152 read => feed constraints.
[2022-06-10 23:16:26] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2022-06-10 23:16:26] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 312 rows 51 cols
[2022-06-10 23:16:26] [INFO ] Computed 9 place invariants in 5 ms
[2022-06-10 23:16:26] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/69 places, 312/371 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/69 places, 312/371 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s8 1) (EQ s20 1) (EQ s47 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 12 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-03 finished in 699 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))||p1)))'
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 7 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
// Phase 1: matrix 323 rows 63 cols
[2022-06-10 23:16:26] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:26] [INFO ] Implicit Places using invariants in 204 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 205 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 323/371 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s41 1), p0:(EQ s41 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1185 ms.
Product exploration explored 100000 steps with 33333 reset in 1108 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 : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-07a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-04 finished in 2716 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(X(X(F(!p0)))) U X(F(p0)))||X(F(p1)))))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 69 transition count 362
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 60 transition count 362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 60 transition count 361
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 20 place count 59 transition count 361
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 55 transition count 329
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 55 transition count 329
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 30 place count 54 transition count 328
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 32 place count 53 transition count 328
Applied a total of 32 rules in 37 ms. Remains 53 /69 variables (removed 16) and now considering 328/371 (removed 43) transitions.
// Phase 1: matrix 328 rows 53 cols
[2022-06-10 23:16:29] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:29] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 328 rows 53 cols
[2022-06-10 23:16:29] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:29] [INFO ] State equation strengthened by 166 read => feed constraints.
[2022-06-10 23:16:29] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2022-06-10 23:16:29] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 328 rows 53 cols
[2022-06-10 23:16:29] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:30] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/69 places, 328/371 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/69 places, 328/371 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s33 1) (EQ s49 1)), p1:(AND (EQ s1 1) (EQ s8 1) (EQ s27 1) (EQ s49 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-07a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-05 finished in 752 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(F(p0))||X(p1)))&&X(F(p2))))'
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 331
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 331
Applied a total of 10 rules in 3 ms. Remains 64 /69 variables (removed 5) and now considering 331/371 (removed 40) transitions.
// Phase 1: matrix 331 rows 64 cols
[2022-06-10 23:16:30] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:30] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 331 rows 64 cols
[2022-06-10 23:16:30] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:30] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-10 23:16:30] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
// Phase 1: matrix 331 rows 64 cols
[2022-06-10 23:16:30] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:30] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/69 places, 331/371 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/69 places, 331/371 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s9 1) (EQ s45 1) (EQ s59 1)), p1:(OR (EQ s1 0) (EQ s5 0) (EQ s17 0) (EQ s59 0)), p0:(OR (EQ s1 0) (EQ s7 0) (EQ s17 0) (EQ s59 0))], nbAcceptance=0, 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]]
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-07 finished in 801 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(p0))||X(G(p1))||p1))))'
Support contains 9 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 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 69 transition count 364
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 62 transition count 364
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 62 transition count 362
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 18 place count 60 transition count 362
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 55 transition count 322
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 55 transition count 322
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 30 place count 54 transition count 321
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 32 place count 53 transition count 321
Applied a total of 32 rules in 41 ms. Remains 53 /69 variables (removed 16) and now considering 321/371 (removed 50) transitions.
// Phase 1: matrix 321 rows 53 cols
[2022-06-10 23:16:30] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:31] [INFO ] Implicit Places using invariants in 163 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 167 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/69 places, 321/371 transitions.
Applied a total of 0 rules in 13 ms. Remains 52 /52 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 52/69 places, 321/371 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s10 1), p0:(AND (EQ s11 1) (EQ s17 1) (EQ s22 1) (EQ s29 1) (EQ s34 1) (EQ s39 1) (EQ s44 1) (EQ s49 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 25 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-08 finished in 335 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((X(p0)||p1)))&&G(p2))))'
Support contains 14 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 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 69 transition count 364
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 62 transition count 364
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 62 transition count 362
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 18 place count 60 transition count 362
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 56 transition count 330
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 56 transition count 330
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 28 place count 55 transition count 329
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 54 transition count 329
Applied a total of 30 rules in 36 ms. Remains 54 /69 variables (removed 15) and now considering 329/371 (removed 42) transitions.
// Phase 1: matrix 329 rows 54 cols
[2022-06-10 23:16:31] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 23:16:31] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 329 rows 54 cols
[2022-06-10 23:16:31] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 23:16:31] [INFO ] State equation strengthened by 166 read => feed constraints.
[2022-06-10 23:16:31] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2022-06-10 23:16:31] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 329 rows 54 cols
[2022-06-10 23:16:31] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:31] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/69 places, 329/371 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/69 places, 329/371 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s7 1) (EQ s27 1) (EQ s50 1)), p1:(AND (EQ s1 1) (EQ s4 1) (EQ s13 1) (EQ s50 1)), p0:(AND (EQ s15 1) (EQ s18 1) (EQ s25 1) (EQ s28 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 12 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-09 finished in 839 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 3 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
// Phase 1: matrix 323 rows 63 cols
[2022-06-10 23:16:32] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:32] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 323 rows 63 cols
[2022-06-10 23:16:32] [INFO ] Computed 9 place invariants in 5 ms
[2022-06-10 23:16:32] [INFO ] State equation strengthened by 150 read => feed constraints.
[2022-06-10 23:16:32] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
// Phase 1: matrix 323 rows 63 cols
[2022-06-10 23:16:32] [INFO ] Computed 9 place invariants in 6 ms
[2022-06-10 23:16:32] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 323/371 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-10 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:(OR (AND (EQ s1 1) (EQ s9 1) (EQ s21 1) (EQ s58 1)) (AND (EQ s1 1) (EQ s2 1) (EQ s23 1) (EQ s58 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 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-10 finished in 646 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((G((G(X(F(p0)))&&p0))&&G(p1))))))'
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 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 69 transition count 364
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 62 transition count 364
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 62 transition count 363
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 61 transition count 363
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 22 place count 55 transition count 315
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 55 transition count 315
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 32 place count 53 transition count 313
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 34 place count 52 transition count 313
Applied a total of 34 rules in 62 ms. Remains 52 /69 variables (removed 17) and now considering 313/371 (removed 58) transitions.
// Phase 1: matrix 313 rows 52 cols
[2022-06-10 23:16:32] [INFO ] Computed 9 place invariants in 5 ms
[2022-06-10 23:16:32] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 313 rows 52 cols
[2022-06-10 23:16:32] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:33] [INFO ] State equation strengthened by 152 read => feed constraints.
[2022-06-10 23:16:33] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2022-06-10 23:16:33] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 313 rows 52 cols
[2022-06-10 23:16:33] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:33] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/69 places, 313/371 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/69 places, 313/371 transitions.
Stuttering acceptance computed with spot in 37 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s37 0), p1:(OR (EQ s1 0) (EQ s7 0) (EQ s15 0) (EQ s48 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 11 reset in 165 ms.
Product exploration explored 100000 steps with 194 reset in 210 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 p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 342 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 46 ms :[(OR (NOT p1) (NOT p0))]
Finished random walk after 109 steps, including 8 resets, run visited all 2 properties in 3 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (OR (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 319 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[(OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p1) (NOT p0))]
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 313/313 transitions.
Applied a total of 0 rules in 35 ms. Remains 52 /52 variables (removed 0) and now considering 313/313 (removed 0) transitions.
// Phase 1: matrix 313 rows 52 cols
[2022-06-10 23:16:34] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:35] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 313 rows 52 cols
[2022-06-10 23:16:35] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:35] [INFO ] State equation strengthened by 152 read => feed constraints.
[2022-06-10 23:16:35] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
[2022-06-10 23:16:35] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 313 rows 52 cols
[2022-06-10 23:16:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:35] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 313/313 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 : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 42 ms :[(OR (NOT p1) (NOT p0))]
Finished random walk after 64 steps, including 4 resets, run visited all 2 properties in 3 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (OR (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 257 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 48 ms :[(OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 47 reset in 104 ms.
Product exploration explored 100000 steps with 12 reset in 126 ms.
Built C files in :
/tmp/ltsmin4780893516705082249
[2022-06-10 23:16:36] [INFO ] Computing symmetric may disable matrix : 313 transitions.
[2022-06-10 23:16:36] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:16:36] [INFO ] Computing symmetric may enable matrix : 313 transitions.
[2022-06-10 23:16:36] [INFO ] Computation of Complete enable matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:16:37] [INFO ] Computing Do-Not-Accords matrix : 313 transitions.
[2022-06-10 23:16:37] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:16:37] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4780893516705082249
Running compilation step : cd /tmp/ltsmin4780893516705082249;'/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 1568 ms.
Running link step : cd /tmp/ltsmin4780893516705082249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4780893516705082249;'/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/stateBased13875724092260363101.hoa' '--buchi-type=spotba'
LTSmin run took 4537 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-07a-LTLFireability-12 finished in 10522 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 331
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 331
Applied a total of 10 rules in 2 ms. Remains 64 /69 variables (removed 5) and now considering 331/371 (removed 40) transitions.
// Phase 1: matrix 331 rows 64 cols
[2022-06-10 23:16:43] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:43] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 331 rows 64 cols
[2022-06-10 23:16:43] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:43] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-10 23:16:43] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
// Phase 1: matrix 331 rows 64 cols
[2022-06-10 23:16:43] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:43] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/69 places, 331/371 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/69 places, 331/371 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-13 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:(AND (EQ s1 1) (EQ s8 1) (EQ s43 1) (EQ s59 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-13 finished in 680 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 69 transition count 362
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 60 transition count 362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 60 transition count 361
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 20 place count 59 transition count 361
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 54 transition count 321
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 54 transition count 321
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 34 place count 52 transition count 319
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 36 place count 51 transition count 319
Applied a total of 36 rules in 38 ms. Remains 51 /69 variables (removed 18) and now considering 319/371 (removed 52) transitions.
// Phase 1: matrix 319 rows 51 cols
[2022-06-10 23:16:43] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:44] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 319 rows 51 cols
[2022-06-10 23:16:44] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:44] [INFO ] State equation strengthened by 159 read => feed constraints.
[2022-06-10 23:16:44] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2022-06-10 23:16:44] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 319 rows 51 cols
[2022-06-10 23:16:44] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:44] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/69 places, 319/371 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/69 places, 319/371 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-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:(OR (NEQ s1 1) (NEQ s7 1) (NEQ s18 1) (NEQ s47 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 5 reset in 97 ms.
Product exploration explored 100000 steps with 75 reset in 228 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 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 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 718 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1417940 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :{}
Probabilistic random walk after 1417940 steps, saw 182307 distinct states, run finished after 3003 ms. (steps per millisecond=472 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 319 rows 51 cols
[2022-06-10 23:16:48] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:16:48] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-10 23:16:48] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 23:16:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-10 23:16:48] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 23:16:48] [INFO ] State equation strengthened by 159 read => feed constraints.
[2022-06-10 23:16:48] [INFO ] After 50ms SMT Verify possible using 159 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 23:16:48] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-06-10 23:16:48] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 51/51 places, 319/319 transitions.
Graph (complete) has 607 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 50 transition count 316
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 10 place count 50 transition count 309
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 66 place count 43 transition count 260
Applied a total of 66 rules in 28 ms. Remains 43 /51 variables (removed 8) and now considering 260/319 (removed 59) transitions.
Finished structural reductions, in 1 iterations. Remains : 43/51 places, 260/319 transitions.
Finished random walk after 1414 steps, including 9 resets, run visited all 1 properties in 10 ms. (steps per millisecond=141 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 319/319 transitions.
Applied a total of 0 rules in 15 ms. Remains 51 /51 variables (removed 0) and now considering 319/319 (removed 0) transitions.
// Phase 1: matrix 319 rows 51 cols
[2022-06-10 23:16:49] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:49] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 319 rows 51 cols
[2022-06-10 23:16:49] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:49] [INFO ] State equation strengthened by 159 read => feed constraints.
[2022-06-10 23:16:49] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2022-06-10 23:16:49] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 319 rows 51 cols
[2022-06-10 23:16:49] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:49] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 319/319 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 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 :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 746 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1746385 steps, run timeout after 3001 ms. (steps per millisecond=581 ) properties seen :{}
Probabilistic random walk after 1746385 steps, saw 221421 distinct states, run finished after 3001 ms. (steps per millisecond=581 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 319 rows 51 cols
[2022-06-10 23:16:53] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:16:53] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-10 23:16:53] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 23:16:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-06-10 23:16:53] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 23:16:53] [INFO ] State equation strengthened by 159 read => feed constraints.
[2022-06-10 23:16:53] [INFO ] After 54ms SMT Verify possible using 159 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 23:16:53] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-06-10 23:16:53] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 51/51 places, 319/319 transitions.
Graph (complete) has 607 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 50 transition count 316
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 10 place count 50 transition count 309
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 66 place count 43 transition count 260
Applied a total of 66 rules in 25 ms. Remains 43 /51 variables (removed 8) and now considering 260/319 (removed 59) transitions.
Finished structural reductions, in 1 iterations. Remains : 43/51 places, 260/319 transitions.
Finished random walk after 2316 steps, including 17 resets, run visited all 1 properties in 13 ms. (steps per millisecond=178 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 550 reset in 112 ms.
Product exploration explored 100000 steps with 413 reset in 108 ms.
Built C files in :
/tmp/ltsmin12944728561754285335
[2022-06-10 23:16:54] [INFO ] Computing symmetric may disable matrix : 319 transitions.
[2022-06-10 23:16:54] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:16:54] [INFO ] Computing symmetric may enable matrix : 319 transitions.
[2022-06-10 23:16:54] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:16:54] [INFO ] Computing Do-Not-Accords matrix : 319 transitions.
[2022-06-10 23:16:54] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:16:54] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12944728561754285335
Running compilation step : cd /tmp/ltsmin12944728561754285335;'/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 1534 ms.
Running link step : cd /tmp/ltsmin12944728561754285335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12944728561754285335;'/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/stateBased16769982091465341226.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 319/319 transitions.
Applied a total of 0 rules in 20 ms. Remains 51 /51 variables (removed 0) and now considering 319/319 (removed 0) transitions.
// Phase 1: matrix 319 rows 51 cols
[2022-06-10 23:17:09] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:17:09] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 319 rows 51 cols
[2022-06-10 23:17:09] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:17:09] [INFO ] State equation strengthened by 159 read => feed constraints.
[2022-06-10 23:17:09] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2022-06-10 23:17:09] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 319 rows 51 cols
[2022-06-10 23:17:09] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 23:17:09] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 319/319 transitions.
Built C files in :
/tmp/ltsmin12766766319370942730
[2022-06-10 23:17:09] [INFO ] Computing symmetric may disable matrix : 319 transitions.
[2022-06-10 23:17:09] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:17:09] [INFO ] Computing symmetric may enable matrix : 319 transitions.
[2022-06-10 23:17:09] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:17:10] [INFO ] Computing Do-Not-Accords matrix : 319 transitions.
[2022-06-10 23:17:10] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 23:17:10] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12766766319370942730
Running compilation step : cd /tmp/ltsmin12766766319370942730;'/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 1671 ms.
Running link step : cd /tmp/ltsmin12766766319370942730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12766766319370942730;'/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/stateBased10070479275867462952.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 23:17:25] [INFO ] Flatten gal took : 61 ms
[2022-06-10 23:17:25] [INFO ] Flatten gal took : 54 ms
[2022-06-10 23:17:25] [INFO ] Time to serialize gal into /tmp/LTL5042391476232423231.gal : 13 ms
[2022-06-10 23:17:25] [INFO ] Time to serialize properties into /tmp/LTL5601735918298544767.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5042391476232423231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5601735918298544767.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5042391...266
Read 1 LTL properties
Checking formula 0 : !((G(X(F("(((p1!=1)||(p8!=1))||((p22!=1)||(p65!=1)))")))))
Formula 0 simplified : !GXF"(((p1!=1)||(p8!=1))||((p22!=1)||(p65!=1)))"
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t9, t11, t14, t16, t19, t21, t24, t26, t29, t30, t31, t34, t36, t235, t236, t239, t24...681
Computing Next relation with stutter on 34850 deadlock states
Detected timeout of ITS tools.
[2022-06-10 23:17:40] [INFO ] Flatten gal took : 47 ms
[2022-06-10 23:17:40] [INFO ] Applying decomposition
[2022-06-10 23:17:40] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2406958947577339270.txt' '-o' '/tmp/graph2406958947577339270.bin' '-w' '/tmp/graph2406958947577339270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2406958947577339270.bin' '-l' '-1' '-v' '-w' '/tmp/graph2406958947577339270.weights' '-q' '0' '-e' '0.001'
[2022-06-10 23:17:40] [INFO ] Decomposing Gal with order
[2022-06-10 23:17:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 23:17:40] [INFO ] Removed a total of 1290 redundant transitions.
[2022-06-10 23:17:40] [INFO ] Flatten gal took : 138 ms
[2022-06-10 23:17:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 21 ms.
[2022-06-10 23:17:40] [INFO ] Time to serialize gal into /tmp/LTL11934762327298136835.gal : 5 ms
[2022-06-10 23:17:40] [INFO ] Time to serialize properties into /tmp/LTL11609937206072180253.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11934762327298136835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11609937206072180253.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1193476...247
Read 1 LTL properties
Checking formula 0 : !((G(X(F("(((u14.p1!=1)||(u14.p8!=1))||((u2.p22!=1)||(u14.p65!=1)))")))))
Formula 0 simplified : !GXF"(((u14.p1!=1)||(u14.p8!=1))||((u2.p22!=1)||(u14.p65!=1)))"
Reverse transition relation is NOT exact ! Due to transitions t235, t236, t239, t240, t243, t244, t247, t248, t251, t252, t255, t256, t259, t260, t263, t26...734
Computing Next relation with stutter on 34850 deadlock states
83 unique states visited
83 strongly connected components in search stack
84 transitions explored
83 items max in DFS search stack
282 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.84774,86844,1,0,144524,1556,4397,245605,384,11971,369375
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-07a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutonomousCar-PT-07a-LTLFireability-14 finished in 60135 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U (G(p0)&&p1))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 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 69 transition count 364
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 62 transition count 364
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 62 transition count 362
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 18 place count 60 transition count 362
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 54 transition count 314
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 54 transition count 314
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 32 place count 53 transition count 313
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 34 place count 52 transition count 313
Applied a total of 34 rules in 32 ms. Remains 52 /69 variables (removed 17) and now considering 313/371 (removed 58) transitions.
// Phase 1: matrix 313 rows 52 cols
[2022-06-10 23:17:44] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 23:17:44] [INFO ] Implicit Places using invariants in 164 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 167 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/69 places, 313/371 transitions.
Applied a total of 0 rules in 16 ms. Remains 51 /51 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 51/69 places, 313/371 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s16 1) (EQ s23 1) (EQ s26 1) (EQ s33 1) (EQ s38 1) (EQ s41 1) (EQ s48 1)), p0:(AND (EQ s11 1) (EQ s16 1) (EQ s23 1) (EQ s26 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-15 finished in 354 ms.
All properties solved by simple procedures.
Total runtime 103462 ms.
BK_STOP 1654903064519
--------------------
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-07a"
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-07a, 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-165463873000508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-07a.tgz
mv AutonomousCar-PT-07a 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 '
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 ;