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-165463872900420.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-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872900420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 9.0K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 15:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 15:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 3 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 3 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Jun 7 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 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 31K 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-01b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654898009381

Running Version 202205111006
[2022-06-10 21:53:31] [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 21:53:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 21:53:32] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2022-06-10 21:53:32] [INFO ] Transformed 119 places.
[2022-06-10 21:53:32] [INFO ] Transformed 132 transitions.
[2022-06-10 21:53:32] [INFO ] Found NUPN structural information;
[2022-06-10 21:53:32] [INFO ] Parsed PT model containing 119 places and 132 transitions in 399 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA AutonomousCar-PT-01b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 103 transition count 116
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 103 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 103 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 101 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 101 transition count 110
Applied a total of 40 rules in 55 ms. Remains 101 /119 variables (removed 18) and now considering 110/132 (removed 22) transitions.
// Phase 1: matrix 110 rows 101 cols
[2022-06-10 21:53:32] [INFO ] Computed 6 place invariants in 14 ms
[2022-06-10 21:53:33] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 110 rows 101 cols
[2022-06-10 21:53:33] [INFO ] Computed 6 place invariants in 6 ms
[2022-06-10 21:53:33] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 101 cols
[2022-06-10 21:53:33] [INFO ] Computed 6 place invariants in 3 ms
[2022-06-10 21:53:33] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/119 places, 110/132 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/119 places, 110/132 transitions.
Support contains 27 out of 101 places after structural reductions.
[2022-06-10 21:53:34] [INFO ] Flatten gal took : 71 ms
[2022-06-10 21:53:34] [INFO ] Flatten gal took : 34 ms
[2022-06-10 21:53:34] [INFO ] Input system was already deterministic with 110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=13 ) properties (out of 23) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 110 rows 101 cols
[2022-06-10 21:53:36] [INFO ] Computed 6 place invariants in 9 ms
[2022-06-10 21:53:36] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-10 21:53:36] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-06-10 21:53:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-06-10 21:53:36] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-06-10 21:53:36] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-06-10 21:53:36] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 101/101 places, 110/110 transitions.
Graph (trivial) has 91 edges and 101 vertex of which 4 / 101 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 176 edges and 99 vertex of which 95 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 95 transition count 65
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 51 rules applied. Total rules applied 92 place count 58 transition count 51
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 100 place count 50 transition count 51
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 100 place count 50 transition count 43
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 116 place count 42 transition count 43
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 39 transition count 40
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 39 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 38 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 38 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 126 place count 38 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 127 place count 37 transition count 37
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 159 place count 21 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 160 place count 21 transition count 20
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 161 place count 20 transition count 18
Iterating global reduction 6 with 1 rules applied. Total rules applied 162 place count 20 transition count 18
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 6 with 2 rules applied. Total rules applied 164 place count 19 transition count 17
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 166 place count 19 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 18 transition count 16
Applied a total of 167 rules in 67 ms. Remains 18 /101 variables (removed 83) and now considering 16/110 (removed 94) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/101 places, 16/110 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 26 stabilizing places and 27 stable transitions
FORMULA AutonomousCar-PT-01b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(G(X((G(p0) U !p1))))||p2))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 110/110 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 98 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 98 transition count 107
Applied a total of 6 rules in 11 ms. Remains 98 /101 variables (removed 3) and now considering 107/110 (removed 3) transitions.
// Phase 1: matrix 107 rows 98 cols
[2022-06-10 21:53:36] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:36] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 107 rows 98 cols
[2022-06-10 21:53:36] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:53:37] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 98 cols
[2022-06-10 21:53:37] [INFO ] Computed 6 place invariants in 4 ms
[2022-06-10 21:53:37] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/101 places, 107/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/101 places, 107/110 transitions.
Stuttering acceptance computed with spot in 608 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(EQ s81 1), p1:(OR (EQ s65 1) (EQ s14 1)), p0:(EQ s65 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 488 ms.
Product exploration explored 100000 steps with 0 reset in 368 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Detected a total of 24/98 stabilizing places and 25/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 612 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 107 rows 98 cols
[2022-06-10 21:53:39] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:39] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))), (F (AND p1 p0 (NOT p2))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 11 factoid took 799 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 170 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2) (NOT p1)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 167 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2) (NOT p1)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 107/107 transitions.
Graph (trivial) has 86 edges and 98 vertex of which 2 / 98 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 96 transition count 70
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 45 rules applied. Total rules applied 81 place count 61 transition count 60
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 87 place count 55 transition count 60
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 87 place count 55 transition count 51
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 105 place count 46 transition count 51
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 139 place count 29 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 29 transition count 32
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 143 place count 26 transition count 28
Iterating global reduction 4 with 3 rules applied. Total rules applied 146 place count 26 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 147 place count 26 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 151 place count 24 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 24 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 154 place count 22 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 155 place count 21 transition count 23
Applied a total of 155 rules in 35 ms. Remains 21 /98 variables (removed 77) and now considering 23/107 (removed 84) transitions.
// Phase 1: matrix 23 rows 21 cols
[2022-06-10 21:53:41] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 21:53:41] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 23 rows 21 cols
[2022-06-10 21:53:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:53:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:53:41] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 156 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/98 places, 23/107 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 22
Applied a total of 2 rules in 8 ms. Remains 18 /19 variables (removed 1) and now considering 22/23 (removed 1) transitions.
// Phase 1: matrix 22 rows 18 cols
[2022-06-10 21:53:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:53:41] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 22 rows 18 cols
[2022-06-10 21:53:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:53:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:53:41] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/98 places, 22/107 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/98 places, 22/107 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/18 stabilizing places and 4/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 388 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) p0 (NOT p1)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Finished random walk after 4 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (F (AND (NOT p2) p0)), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 668 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 244 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) p0 (NOT p1)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 173 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) p0 (NOT p1)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 170 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) p0 (NOT p1)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 1 reset in 310 ms.
Stuttering criterion allowed to conclude after 75 steps with 8 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-00 finished in 6601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(p0)'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 110/110 transitions.
Graph (trivial) has 92 edges and 101 vertex of which 4 / 101 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 98 transition count 70
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 46 rules applied. Total rules applied 84 place count 61 transition count 61
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 90 place count 56 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 55 transition count 60
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 91 place count 55 transition count 52
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 107 place count 47 transition count 52
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 111 place count 43 transition count 48
Iterating global reduction 4 with 4 rules applied. Total rules applied 115 place count 43 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 115 place count 43 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 42 transition count 47
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 118 place count 41 transition count 46
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 41 transition count 46
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 153 place count 24 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 154 place count 24 transition count 26
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 156 place count 22 transition count 23
Iterating global reduction 5 with 2 rules applied. Total rules applied 158 place count 22 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 162 place count 20 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 164 place count 18 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 165 place count 17 transition count 19
Applied a total of 165 rules in 40 ms. Remains 17 /101 variables (removed 84) and now considering 19/110 (removed 91) transitions.
// Phase 1: matrix 19 rows 17 cols
[2022-06-10 21:53:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:53:43] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 19 rows 17 cols
[2022-06-10 21:53:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:53:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:53:43] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [12, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 121 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/101 places, 19/110 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 18
Applied a total of 2 rules in 3 ms. Remains 14 /15 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 14 cols
[2022-06-10 21:53:43] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 21:53:43] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 18 rows 14 cols
[2022-06-10 21:53:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 21:53:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:53:43] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/101 places, 18/110 transitions.
Finished structural reductions, in 2 iterations. Remains : 14/101 places, 18/110 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-02 finished in 411 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)&&X(F(G(p1)))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 110/110 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 96 transition count 105
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 95 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 95 transition count 104
Applied a total of 12 rules in 22 ms. Remains 95 /101 variables (removed 6) and now considering 104/110 (removed 6) transitions.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:43] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:44] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:44] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/101 places, 104/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/101 places, 104/110 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s35 1), p1:(EQ s38 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-03 finished in 488 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(F((!(p1 U !p1)&&F(p2)))))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 110/110 transitions.
Graph (trivial) has 88 edges and 101 vertex of which 4 / 101 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 98 transition count 71
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 46 rules applied. Total rules applied 83 place count 62 transition count 61
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 91 place count 56 transition count 59
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 95 place count 54 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 53 transition count 57
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 96 place count 53 transition count 50
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 110 place count 46 transition count 50
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 114 place count 42 transition count 46
Iterating global reduction 5 with 4 rules applied. Total rules applied 118 place count 42 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 118 place count 42 transition count 45
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 120 place count 41 transition count 45
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 121 place count 40 transition count 44
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 40 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 123 place count 40 transition count 43
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 151 place count 26 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 152 place count 26 transition count 27
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 154 place count 24 transition count 24
Iterating global reduction 7 with 2 rules applied. Total rules applied 156 place count 24 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 160 place count 22 transition count 22
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 162 place count 22 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 164 place count 20 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 165 place count 19 transition count 20
Applied a total of 165 rules in 37 ms. Remains 19 /101 variables (removed 82) and now considering 20/110 (removed 90) transitions.
// Phase 1: matrix 20 rows 19 cols
[2022-06-10 21:53:44] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:53:44] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 20 rows 19 cols
[2022-06-10 21:53:44] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:53:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:53:44] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [12, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 97 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/101 places, 20/110 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 19
Applied a total of 2 rules in 3 ms. Remains 16 /17 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 16 cols
[2022-06-10 21:53:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 21:53:44] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 19 rows 16 cols
[2022-06-10 21:53:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 21:53:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:53:44] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/101 places, 19/110 transitions.
Finished structural reductions, in 2 iterations. Remains : 16/101 places, 19/110 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s3 1), p2:(EQ s3 0), p1:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-06 finished in 502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G((G(p0)||X(p1)))))&&G(F(p2)))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 96 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 96 transition count 105
Applied a total of 10 rules in 17 ms. Remains 96 /101 variables (removed 5) and now considering 105/110 (removed 5) transitions.
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:44] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:44] [INFO ] Computed 6 place invariants in 3 ms
[2022-06-10 21:53:45] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:45] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:53:45] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/101 places, 105/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/101 places, 105/110 transitions.
Stuttering acceptance computed with spot in 487 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s76 0), p2:(EQ s27 1), p1:(OR (EQ s4 0) (EQ s10 0) (EQ s62 0) (EQ s84 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-07 finished in 921 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)&&p1)))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 110/110 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 96 transition count 105
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 95 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 95 transition count 104
Applied a total of 12 rules in 9 ms. Remains 95 /101 variables (removed 6) and now considering 104/110 (removed 6) transitions.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:45] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:45] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:45] [INFO ] Computed 6 place invariants in 4 ms
[2022-06-10 21:53:46] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/101 places, 104/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/101 places, 104/110 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (NEQ s4 1) (NEQ s6 1) (NEQ s33 1) (NEQ s61 1)), p0:(NEQ s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 294 ms.
Product exploration explored 100000 steps with 25000 reset in 282 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:47] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:47] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-10 21:53:47] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 104/104 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:48] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:48] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:48] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:48] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:48] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:48] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 104/104 transitions.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 49 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 203 ms.
Product exploration explored 100000 steps with 25000 reset in 217 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 104/104 transitions.
Graph (trivial) has 85 edges and 95 vertex of which 4 / 95 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 93 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 41 place count 93 transition count 97
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 41 place count 93 transition count 98
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 50 place count 93 transition count 98
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 78 place count 65 transition count 70
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 106 place count 65 transition count 70
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 130 place count 65 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 132 place count 65 transition count 72
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 150 place count 47 transition count 53
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 18 rules applied. Total rules applied 168 place count 47 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 170 place count 47 transition count 51
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 45 transition count 49
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 45 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 45 transition count 55
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 176 rules in 27 ms. Remains 45 /95 variables (removed 50) and now considering 55/104 (removed 49) transitions.
[2022-06-10 21:53:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 45 cols
[2022-06-10 21:53:50] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 21:53:50] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/95 places, 55/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/95 places, 55/104 transitions.
Product exploration explored 100000 steps with 25000 reset in 411 ms.
Product exploration explored 100000 steps with 25000 reset in 370 ms.
Built C files in :
/tmp/ltsmin14029439137667051658
[2022-06-10 21:53:51] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14029439137667051658
Running compilation step : cd /tmp/ltsmin14029439137667051658;'/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 508 ms.
Running link step : cd /tmp/ltsmin14029439137667051658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin14029439137667051658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1158991429639757893.hoa' '--buchi-type=spotba'
LTSmin run took 189 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLFireability-11 finished in 6546 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(G(X(F((G(!p0)||F(p1))))) U p2))&&F(p1)))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 96 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 96 transition count 105
Applied a total of 10 rules in 3 ms. Remains 96 /101 variables (removed 5) and now considering 105/110 (removed 5) transitions.
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:52] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:52] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:52] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:53:52] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:52] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:52] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/101 places, 105/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/101 places, 105/110 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p1) p2), (NOT p1), p2, true, (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}, { cond=p1, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s5 1), p2:(EQ s29 1), p0:(NEQ s59 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 93 ms.
Product exploration explored 100000 steps with 43 reset in 101 ms.
Computed a total of 25 stabilizing places and 26 stable transitions
Computed a total of 25 stabilizing places and 26 stable transitions
Detected a total of 25/96 stabilizing places and 26/105 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 390 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) p2), (NOT p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (OR (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:54] [INFO ] Computed 6 place invariants in 3 ms
[2022-06-10 21:53:54] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-06-10 21:53:54] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:53:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-10 21:53:54] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 21:53:54] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
[2022-06-10 21:53:54] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2022-06-10 21:53:54] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 3 ms to minimize.
[2022-06-10 21:53:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 291 ms
[2022-06-10 21:53:54] [INFO ] After 347ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-06-10 21:53:54] [INFO ] After 411ms 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) (NOT p2) p0), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p2 (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F p1), (F p2)]
Knowledge based reduction with 9 factoid took 601 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) p2), (NOT p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) p2), (NOT p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (OR (NOT p0) p1)]
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:55] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:55] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-06-10 21:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 21:53:56] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-06-10 21:53:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 21:53:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-10 21:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 21:53:56] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-06-10 21:53:56] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2022-06-10 21:53:56] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2022-06-10 21:53:56] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2022-06-10 21:53:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 170 ms
[2022-06-10 21:53:56] [INFO ] Computed and/alt/rep : 103/175/103 causal constraints (skipped 1 transitions) in 14 ms.
[2022-06-10 21:53:56] [INFO ] Added : 89 causal constraints over 19 iterations in 363 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 105/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:56] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:56] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:56] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:56] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:56] [INFO ] Computed 6 place invariants in 3 ms
[2022-06-10 21:53:57] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 105/105 transitions.
Computed a total of 25 stabilizing places and 26 stable transitions
Computed a total of 25 stabilizing places and 26 stable transitions
Detected a total of 25/96 stabilizing places and 26/105 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 326 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p1) p2), (NOT p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (OR (NOT p0) p1)]
Finished random walk after 138 steps, including 3 resets, run visited all 4 properties in 8 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F p1), (F (NOT p0)), (F p2)]
Knowledge based reduction with 7 factoid took 512 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) p2), (NOT p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) p2), (NOT p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (OR (NOT p0) p1)]
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:53:58] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:58] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-10 21:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 21:53:58] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-06-10 21:53:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 21:53:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-06-10 21:53:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 21:53:59] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-06-10 21:53:59] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2022-06-10 21:53:59] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2022-06-10 21:53:59] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-06-10 21:53:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 174 ms
[2022-06-10 21:53:59] [INFO ] Computed and/alt/rep : 103/175/103 causal constraints (skipped 1 transitions) in 9 ms.
[2022-06-10 21:53:59] [INFO ] Added : 89 causal constraints over 19 iterations in 223 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) p2), (NOT p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 1 reset in 86 ms.
Product exploration explored 100000 steps with 4 reset in 141 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) p2), (NOT p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (OR (NOT p0) p1)]
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 105/105 transitions.
Graph (trivial) has 80 edges and 96 vertex of which 4 / 96 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 94 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 94 transition count 98
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 40 place count 94 transition count 99
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 50 place count 94 transition count 99
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 78 place count 66 transition count 71
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 106 place count 66 transition count 71
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 128 place count 66 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 66 transition count 72
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 146 place count 50 transition count 55
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 162 place count 50 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 163 place count 50 transition count 54
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 164 place count 49 transition count 53
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 49 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 49 transition count 55
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 166 rules in 64 ms. Remains 49 /96 variables (removed 47) and now considering 55/105 (removed 50) transitions.
[2022-06-10 21:54:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 49 cols
[2022-06-10 21:54:00] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-10 21:54:00] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/96 places, 55/105 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/96 places, 55/105 transitions.
Product exploration explored 100000 steps with 23 reset in 150 ms.
Product exploration explored 100000 steps with 21 reset in 120 ms.
Built C files in :
/tmp/ltsmin11496499066937202140
[2022-06-10 21:54:00] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11496499066937202140
Running compilation step : cd /tmp/ltsmin11496499066937202140;'/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 242 ms.
Running link step : cd /tmp/ltsmin11496499066937202140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11496499066937202140;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased459538296936390760.hoa' '--buchi-type=spotba'
LTSmin run took 477 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLFireability-13 finished in 9294 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(F(p0)))&&X(X(F(p1))))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 110/110 transitions.
Graph (trivial) has 90 edges and 101 vertex of which 4 / 101 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 98 transition count 71
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 48 rules applied. Total rules applied 85 place count 62 transition count 59
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 92 place count 55 transition count 59
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 92 place count 55 transition count 52
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 106 place count 48 transition count 52
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 110 place count 44 transition count 48
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 44 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 114 place count 44 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 43 transition count 47
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 42 transition count 46
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 42 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 42 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 41 transition count 44
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 151 place count 26 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 152 place count 26 transition count 27
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 154 place count 24 transition count 24
Iterating global reduction 6 with 2 rules applied. Total rules applied 156 place count 24 transition count 24
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 6 with 4 rules applied. Total rules applied 160 place count 22 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 162 place count 20 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 163 place count 19 transition count 20
Applied a total of 163 rules in 13 ms. Remains 19 /101 variables (removed 82) and now considering 20/110 (removed 90) transitions.
// Phase 1: matrix 20 rows 19 cols
[2022-06-10 21:54:01] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:54:01] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 20 rows 19 cols
[2022-06-10 21:54:01] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:54:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 21:54:01] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [12, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 65 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/101 places, 20/110 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 16 transition count 19
Applied a total of 2 rules in 1 ms. Remains 16 /17 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 16 cols
[2022-06-10 21:54:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 21:54:01] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 19 rows 16 cols
[2022-06-10 21:54:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 21:54:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:54:01] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/101 places, 19/110 transitions.
Finished structural reductions, in 2 iterations. Remains : 16/101 places, 19/110 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s15 1), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-14 finished in 302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 110/110 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 96 transition count 105
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 95 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 95 transition count 104
Applied a total of 12 rules in 3 ms. Remains 95 /101 variables (removed 6) and now considering 104/110 (removed 6) transitions.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:54:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:54:01] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:54:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:54:02] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:54:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:54:02] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/101 places, 104/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/101 places, 104/110 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s93 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-15 finished in 496 ms.
All properties solved by simple procedures.
Total runtime 30518 ms.

BK_STOP 1654898042623

--------------------
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-01b"
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-01b, 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-165463872900420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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