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-171620180300198.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-07a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180300198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 12 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 276K 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-07a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716308172648

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-07a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 16:16:15] [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 16:16:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:16:15] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-05-21 16:16:15] [INFO ] Transformed 73 places.
[2024-05-21 16:16:15] [INFO ] Transformed 593 transitions.
[2024-05-21 16:16:15] [INFO ] Found NUPN structural information;
[2024-05-21 16:16:15] [INFO ] Parsed PT model containing 73 places and 593 transitions and 5357 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
FORMULA AutonomousCar-PT-07a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 371
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 371
Applied a total of 4 rules in 33 ms. Remains 71 /73 variables (removed 2) and now considering 371/380 (removed 9) transitions.
// Phase 1: matrix 371 rows 71 cols
[2024-05-21 16:16:15] [INFO ] Computed 11 invariants in 16 ms
[2024-05-21 16:16:15] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-21 16:16:15] [INFO ] Invariant cache hit.
[2024-05-21 16:16:16] [INFO ] State equation strengthened by 192 read => feed constraints.
[2024-05-21 16:16:16] [INFO ] Implicit Places using invariants and state equation in 268 ms returned [67, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 560 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/73 places, 371/380 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 598 ms. Remains : 69/73 places, 371/380 transitions.
Support contains 40 out of 69 places after structural reductions.
[2024-05-21 16:16:16] [INFO ] Flatten gal took : 123 ms
[2024-05-21 16:16:16] [INFO ] Flatten gal took : 78 ms
[2024-05-21 16:16:16] [INFO ] Input system was already deterministic with 371 transitions.
Incomplete random walk after 10000 steps, including 562 resets, run finished after 868 ms. (steps per millisecond=11 ) properties (out of 29) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 371 rows 69 cols
[2024-05-21 16:16:17] [INFO ] Computed 9 invariants in 9 ms
[2024-05-21 16:16:18] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-21 16:16:18] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-21 16:16:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-21 16:16:19] [INFO ] After 553ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :9
[2024-05-21 16:16:19] [INFO ] State equation strengthened by 192 read => feed constraints.
[2024-05-21 16:16:19] [INFO ] After 403ms SMT Verify possible using 192 Read/Feed constraints in natural domain returned unsat :3 sat :9
[2024-05-21 16:16:20] [INFO ] After 875ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :9
Attempting to minimize the solution found.
Minimization took 398 ms.
[2024-05-21 16:16:20] [INFO ] After 1959ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :9
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 19 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 371/371 transitions.
Graph (complete) has 661 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 68 transition count 363
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 64 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 63 transition count 362
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 63 transition count 359
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 60 transition count 359
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 25 place count 55 transition count 326
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 55 transition count 326
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 3 with 2 rules applied. Total rules applied 32 place count 54 transition count 325
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 54 transition count 319
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 72 place count 48 transition count 291
Applied a total of 72 rules in 114 ms. Remains 48 /69 variables (removed 21) and now considering 291/371 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 48/69 places, 291/371 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 291 rows 48 cols
[2024-05-21 16:16:21] [INFO ] Computed 11 invariants in 6 ms
[2024-05-21 16:16:21] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 16:16:21] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 16:16:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-21 16:16:22] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 16:16:22] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-21 16:16:22] [INFO ] After 171ms SMT Verify possible using 134 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-21 16:16:22] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 160 ms.
[2024-05-21 16:16:22] [INFO ] After 859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 53 ms.
Support contains 9 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 291/291 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 46 transition count 289
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 46 transition count 288
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 13 place count 45 transition count 281
Applied a total of 13 rules in 50 ms. Remains 45 /48 variables (removed 3) and now considering 281/291 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 45/48 places, 281/291 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 281 rows 45 cols
[2024-05-21 16:16:23] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 16:16:23] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 16:16:23] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 16:16:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 16:16:23] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 16:16:23] [INFO ] State equation strengthened by 127 read => feed constraints.
[2024-05-21 16:16:24] [INFO ] After 127ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 16:16:24] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 116 ms.
[2024-05-21 16:16:24] [INFO ] After 661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 32 ms.
Support contains 7 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 281/281 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 44 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 273
Applied a total of 2 rules in 19 ms. Remains 44 /45 variables (removed 1) and now considering 273/281 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 44/45 places, 273/281 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 273 rows 44 cols
[2024-05-21 16:16:24] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 16:16:24] [INFO ] [Real]Absence check using 11 positive place invariants in 63 ms returned sat
[2024-05-21 16:16:25] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 16:16:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 16:16:25] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 16:16:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-21 16:16:25] [INFO ] After 69ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 16:16:25] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-21 16:16:25] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 273/273 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 265
Applied a total of 2 rules in 17 ms. Remains 43 /44 variables (removed 1) and now considering 265/273 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 43/44 places, 265/273 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Finished probabilistic random walk after 651288 steps, run visited all 2 properties in 1190 ms. (steps per millisecond=547 )
Probabilistic random walk after 651288 steps, saw 89614 distinct states, run finished after 1192 ms. (steps per millisecond=546 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA AutonomousCar-PT-07a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 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' '!(G((F(G(p0))&&F(p1))))'
Support contains 13 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 366
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 64 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 63 transition count 365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 63 transition count 363
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 61 transition count 363
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 22 place count 55 transition count 315
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 55 transition count 315
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 3 with 2 rules applied. Total rules applied 30 place count 54 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 53 transition count 314
Applied a total of 32 rules in 50 ms. Remains 53 /69 variables (removed 16) and now considering 314/371 (removed 57) transitions.
// Phase 1: matrix 314 rows 53 cols
[2024-05-21 16:16:27] [INFO ] Computed 9 invariants in 4 ms
[2024-05-21 16:16:27] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 16:16:27] [INFO ] Invariant cache hit.
[2024-05-21 16:16:27] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-21 16:16:27] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-21 16:16:27] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-21 16:16:27] [INFO ] Invariant cache hit.
[2024-05-21 16:16:28] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/69 places, 314/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 650 ms. Remains : 53/69 places, 314/371 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 296 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-00 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s9 0) (EQ s28 0) (EQ s49 0)), p1:(AND (OR (EQ s14 0) (EQ s19 0) (EQ s24 0) (EQ s27 0) (EQ s34 0) (EQ s39 0) (EQ s43 0) (EQ s50 0)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 162 reset in 283 ms.
Product exploration explored 100000 steps with 51 reset in 183 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 632 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :1
Finished Best-First random walk after 3599 steps, including 22 resets, run visited all 1 properties in 6 ms. (steps per millisecond=599 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 13 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 314/314 transitions.
Applied a total of 0 rules in 22 ms. Remains 53 /53 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-21 16:16:29] [INFO ] Invariant cache hit.
[2024-05-21 16:16:29] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 16:16:29] [INFO ] Invariant cache hit.
[2024-05-21 16:16:29] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-21 16:16:29] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-05-21 16:16:29] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-21 16:16:29] [INFO ] Invariant cache hit.
[2024-05-21 16:16:30] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 517 ms. Remains : 53/53 places, 314/314 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 5127 steps, including 336 resets, run visited all 2 properties in 33 ms. (steps per millisecond=155 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 32 reset in 116 ms.
Product exploration explored 100000 steps with 17 reset in 158 ms.
Built C files in :
/tmp/ltsmin12345661997883820640
[2024-05-21 16:16:31] [INFO ] Computing symmetric may disable matrix : 314 transitions.
[2024-05-21 16:16:31] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:16:31] [INFO ] Computing symmetric may enable matrix : 314 transitions.
[2024-05-21 16:16:31] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:16:31] [INFO ] Computing Do-Not-Accords matrix : 314 transitions.
[2024-05-21 16:16:31] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:16:31] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12345661997883820640
Running compilation step : cd /tmp/ltsmin12345661997883820640;'/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 1815 ms.
Running link step : cd /tmp/ltsmin12345661997883820640;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin12345661997883820640;'/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/stateBased3525415241137361111.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 13 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 314/314 transitions.
Applied a total of 0 rules in 20 ms. Remains 53 /53 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-21 16:16:46] [INFO ] Invariant cache hit.
[2024-05-21 16:16:46] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 16:16:46] [INFO ] Invariant cache hit.
[2024-05-21 16:16:46] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-21 16:16:46] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 16:16:46] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-21 16:16:46] [INFO ] Invariant cache hit.
[2024-05-21 16:16:46] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 533 ms. Remains : 53/53 places, 314/314 transitions.
Built C files in :
/tmp/ltsmin9303959910935070708
[2024-05-21 16:16:46] [INFO ] Computing symmetric may disable matrix : 314 transitions.
[2024-05-21 16:16:46] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:16:46] [INFO ] Computing symmetric may enable matrix : 314 transitions.
[2024-05-21 16:16:46] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:16:46] [INFO ] Computing Do-Not-Accords matrix : 314 transitions.
[2024-05-21 16:16:46] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:16:46] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9303959910935070708
Running compilation step : cd /tmp/ltsmin9303959910935070708;'/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 1458 ms.
Running link step : cd /tmp/ltsmin9303959910935070708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9303959910935070708;'/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/stateBased14249412361411908228.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 16:17:02] [INFO ] Flatten gal took : 76 ms
[2024-05-21 16:17:02] [INFO ] Flatten gal took : 62 ms
[2024-05-21 16:17:02] [INFO ] Time to serialize gal into /tmp/LTL9533166955203976735.gal : 11 ms
[2024-05-21 16:17:02] [INFO ] Time to serialize properties into /tmp/LTL1643051307384269501.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9533166955203976735.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15119830088826629137.hoa' '-atoms' '/tmp/LTL1643051307384269501.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1643051307384269501.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15119830088826629137.hoa
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t10, t12, t15, t17, t20, t22, t25, t27, t30, t32, t35, t36, t233, t234, t235, t236, t...1063
Computing Next relation with stutter on 34850 deadlock states
Detected timeout of ITS tools.
[2024-05-21 16:17:17] [INFO ] Flatten gal took : 42 ms
[2024-05-21 16:17:17] [INFO ] Flatten gal took : 38 ms
[2024-05-21 16:17:17] [INFO ] Time to serialize gal into /tmp/LTL8816694219278557667.gal : 8 ms
[2024-05-21 16:17:17] [INFO ] Time to serialize properties into /tmp/LTL2806683903211256821.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8816694219278557667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2806683903211256821.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(((p1==0)||(p10==0))||((p37==0)||(p65==0)))")))&&(F("(((((p17==0)||(p24==0))||((p31==0)||(p35==0)))||(((p45==0)||(p52==0))|...230
Formula 0 simplified : F(GF!"(((p1==0)||(p10==0))||((p37==0)||(p65==0)))" | G!"(((((p17==0)||(p24==0))||((p31==0)||(p35==0)))||(((p45==0)||(p52==0))||((p56...220
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t10, t12, t15, t17, t20, t22, t25, t27, t30, t32, t35, t36, t233, t234, t235, t236, t...1063
Computing Next relation with stutter on 34850 deadlock states
Detected timeout of ITS tools.
[2024-05-21 16:17:32] [INFO ] Flatten gal took : 42 ms
[2024-05-21 16:17:32] [INFO ] Applying decomposition
[2024-05-21 16:17:32] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10529538621873507223.txt' '-o' '/tmp/graph10529538621873507223.bin' '-w' '/tmp/graph10529538621873507223.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10529538621873507223.bin' '-l' '-1' '-v' '-w' '/tmp/graph10529538621873507223.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:17:32] [INFO ] Decomposing Gal with order
[2024-05-21 16:17:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:17:32] [INFO ] Removed a total of 1413 redundant transitions.
[2024-05-21 16:17:32] [INFO ] Flatten gal took : 185 ms
[2024-05-21 16:17:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 21 ms.
[2024-05-21 16:17:32] [INFO ] Time to serialize gal into /tmp/LTL11476673415928377444.gal : 7 ms
[2024-05-21 16:17:32] [INFO ] Time to serialize properties into /tmp/LTL10406377990522992232.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11476673415928377444.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10406377990522992232.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(((u0.p1==0)||(u0.p10==0))||((u8.p37==0)||(u0.p65==0)))")))&&(F("(((((u2.p17==0)||(u4.p24==0))||((u6.p31==0)||(i1.u7.p35==0...295
Formula 0 simplified : F(GF!"(((u0.p1==0)||(u0.p10==0))||((u8.p37==0)||(u0.p65==0)))" | G!"(((((u2.p17==0)||(u4.p24==0))||((u6.p31==0)||(i1.u7.p35==0)))||(...285
Reverse transition relation is NOT exact ! Due to transitions t233, t234, t235, t236, t237, t238, t239, t240, t241, t242, t243, t244, t245, t246, t247, t24...1131
Computing Next relation with stutter on 34850 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin736708702033922241
[2024-05-21 16:17:48] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin736708702033922241
Running compilation step : cd /tmp/ltsmin736708702033922241;'/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 996 ms.
Running link step : cd /tmp/ltsmin736708702033922241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin736708702033922241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>([]((LTLAPp0==true)))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 134 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-07a-LTLFireability-00 finished in 81830 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)||F((G(p2)&&p1)))))'
Support contains 14 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 339
Applied a total of 8 rules in 5 ms. Remains 65 /69 variables (removed 4) and now considering 339/371 (removed 32) transitions.
// Phase 1: matrix 339 rows 65 cols
[2024-05-21 16:17:49] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 16:17:49] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 16:17:49] [INFO ] Invariant cache hit.
[2024-05-21 16:17:49] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-21 16:17:49] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-21 16:17:49] [INFO ] Invariant cache hit.
[2024-05-21 16:17:49] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 339/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 535 ms. Remains : 65/69 places, 339/371 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s16 1) (EQ s23 1) (EQ s29 1) (EQ s35 1) (EQ s39 1) (EQ s48 1) (EQ s52 1) (EQ s61 1)), p2:(AND (EQ s1 1) (EQ s9 1) (EQ s19 1) (EQ s60 1)), p0:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-01 finished in 874 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((F(p0)||X(F(((!p1 U (p2||G(!p1))) U (((F(!p3) U ((!p4&&F(!p3))||G(F(!p3))))&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1)))))))))))'
Support contains 17 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 69 transition count 365
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 63 transition count 365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 63 transition count 363
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 61 transition count 363
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 56 transition count 323
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 56 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 55 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 54 transition count 322
Applied a total of 30 rules in 49 ms. Remains 54 /69 variables (removed 15) and now considering 322/371 (removed 49) transitions.
// Phase 1: matrix 322 rows 54 cols
[2024-05-21 16:17:50] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 16:17:50] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 16:17:50] [INFO ] Invariant cache hit.
[2024-05-21 16:17:50] [INFO ] State equation strengthened by 159 read => feed constraints.
[2024-05-21 16:17:50] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-05-21 16:17:50] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-21 16:17:50] [INFO ] Invariant cache hit.
[2024-05-21 16:17:50] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/69 places, 322/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 575 ms. Remains : 54/69 places, 322/371 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 p3 (NOT p2)), (AND (NOT p0) p1 (NOT p2) p3)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3)), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p2 p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) p1 (NOT p2) p3) (AND (NOT p0) (NOT p4) p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p4), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s36 0), p1:(AND (EQ s14 1) (EQ s17 1) (EQ s22 1) (EQ s27 1) (EQ s32 1) (EQ s41 1) (EQ s46 1) (EQ s51 1)), p2:(AND (NOT (AND (EQ s14 1) (EQ s19 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]]
Product exploration explored 100000 steps with 4 reset in 66 ms.
Product exploration explored 100000 steps with 294 reset in 247 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2 (NOT p4) (NOT p3)), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p2 p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2) p3) (AND (NOT p0) (NOT p4) p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 165 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter insensitive) to 5 states, 12 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 p3 (NOT p2)), (AND (NOT p0) p1 (NOT p2) p3)]
Incomplete random walk after 10000 steps, including 680 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 573601 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 573601 steps, saw 80600 distinct states, run finished after 3002 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-21 16:17:55] [INFO ] Invariant cache hit.
[2024-05-21 16:17:55] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-21 16:17:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-21 16:17:55] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2 (NOT p4) (NOT p3)), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p2 p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2) p3) (AND (NOT p0) (NOT p4) p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (G (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p3 p2)))), (G (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p4 p2)))), (G (NOT (OR (AND (NOT p0) p1 p3 (NOT p2)) (AND (NOT p0) p3 (NOT p4))))), (G (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (OR (AND (NOT p0) (NOT p1) p3 (NOT p4)) (AND (NOT p0) p3 (NOT p4) p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p4)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 24 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-02 finished in 5584 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((F(p0)&&(F(p1)||X(G(p2))))))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 339
Applied a total of 8 rules in 7 ms. Remains 65 /69 variables (removed 4) and now considering 339/371 (removed 32) transitions.
// Phase 1: matrix 339 rows 65 cols
[2024-05-21 16:17:55] [INFO ] Computed 9 invariants in 8 ms
[2024-05-21 16:17:55] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 16:17:55] [INFO ] Invariant cache hit.
[2024-05-21 16:17:55] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-21 16:17:56] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-21 16:17:56] [INFO ] Invariant cache hit.
[2024-05-21 16:17:56] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 339/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 603 ms. Remains : 65/69 places, 339/371 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s7 0) (EQ s39 0) (EQ s60 0)), p1:(AND (EQ s1 1) (EQ s7 1) (EQ s39 1) (EQ s60 1)), p2:(AND (EQ s1 1) (EQ s2 1) (EQ s50 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-04 finished in 829 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(F(p0))&&(X(!p1) U (p2 U p3))))'
Support contains 19 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 13 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
// Phase 1: matrix 323 rows 63 cols
[2024-05-21 16:17:56] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 16:17:56] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 16:17:56] [INFO ] Invariant cache hit.
[2024-05-21 16:17:56] [INFO ] State equation strengthened by 150 read => feed constraints.
[2024-05-21 16:17:56] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-21 16:17:56] [INFO ] Invariant cache hit.
[2024-05-21 16:17:56] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 323/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 63/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p3) (NOT p0)), p1, (NOT p0), (NOT p0), (NOT p3), (AND p1 (NOT p3)), true, (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(AND (EQ s1 1) (EQ s7 1) (EQ s15 1) (EQ s58 1)), p2:(AND (EQ s1 1) (EQ s7 1) (EQ s35 1) (EQ s58 1)), p0:(OR (EQ s14 0) (EQ s22 0) (EQ s26 0) (EQ s34 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][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 2 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-10 finished in 753 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)))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 331
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 331
Applied a total of 10 rules in 12 ms. Remains 64 /69 variables (removed 5) and now considering 331/371 (removed 40) transitions.
// Phase 1: matrix 331 rows 64 cols
[2024-05-21 16:17:57] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 16:17:57] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 16:17:57] [INFO ] Invariant cache hit.
[2024-05-21 16:17:57] [INFO ] State equation strengthened by 157 read => feed constraints.
[2024-05-21 16:17:57] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-21 16:17:57] [INFO ] Invariant cache hit.
[2024-05-21 16:17:57] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/69 places, 331/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 64/69 places, 331/371 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s5 1) (EQ s19 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-11 finished in 703 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(F(p0)))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 4 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
// Phase 1: matrix 323 rows 63 cols
[2024-05-21 16:17:57] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 16:17:58] [INFO ] Implicit Places using invariants in 165 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 167 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 323/371 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 174 ms. Remains : 62/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s19 0) (EQ s27 0) (EQ s31 0) (EQ s39 0) (EQ s43 0) (EQ s49 0) (EQ s58 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1275 ms.
Product exploration explored 100000 steps with 50000 reset in 1188 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-12 finished in 2799 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(F(p0))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 3 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
[2024-05-21 16:18:00] [INFO ] Invariant cache hit.
[2024-05-21 16:18:00] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 16:18:00] [INFO ] Invariant cache hit.
[2024-05-21 16:18:00] [INFO ] State equation strengthened by 150 read => feed constraints.
[2024-05-21 16:18:01] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-21 16:18:01] [INFO ] Invariant cache hit.
[2024-05-21 16:18:01] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 323/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 521 ms. Remains : 63/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1 1) (EQ s5 1) (EQ s29 1) (EQ s58 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 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-13 finished in 641 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((((p1 U p2)||(p3 U p2))&&p0)))'
Support contains 14 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 366
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 64 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 63 transition count 365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 63 transition count 363
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 61 transition count 363
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 22 place count 55 transition count 315
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 55 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 54 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 53 transition count 314
Applied a total of 32 rules in 33 ms. Remains 53 /69 variables (removed 16) and now considering 314/371 (removed 57) transitions.
// Phase 1: matrix 314 rows 53 cols
[2024-05-21 16:18:01] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 16:18:01] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 16:18:01] [INFO ] Invariant cache hit.
[2024-05-21 16:18:01] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-21 16:18:01] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-21 16:18:01] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-21 16:18:01] [INFO ] Invariant cache hit.
[2024-05-21 16:18:01] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/69 places, 314/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 504 ms. Remains : 53/69 places, 314/371 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p2) (NOT p1) p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p2) p1 (NOT p3))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s17 1) (EQ s22 1) (EQ s28 1) (EQ s35 1) (EQ s40 1) (EQ s43 1) (EQ s50 1)), p2:(AND (EQ s1 1) (EQ s8 1) (EQ s34 1) (EQ s49 1)), p1:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-14 finished in 696 ms.
All properties solved by simple procedures.
Total runtime 106932 ms.

BK_STOP 1716308283157

--------------------
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-07a"
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-07a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180300198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;