Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 110K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716306422821

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 15:47:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 15:47:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:47:05] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-21 15:47:05] [INFO ] Transformed 221 places.
[2024-05-21 15:47:05] [INFO ] Transformed 368 transitions.
[2024-05-21 15:47:05] [INFO ] Found NUPN structural information;
[2024-05-21 15:47:05] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutonomousCar-PT-04b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 191 transition count 338
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 191 transition count 338
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 124 place count 191 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 129 place count 186 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 134 place count 186 transition count 269
Applied a total of 134 rules in 69 ms. Remains 186 /221 variables (removed 35) and now considering 269/368 (removed 99) transitions.
// Phase 1: matrix 269 rows 186 cols
[2024-05-21 15:47:06] [INFO ] Computed 9 invariants in 22 ms
[2024-05-21 15:47:06] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-21 15:47:06] [INFO ] Invariant cache hit.
[2024-05-21 15:47:06] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2024-05-21 15:47:06] [INFO ] Invariant cache hit.
[2024-05-21 15:47:06] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/221 places, 269/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 922 ms. Remains : 186/221 places, 269/368 transitions.
Support contains 38 out of 186 places after structural reductions.
[2024-05-21 15:47:07] [INFO ] Flatten gal took : 76 ms
[2024-05-21 15:47:07] [INFO ] Flatten gal took : 32 ms
[2024-05-21 15:47:07] [INFO ] Input system was already deterministic with 269 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 712 ms. (steps per millisecond=14 ) properties (out of 28) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2024-05-21 15:47:09] [INFO ] Invariant cache hit.
[2024-05-21 15:47:09] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 15:47:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 15:47:09] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-21 15:47:09] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-21 15:47:09] [INFO ] After 439ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 269/269 transitions.
Graph (trivial) has 171 edges and 186 vertex of which 4 / 186 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 525 edges and 184 vertex of which 180 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 180 transition count 195
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 93 rules applied. Total rules applied 163 place count 114 transition count 168
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 179 place count 98 transition count 168
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 179 place count 98 transition count 161
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 193 place count 91 transition count 161
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 197 place count 87 transition count 157
Iterating global reduction 3 with 4 rules applied. Total rules applied 201 place count 87 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 86 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 86 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 86 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 206 place count 85 transition count 151
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 280 place count 48 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 281 place count 48 transition count 113
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 288 place count 41 transition count 84
Iterating global reduction 6 with 7 rules applied. Total rules applied 295 place count 41 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 297 place count 41 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 299 place count 40 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 301 place count 39 transition count 94
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 305 place count 39 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 309 place count 35 transition count 90
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 310 place count 35 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 311 place count 34 transition count 89
Applied a total of 311 rules in 100 ms. Remains 34 /186 variables (removed 152) and now considering 89/269 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 34/186 places, 89/269 transitions.
Finished random walk after 553 steps, including 23 resets, run visited all 2 properties in 6 ms. (steps per millisecond=92 )
Parikh walk visited 0 properties in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA AutonomousCar-PT-04b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 36 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 269/269 transitions.
Graph (trivial) has 174 edges and 186 vertex of which 4 / 186 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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 183 transition count 197
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 96 rules applied. Total rules applied 166 place count 114 transition count 170
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 182 place count 98 transition count 170
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 182 place count 98 transition count 164
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 194 place count 92 transition count 164
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 198 place count 88 transition count 160
Iterating global reduction 3 with 4 rules applied. Total rules applied 202 place count 88 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 203 place count 87 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 204 place count 87 transition count 156
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 206 place count 87 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 207 place count 86 transition count 154
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 281 place count 49 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 282 place count 49 transition count 115
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 290 place count 41 transition count 82
Iterating global reduction 6 with 8 rules applied. Total rules applied 298 place count 41 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 301 place count 41 transition count 79
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 305 place count 39 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 307 place count 38 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 309 place count 36 transition count 88
Applied a total of 309 rules in 55 ms. Remains 36 /186 variables (removed 150) and now considering 88/269 (removed 181) transitions.
// Phase 1: matrix 88 rows 36 cols
[2024-05-21 15:47:10] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 15:47:10] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 15:47:10] [INFO ] Invariant cache hit.
[2024-05-21 15:47:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 15:47:10] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [31, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 247 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/186 places, 88/269 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 33 transition count 87
Applied a total of 2 rules in 9 ms. Remains 33 /34 variables (removed 1) and now considering 87/88 (removed 1) transitions.
// Phase 1: matrix 87 rows 33 cols
[2024-05-21 15:47:10] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 15:47:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 15:47:10] [INFO ] Invariant cache hit.
[2024-05-21 15:47:10] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 15:47:10] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/186 places, 87/269 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 496 ms. Remains : 33/186 places, 87/269 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 316 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 18717 reset in 426 ms.
Product exploration explored 100000 steps with 18732 reset in 272 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Computed a total of 4 stabilizing places and 6 stable transitions
Detected a total of 4/33 stabilizing places and 6/87 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 210 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-21 15:47:12] [INFO ] Invariant cache hit.
[2024-05-21 15:47:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 15:47:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:47:12] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 15:47:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:47:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 15:47:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:47:12] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-21 15:47:12] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 15:47:12] [INFO ] [Nat]Added 35 Read/Feed constraints in 5 ms returned sat
[2024-05-21 15:47:12] [INFO ] Computed and/alt/rep : 16/57/16 causal constraints (skipped 66 transitions) in 13 ms.
[2024-05-21 15:47:12] [INFO ] Added : 0 causal constraints over 0 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 87/87 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-21 15:47:12] [INFO ] Invariant cache hit.
[2024-05-21 15:47:12] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 15:47:12] [INFO ] Invariant cache hit.
[2024-05-21 15:47:12] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 15:47:12] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-21 15:47:12] [INFO ] Redundant transitions in 15 ms returned [28]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 86 rows 33 cols
[2024-05-21 15:47:12] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 15:47:12] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/33 places, 86/87 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 31 transition count 84
Applied a total of 2 rules in 6 ms. Remains 31 /33 variables (removed 2) and now considering 84/86 (removed 2) transitions.
// Phase 1: matrix 84 rows 31 cols
[2024-05-21 15:47:12] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 15:47:12] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 15:47:12] [INFO ] Invariant cache hit.
[2024-05-21 15:47:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 15:47:12] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/33 places, 84/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 426 ms. Remains : 31/33 places, 84/87 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/31 stabilizing places and 5/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-21 15:47:13] [INFO ] Invariant cache hit.
[2024-05-21 15:47:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 15:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:47:13] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 15:47:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:47:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 15:47:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:47:13] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-21 15:47:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 15:47:13] [INFO ] [Nat]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-21 15:47:13] [INFO ] Computed and/alt/rep : 12/53/12 causal constraints (skipped 68 transitions) in 22 ms.
[2024-05-21 15:47:13] [INFO ] Added : 0 causal constraints over 0 iterations in 43 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20672 reset in 171 ms.
Product exploration explored 100000 steps with 20573 reset in 223 ms.
Built C files in :
/tmp/ltsmin18080103347122073679
[2024-05-21 15:47:14] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2024-05-21 15:47:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:47:14] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2024-05-21 15:47:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:47:14] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2024-05-21 15:47:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:47:14] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18080103347122073679
Running compilation step : cd /tmp/ltsmin18080103347122073679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 485 ms.
Running link step : cd /tmp/ltsmin18080103347122073679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin18080103347122073679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13965274950890901824.hoa' '--buchi-type=spotba'
LTSmin run took 236 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-04b-LTLFireability-01 finished in 5053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(F(p1) U p2))))'
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 269/269 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 181 transition count 264
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 180 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 180 transition count 263
Applied a total of 12 rules in 13 ms. Remains 180 /186 variables (removed 6) and now considering 263/269 (removed 6) transitions.
// Phase 1: matrix 263 rows 180 cols
[2024-05-21 15:47:15] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 15:47:15] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 15:47:15] [INFO ] Invariant cache hit.
[2024-05-21 15:47:15] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-05-21 15:47:15] [INFO ] Invariant cache hit.
[2024-05-21 15:47:15] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/186 places, 263/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 180/186 places, 263/269 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s64 1), p2:(EQ s124 1), p1:(NEQ s122 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-03 finished in 819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(G(!p0)&&(p1 U (p2||G(p1)))))))'
Support contains 7 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 269/269 transitions.
Graph (trivial) has 161 edges and 186 vertex of which 4 / 186 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.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 184 transition count 198
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 94 rules applied. Total rules applied 164 place count 115 transition count 173
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 180 place count 100 transition count 172
Reduce places removed 1 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 3 rules applied. Total rules applied 183 place count 99 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 184 place count 98 transition count 170
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 184 place count 98 transition count 165
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 194 place count 93 transition count 165
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 200 place count 87 transition count 159
Iterating global reduction 5 with 6 rules applied. Total rules applied 206 place count 87 transition count 159
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 206 place count 87 transition count 158
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 208 place count 86 transition count 158
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 209 place count 85 transition count 154
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 85 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 212 place count 85 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 213 place count 84 transition count 152
Performed 31 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 275 place count 53 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 276 place count 53 transition count 119
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 281 place count 48 transition count 101
Iterating global reduction 8 with 5 rules applied. Total rules applied 286 place count 48 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 289 place count 48 transition count 98
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 9 with 4 rules applied. Total rules applied 293 place count 46 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 295 place count 45 transition count 109
Applied a total of 295 rules in 52 ms. Remains 45 /186 variables (removed 141) and now considering 109/269 (removed 160) transitions.
// Phase 1: matrix 109 rows 45 cols
[2024-05-21 15:47:16] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 15:47:16] [INFO ] Implicit Places using invariants in 76 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/186 places, 109/269 transitions.
Applied a total of 0 rules in 6 ms. Remains 44 /44 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 44/186 places, 109/269 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s8 1), p2:(AND (NOT (AND (EQ s11 1) (EQ s18 1) (EQ s24 1) (EQ s33 1) (EQ s38 1))) (NEQ s6 1)), p1:(NEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-05 TRUE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-05 finished in 194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1||F(p0)))||G(p2))))'
Support contains 7 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 269/269 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 181 transition count 264
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 181 transition count 264
Applied a total of 10 rules in 7 ms. Remains 181 /186 variables (removed 5) and now considering 264/269 (removed 5) transitions.
// Phase 1: matrix 264 rows 181 cols
[2024-05-21 15:47:16] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 15:47:16] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 15:47:16] [INFO ] Invariant cache hit.
[2024-05-21 15:47:16] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-05-21 15:47:16] [INFO ] Invariant cache hit.
[2024-05-21 15:47:16] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/186 places, 264/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 481 ms. Remains : 181/186 places, 264/269 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s6 1) (EQ s118 1) (EQ s145 1)), p1:(AND (EQ s4 1) (EQ s11 1) (EQ s30 1) (EQ s145 1)), p2:(EQ s165 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-07 finished in 759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 269/269 transitions.
Graph (trivial) has 170 edges and 186 vertex of which 4 / 186 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 183 transition count 198
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 95 rules applied. Total rules applied 164 place count 115 transition count 171
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 180 place count 99 transition count 171
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 180 place count 99 transition count 164
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 194 place count 92 transition count 164
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 199 place count 87 transition count 159
Iterating global reduction 3 with 5 rules applied. Total rules applied 204 place count 87 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 205 place count 86 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 86 transition count 155
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 208 place count 86 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 85 transition count 153
Performed 34 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 277 place count 51 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 278 place count 51 transition count 117
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 284 place count 45 transition count 93
Iterating global reduction 6 with 6 rules applied. Total rules applied 290 place count 45 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 292 place count 45 transition count 91
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 296 place count 43 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 298 place count 42 transition count 102
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 299 place count 42 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 300 place count 41 transition count 101
Applied a total of 300 rules in 55 ms. Remains 41 /186 variables (removed 145) and now considering 101/269 (removed 168) transitions.
// Phase 1: matrix 101 rows 41 cols
[2024-05-21 15:47:17] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 15:47:17] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 15:47:17] [INFO ] Invariant cache hit.
[2024-05-21 15:47:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:47:17] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [36, 40]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 146 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/186 places, 101/269 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 38 transition count 100
Applied a total of 2 rules in 5 ms. Remains 38 /39 variables (removed 1) and now considering 100/101 (removed 1) transitions.
// Phase 1: matrix 100 rows 38 cols
[2024-05-21 15:47:17] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 15:47:17] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 15:47:17] [INFO ] Invariant cache hit.
[2024-05-21 15:47:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:47:17] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/186 places, 100/269 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 364 ms. Remains : 38/186 places, 100/269 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s3 1) (EQ s19 1) (EQ s33 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-08 finished in 421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F((X(p1)||(p1 U p2)))))'
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 269/269 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 180 transition count 263
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 180 transition count 263
Applied a total of 12 rules in 4 ms. Remains 180 /186 variables (removed 6) and now considering 263/269 (removed 6) transitions.
// Phase 1: matrix 263 rows 180 cols
[2024-05-21 15:47:17] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 15:47:17] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 15:47:17] [INFO ] Invariant cache hit.
[2024-05-21 15:47:17] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-05-21 15:47:17] [INFO ] Invariant cache hit.
[2024-05-21 15:47:17] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/186 places, 263/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 495 ms. Remains : 180/186 places, 263/269 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(EQ s173 1), p1:(EQ s112 1), p0:(EQ s165 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-09 finished in 632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (!p0 U (p1&&X(!p2)))))'
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 269/269 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 181 transition count 264
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 180 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 180 transition count 263
Applied a total of 12 rules in 6 ms. Remains 180 /186 variables (removed 6) and now considering 263/269 (removed 6) transitions.
// Phase 1: matrix 263 rows 180 cols
[2024-05-21 15:47:18] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 15:47:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 15:47:18] [INFO ] Invariant cache hit.
[2024-05-21 15:47:18] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-21 15:47:18] [INFO ] Invariant cache hit.
[2024-05-21 15:47:18] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/186 places, 263/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 500 ms. Remains : 180/186 places, 263/269 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) p2), (NOT p0), (OR (NOT p1) p2), p2, p2, true, p2]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 5}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p0 p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 5}]], initial=0, aps=[p1:(NEQ s106 1), p0:(NEQ s141 1), p2:(AND (EQ s4 1) (EQ s12 1) (EQ s95 1) (EQ s146 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 217 ms.
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Computed a total of 33 stabilizing places and 34 stable transitions
Computed a total of 33 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (AND p1 p0)), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p0 p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 25 factoid took 345 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-04b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04b-LTLFireability-10 finished in 1582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(!p1)||G(!p2)) U X((p3||X(p2)))))'
Support contains 8 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 269/269 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 180 transition count 263
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 179 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 179 transition count 262
Applied a total of 14 rules in 7 ms. Remains 179 /186 variables (removed 7) and now considering 262/269 (removed 7) transitions.
// Phase 1: matrix 262 rows 179 cols
[2024-05-21 15:47:19] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 15:47:19] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 15:47:19] [INFO ] Invariant cache hit.
[2024-05-21 15:47:19] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-21 15:47:19] [INFO ] Invariant cache hit.
[2024-05-21 15:47:20] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/186 places, 262/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 179/186 places, 262/269 transitions.
Stuttering acceptance computed with spot in 439 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, (AND p1 (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), false, (AND p1 (NOT p2) (NOT p3)), false, (AND p1 (NOT p2)), (AND p1 p2), p1]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 7}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=2 dest: 8}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 10}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND p1 p2), acceptance={} source=9 dest: 10}], [{ cond=p1, acceptance={0} source=10 dest: 10}]], initial=0, aps=[p0:(EQ s170 1), p1:(AND (EQ s4 1) (EQ s13 1) (EQ s114 1) (EQ s145 1)), p2:(AND (EQ s4 1) (EQ s6 1) (EQ s95 1) (EQ s145 1)), p3:(AND (EQ s4 1) (EQ s12 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-12 finished in 913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 269/269 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 180 transition count 263
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 179 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 179 transition count 262
Applied a total of 14 rules in 7 ms. Remains 179 /186 variables (removed 7) and now considering 262/269 (removed 7) transitions.
[2024-05-21 15:47:20] [INFO ] Invariant cache hit.
[2024-05-21 15:47:20] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-21 15:47:20] [INFO ] Invariant cache hit.
[2024-05-21 15:47:20] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-05-21 15:47:20] [INFO ] Invariant cache hit.
[2024-05-21 15:47:21] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/186 places, 262/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 179/186 places, 262/269 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s32 0) (EQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-14 finished in 669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 269/269 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 181 transition count 264
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 180 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 180 transition count 263
Applied a total of 12 rules in 4 ms. Remains 180 /186 variables (removed 6) and now considering 263/269 (removed 6) transitions.
// Phase 1: matrix 263 rows 180 cols
[2024-05-21 15:47:21] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 15:47:21] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 15:47:21] [INFO ] Invariant cache hit.
[2024-05-21 15:47:21] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-21 15:47:21] [INFO ] Invariant cache hit.
[2024-05-21 15:47:21] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/186 places, 263/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 180/186 places, 263/269 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s121 1), p0:(EQ s50 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-15 finished in 699 ms.
All properties solved by simple procedures.
Total runtime 16493 ms.

BK_STOP 1716306442936

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-04b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is AutonomousCar-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180300173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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