fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r005-oct2-167813593400644
Last Updated
May 14, 2023

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3996.363 574837.00 1973695.00 86.10 FFTFFFFFFFFFFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593400644.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is AutonomousCar-PT-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593400644
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 448K Mar 5 18:22 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-08a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-08a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678521496643

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 07:58:18] [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]
[2023-03-11 07:58:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:58:19] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-11 07:58:19] [INFO ] Transformed 81 places.
[2023-03-11 07:58:19] [INFO ] Transformed 849 transitions.
[2023-03-11 07:58:19] [INFO ] Found NUPN structural information;
[2023-03-11 07:58:19] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
FORMULA AutonomousCar-PT-08a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 80 transition count 573
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 573
Applied a total of 2 rules in 84 ms. Remains 80 /81 variables (removed 1) and now considering 573/574 (removed 1) transitions.
// Phase 1: matrix 573 rows 80 cols
[2023-03-11 07:58:19] [INFO ] Computed 12 place invariants in 25 ms
[2023-03-11 07:58:19] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-11 07:58:19] [INFO ] Invariant cache hit.
[2023-03-11 07:58:20] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-11 07:58:20] [INFO ] Implicit Places using invariants and state equation in 515 ms returned [76, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 861 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/81 places, 573/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 78 /78 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 954 ms. Remains : 78/81 places, 573/574 transitions.
Support contains 40 out of 78 places after structural reductions.
[2023-03-11 07:58:20] [INFO ] Flatten gal took : 154 ms
[2023-03-11 07:58:20] [INFO ] Flatten gal took : 88 ms
[2023-03-11 07:58:21] [INFO ] Input system was already deterministic with 573 transitions.
Incomplete random walk after 10000 steps, including 535 resets, run finished after 583 ms. (steps per millisecond=17 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 573 rows 78 cols
[2023-03-11 07:58:21] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-11 07:58:22] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-11 07:58:23] [INFO ] After 1044ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-11 07:58:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-11 07:58:24] [INFO ] After 1219ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-11 07:58:24] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-11 07:58:25] [INFO ] After 1033ms SMT Verify possible using 259 Read/Feed constraints in natural domain returned unsat :1 sat :11
[2023-03-11 07:58:26] [INFO ] After 2218ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 997 ms.
[2023-03-11 07:58:27] [INFO ] After 4678ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 210 ms.
Support contains 27 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 573/573 transitions.
Graph (complete) has 842 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 77 transition count 562
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 70 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 69 transition count 561
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 69 transition count 558
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 66 transition count 558
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 29 place count 63 transition count 539
Iterating global reduction 3 with 3 rules applied. Total rules applied 32 place count 63 transition count 539
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 34 place count 62 transition count 538
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 42 place count 62 transition count 530
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 106 place count 54 transition count 474
Applied a total of 106 rules in 143 ms. Remains 54 /78 variables (removed 24) and now considering 474/573 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 54/78 places, 474/573 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 474 rows 54 cols
[2023-03-11 07:58:28] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-11 07:58:29] [INFO ] [Real]Absence check using 12 positive place invariants in 29 ms returned sat
[2023-03-11 07:58:29] [INFO ] After 708ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 07:58:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-11 07:58:30] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 07:58:30] [INFO ] State equation strengthened by 185 read => feed constraints.
[2023-03-11 07:58:30] [INFO ] After 339ms SMT Verify possible using 185 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 07:58:31] [INFO ] After 789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 344 ms.
[2023-03-11 07:58:31] [INFO ] After 1797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 61 ms.
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 474/474 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 465
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 51 transition count 463
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 51 transition count 462
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 16 place count 50 transition count 454
Applied a total of 16 rules in 84 ms. Remains 50 /54 variables (removed 4) and now considering 454/474 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 50/54 places, 454/474 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 835292 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 835292 steps, saw 107484 distinct states, run finished after 3004 ms. (steps per millisecond=278 ) properties seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 454 rows 50 cols
[2023-03-11 07:58:34] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-11 07:58:35] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 07:58:35] [INFO ] After 589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:58:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-11 07:58:35] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:58:35] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-11 07:58:36] [INFO ] After 141ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:58:36] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-11 07:58:36] [INFO ] After 935ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 454/454 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 47 transition count 427
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 47 transition count 427
Applied a total of 6 rules in 26 ms. Remains 47 /50 variables (removed 3) and now considering 427/454 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 47/50 places, 427/454 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1083525 steps, run timeout after 3001 ms. (steps per millisecond=361 ) properties seen :{}
Probabilistic random walk after 1083525 steps, saw 137074 distinct states, run finished after 3002 ms. (steps per millisecond=360 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 427 rows 47 cols
[2023-03-11 07:58:39] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-11 07:58:39] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 07:58:39] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:58:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-11 07:58:40] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:58:40] [INFO ] State equation strengthened by 145 read => feed constraints.
[2023-03-11 07:58:40] [INFO ] After 85ms SMT Verify possible using 145 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:58:40] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-11 07:58:40] [INFO ] After 635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 427/427 transitions.
Applied a total of 0 rules in 33 ms. Remains 47 /47 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 47/47 places, 427/427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 427/427 transitions.
Applied a total of 0 rules in 21 ms. Remains 47 /47 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2023-03-11 07:58:40] [INFO ] Invariant cache hit.
[2023-03-11 07:58:40] [INFO ] Implicit Places using invariants in 287 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 290 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 46/47 places, 427/427 transitions.
Applied a total of 0 rules in 37 ms. Remains 46 /46 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 349 ms. Remains : 46/47 places, 427/427 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1155604 steps, run timeout after 3001 ms. (steps per millisecond=385 ) properties seen :{}
Probabilistic random walk after 1155604 steps, saw 146107 distinct states, run finished after 3001 ms. (steps per millisecond=385 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 427 rows 46 cols
[2023-03-11 07:58:44] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-11 07:58:44] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-11 07:58:44] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:58:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 07:58:44] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:58:44] [INFO ] State equation strengthened by 145 read => feed constraints.
[2023-03-11 07:58:44] [INFO ] After 96ms SMT Verify possible using 145 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:58:44] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-11 07:58:45] [INFO ] After 585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 427/427 transitions.
Applied a total of 0 rules in 28 ms. Remains 46 /46 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 46/46 places, 427/427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 427/427 transitions.
Applied a total of 0 rules in 19 ms. Remains 46 /46 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2023-03-11 07:58:45] [INFO ] Invariant cache hit.
[2023-03-11 07:58:45] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-11 07:58:45] [INFO ] Invariant cache hit.
[2023-03-11 07:58:45] [INFO ] State equation strengthened by 145 read => feed constraints.
[2023-03-11 07:58:45] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2023-03-11 07:58:45] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-11 07:58:45] [INFO ] Invariant cache hit.
[2023-03-11 07:58:46] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 974 ms. Remains : 46/46 places, 427/427 transitions.
Applied a total of 0 rules in 27 ms. Remains 46 /46 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-11 07:58:46] [INFO ] Invariant cache hit.
[2023-03-11 07:58:46] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-11 07:58:46] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:58:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 07:58:46] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:58:46] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-11 07:58:46] [INFO ] After 463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
FORMULA AutonomousCar-PT-08a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(X(G(p2))&&p1))))'
Support contains 15 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 71 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 71 transition count 510
Applied a total of 14 rules in 4 ms. Remains 71 /78 variables (removed 7) and now considering 510/573 (removed 63) transitions.
// Phase 1: matrix 510 rows 71 cols
[2023-03-11 07:58:47] [INFO ] Computed 10 place invariants in 15 ms
[2023-03-11 07:58:47] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-11 07:58:47] [INFO ] Invariant cache hit.
[2023-03-11 07:58:47] [INFO ] State equation strengthened by 203 read => feed constraints.
[2023-03-11 07:58:47] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-11 07:58:47] [INFO ] Invariant cache hit.
[2023-03-11 07:58:48] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/78 places, 510/573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 681 ms. Remains : 71/78 places, 510/573 transitions.
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (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))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s17 1) (EQ s21 1) (EQ s30 1) (EQ s34 1) (EQ s42 1) (EQ s46 1) (EQ s52 1) (EQ s58 1) (EQ s67 1)), p1:(AND (EQ s1 1) (EQ s9 1) (EQ s16 1) (EQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-00 finished in 1080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 78 transition count 563
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 68 transition count 563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 68 transition count 562
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 22 place count 67 transition count 562
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 60 transition count 499
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 60 transition count 499
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 58 transition count 497
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 42 place count 57 transition count 497
Applied a total of 42 rules in 106 ms. Remains 57 /78 variables (removed 21) and now considering 497/573 (removed 76) transitions.
// Phase 1: matrix 497 rows 57 cols
[2023-03-11 07:58:48] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-11 07:58:48] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-11 07:58:48] [INFO ] Invariant cache hit.
[2023-03-11 07:58:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-11 07:58:49] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
[2023-03-11 07:58:49] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-11 07:58:49] [INFO ] Invariant cache hit.
[2023-03-11 07:58:49] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/78 places, 497/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1274 ms. Remains : 57/78 places, 497/573 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s8 1) (EQ s27 1) (EQ s53 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 12 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-01 finished in 1335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X(X(!p0))))&&F(!p1)) U (G(((X(X(X(X(!p0))))&&F(!p1))||X(X(X(X(G(!p0)))))))||((!p2 U (p3||G(!p2)))&&((X(X(X(X(!p0))))&&F(!p1))||X(X(X(X(G(!p0))))))))))'
Support contains 15 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 501
Applied a total of 16 rules in 4 ms. Remains 70 /78 variables (removed 8) and now considering 501/573 (removed 72) transitions.
// Phase 1: matrix 501 rows 70 cols
[2023-03-11 07:58:49] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-11 07:58:49] [INFO ] Implicit Places using invariants in 147 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 501/573 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 69/78 places, 501/573 transitions.
Stuttering acceptance computed with spot in 1205 ms :[p0, p0, (AND p0 p2 (NOT p3)), (AND p1 p0), p0, (AND p0 (NOT p3) p2), (AND p1 p0 (NOT p3) p2), (AND p1 p0), p0, (AND p0 (NOT p3) p2), (AND p1 p0 (NOT p3) p2), (AND p1 p0), p0, (AND p0 (NOT p3) p2), (AND p1 (NOT p3) p2 p0), (AND p1 p0), true, (AND (NOT p3) p2 p0), (AND p1 (NOT p3) p2 p0), p1, (AND (NOT p3) p2 (NOT p0)), (AND p1 (NOT p3) p2 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=6 dest: 7}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=p1, acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p3) p2), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 13}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=10 dest: 11}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=10 dest: 14}], [{ cond=p1, acceptance={} source=11 dest: 15}], [{ cond=p0, acceptance={} source=12 dest: 16}], [{ cond=(AND (NOT p3) p2), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=13 dest: 17}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=14 dest: 15}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=14 dest: 18}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=15 dest: 15}, { cond=(AND p1 p0), acceptance={} source=15 dest: 19}], [{ cond=true, acceptance={0} source=16 dest: 16}], [{ cond=(AND (NOT p3) p2 p0), acceptance={} source=17 dest: 16}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=17 dest: 20}], [{ cond=(AND p1 (NOT p3) p2 p0), acceptance={} source=18 dest: 19}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=18 dest: 21}], [{ cond=p1, acceptance={0} source=19 dest: 19}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=20 dest: 16}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=20 dest: 20}], [{ cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=21 dest: 19}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=21 dest: 21}]], initial=0, aps=[p3:(AND (NOT (AND (EQ s16 1) (EQ s22 1) (EQ s26 1) (EQ s32 1) (EQ s38 1) (EQ s44 1) (EQ s52 1) (EQ s58 1) (EQ s65 1))) (NOT (AND (EQ s14 1) (EQ s20 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 1020 ms.
Product exploration explored 100000 steps with 20000 reset in 886 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 647 ms. Reduced automaton from 22 states, 41 edges and 4 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[p0, (AND p0 p3), true, p0, (AND p0 p3), (AND p0 p3)]
Incomplete random walk after 10000 steps, including 504 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Finished Best-First random walk after 1792 steps, including 5 resets, run visited all 1 properties in 4 ms. (steps per millisecond=448 )
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT p3))]
Knowledge based reduction with 12 factoid took 654 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[p0, (AND p0 p3), true, p0, (AND p0 p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 258 ms :[p0, (AND p0 p3), true, p0, (AND p0 p3), (AND p0 p3)]
Support contains 15 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 501/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 69 cols
[2023-03-11 07:58:55] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-11 07:58:55] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-11 07:58:55] [INFO ] Invariant cache hit.
[2023-03-11 07:58:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:58:55] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-11 07:58:55] [INFO ] Invariant cache hit.
[2023-03-11 07:58:56] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 642 ms. Remains : 69/69 places, 501/501 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p3), (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[p0, p0, p0, p0, true, p0]
Incomplete random walk after 10000 steps, including 507 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Finished Best-First random walk after 2321 steps, including 9 resets, run visited all 1 properties in 3 ms. (steps per millisecond=773 )
Knowledge obtained : [(AND (NOT p0) p3), (X p3), (X (X p3))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 334 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 357 ms :[p0, p0, p0, p0, true, p0]
Product exploration explored 100000 steps with 20000 reset in 931 ms.
Product exploration explored 100000 steps with 20000 reset in 955 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 369 ms :[p0, p0, p0, p0, true, p0]
Support contains 9 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 501/501 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 69 transition count 501
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 8 place count 69 transition count 503
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 69 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 69 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 69 transition count 506
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 12 rules in 75 ms. Remains 69 /69 variables (removed 0) and now considering 506/501 (removed -5) transitions.
[2023-03-11 07:59:00] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 506 rows 69 cols
[2023-03-11 07:59:00] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-11 07:59:00] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/69 places, 506/501 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 352 ms. Remains : 69/69 places, 506/501 transitions.
Built C files in :
/tmp/ltsmin376241344957212223
[2023-03-11 07:59:00] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin376241344957212223
Running compilation step : cd /tmp/ltsmin376241344957212223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1331 ms.
Running link step : cd /tmp/ltsmin376241344957212223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin376241344957212223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10456177815921251261.hoa' '--buchi-type=spotba'
LTSmin run took 406 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-08a-LTLFireability-02 finished in 12966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 78 transition count 564
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 69 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 68 transition count 563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 68 transition count 562
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 22 place count 67 transition count 562
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 30 place count 59 transition count 490
Iterating global reduction 3 with 8 rules applied. Total rules applied 38 place count 59 transition count 490
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 3 with 4 rules applied. Total rules applied 42 place count 57 transition count 488
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 44 place count 56 transition count 488
Applied a total of 44 rules in 57 ms. Remains 56 /78 variables (removed 22) and now considering 488/573 (removed 85) transitions.
// Phase 1: matrix 488 rows 56 cols
[2023-03-11 07:59:02] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 07:59:03] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-11 07:59:03] [INFO ] Invariant cache hit.
[2023-03-11 07:59:03] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-11 07:59:03] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2023-03-11 07:59:03] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-11 07:59:03] [INFO ] Invariant cache hit.
[2023-03-11 07:59:03] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/78 places, 488/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1260 ms. Remains : 56/78 places, 488/573 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s34 1) (EQ s52 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 13 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-04 finished in 1320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(F(p1))))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 72 transition count 519
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 72 transition count 519
Applied a total of 12 rules in 8 ms. Remains 72 /78 variables (removed 6) and now considering 519/573 (removed 54) transitions.
// Phase 1: matrix 519 rows 72 cols
[2023-03-11 07:59:03] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-11 07:59:04] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-11 07:59:04] [INFO ] Invariant cache hit.
[2023-03-11 07:59:04] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-11 07:59:04] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
[2023-03-11 07:59:04] [INFO ] Invariant cache hit.
[2023-03-11 07:59:05] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 72/78 places, 519/573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1322 ms. Remains : 72/78 places, 519/573 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s32 1) (EQ s67 1)), p1:(AND (EQ s1 1) (EQ s9 1) (EQ s45 1) (EQ s67 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 18 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-05 finished in 1565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 9 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 501
Applied a total of 16 rules in 6 ms. Remains 70 /78 variables (removed 8) and now considering 501/573 (removed 72) transitions.
// Phase 1: matrix 501 rows 70 cols
[2023-03-11 07:59:05] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-11 07:59:05] [INFO ] Implicit Places using invariants in 319 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 321 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 501/573 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 330 ms. Remains : 69/78 places, 501/573 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-09 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 s14 1) (EQ s20 1) (EQ s28 1) (EQ s34 1) (EQ s40 1) (EQ s46 1) (EQ s50 1) (EQ s56 1) (EQ s65 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-08a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-09 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(F(p1)))&&F(p2)))'
Support contains 16 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 71 transition count 510
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 71 transition count 510
Applied a total of 14 rules in 7 ms. Remains 71 /78 variables (removed 7) and now considering 510/573 (removed 63) transitions.
// Phase 1: matrix 510 rows 71 cols
[2023-03-11 07:59:06] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-11 07:59:06] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-11 07:59:06] [INFO ] Invariant cache hit.
[2023-03-11 07:59:06] [INFO ] State equation strengthened by 203 read => feed constraints.
[2023-03-11 07:59:06] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-11 07:59:06] [INFO ] Invariant cache hit.
[2023-03-11 07:59:06] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/78 places, 510/573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 849 ms. Remains : 71/78 places, 510/573 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s5 1) (EQ s26 1) (EQ s66 1)), p2:(OR (EQ s17 0) (EQ s23 0) (EQ s30 0) (EQ s36 0) (EQ s40 0) (EQ s48 0) (EQ s52 0) (EQ s60 0) (EQ s67...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 4 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-10 finished in 1086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 78 transition count 563
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 68 transition count 563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 68 transition count 562
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 67 transition count 562
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 60 transition count 499
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 60 transition count 499
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 58 transition count 497
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 57 transition count 497
Applied a total of 42 rules in 83 ms. Remains 57 /78 variables (removed 21) and now considering 497/573 (removed 76) transitions.
// Phase 1: matrix 497 rows 57 cols
[2023-03-11 07:59:07] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-11 07:59:07] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-11 07:59:07] [INFO ] Invariant cache hit.
[2023-03-11 07:59:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-11 07:59:07] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2023-03-11 07:59:08] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 07:59:08] [INFO ] Invariant cache hit.
[2023-03-11 07:59:08] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/78 places, 497/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1315 ms. Remains : 57/78 places, 497/573 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s4 1) (EQ s14 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-11 finished in 1358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&(X(p1) U ((!p2&&X(p1))||X(G(p1))))) U p3))'
Support contains 22 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 72 transition count 519
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 72 transition count 519
Applied a total of 12 rules in 3 ms. Remains 72 /78 variables (removed 6) and now considering 519/573 (removed 54) transitions.
// Phase 1: matrix 519 rows 72 cols
[2023-03-11 07:59:08] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 07:59:08] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-11 07:59:08] [INFO ] Invariant cache hit.
[2023-03-11 07:59:08] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-11 07:59:08] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-11 07:59:08] [INFO ] Invariant cache hit.
[2023-03-11 07:59:09] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 72/78 places, 519/573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 690 ms. Remains : 72/78 places, 519/573 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p3), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s1 1) (EQ s6 1) (EQ s59 1) (EQ s67 1)), p0:(OR (AND (NOT (AND (EQ s15 1) (EQ s23 1) (EQ s29 1) (EQ s33 1) (EQ s39 1) (EQ s47 1) (EQ s51 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLFireability-12 finished in 984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(!X(G(p0)) U G(((p1 U p0)&&G(p1)))))))'
Support contains 13 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 565
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 70 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 70 transition count 563
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 20 place count 68 transition count 563
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 61 transition count 500
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 61 transition count 500
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 36 place count 60 transition count 499
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 38 place count 59 transition count 499
Applied a total of 38 rules in 55 ms. Remains 59 /78 variables (removed 19) and now considering 499/573 (removed 74) transitions.
// Phase 1: matrix 499 rows 59 cols
[2023-03-11 07:59:09] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 07:59:09] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-11 07:59:09] [INFO ] Invariant cache hit.
[2023-03-11 07:59:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-11 07:59:10] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2023-03-11 07:59:10] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-11 07:59:10] [INFO ] Invariant cache hit.
[2023-03-11 07:59:10] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/78 places, 499/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 859 ms. Remains : 59/78 places, 499/573 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s9 1) (EQ s47 1) (EQ s55 1)), p0:(AND (EQ s15 1) (EQ s18 1) (EQ s23 1) (EQ s30 1) (EQ s35 1) (EQ s38 1) (EQ s45 1) (EQ s48 1) (EQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9 reset in 103 ms.
Product exploration explored 100000 steps with 355 reset in 133 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 (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 301 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 649 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:59:11] [INFO ] Invariant cache hit.
[2023-03-11 07:59:11] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-11 07:59:11] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND p0 p1)))
Knowledge based reduction with 6 factoid took 380 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLFireability-13 finished in 2336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 78 transition count 563
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 68 transition count 563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 68 transition count 562
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 22 place count 67 transition count 562
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 61 transition count 508
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 61 transition count 508
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 59 transition count 506
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 40 place count 58 transition count 506
Applied a total of 40 rules in 77 ms. Remains 58 /78 variables (removed 20) and now considering 506/573 (removed 67) transitions.
// Phase 1: matrix 506 rows 58 cols
[2023-03-11 07:59:11] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-11 07:59:12] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-11 07:59:12] [INFO ] Invariant cache hit.
[2023-03-11 07:59:12] [INFO ] State equation strengthened by 213 read => feed constraints.
[2023-03-11 07:59:12] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
[2023-03-11 07:59:12] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-11 07:59:12] [INFO ] Invariant cache hit.
[2023-03-11 07:59:13] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/78 places, 506/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1230 ms. Remains : 58/78 places, 506/573 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s1 0) (EQ s6 0) (EQ s33 0) (EQ s54 0)), p0:(OR (EQ s1 0) (EQ s4 0) (EQ s14 0) (EQ s54 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 159 reset in 74 ms.
Product exploration explored 100000 steps with 365 reset in 187 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 658 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1122726 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :{}
Probabilistic random walk after 1122726 steps, saw 136874 distinct states, run finished after 3001 ms. (steps per millisecond=374 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:59:17] [INFO ] Invariant cache hit.
[2023-03-11 07:59:17] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:59:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 07:59:17] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 07:59:17] [INFO ] State equation strengthened by 213 read => feed constraints.
[2023-03-11 07:59:17] [INFO ] After 131ms SMT Verify possible using 213 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 07:59:17] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-11 07:59:17] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 506/506 transitions.
Graph (complete) has 772 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 57 transition count 503
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 57 transition count 494
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 85 place count 48 transition count 430
Applied a total of 85 rules in 61 ms. Remains 48 /58 variables (removed 10) and now considering 430/506 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 48/58 places, 430/506 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1094949 steps, run visited all 1 properties in 1815 ms. (steps per millisecond=603 )
Probabilistic random walk after 1094949 steps, saw 140432 distinct states, run finished after 1816 ms. (steps per millisecond=602 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 268 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08a-LTLFireability-14 finished in 8078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 573/573 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 78 transition count 563
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 68 transition count 563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 68 transition count 562
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 22 place count 67 transition count 562
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 60 transition count 499
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 60 transition count 499
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 58 transition count 497
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 57 transition count 497
Applied a total of 42 rules in 80 ms. Remains 57 /78 variables (removed 21) and now considering 497/573 (removed 76) transitions.
// Phase 1: matrix 497 rows 57 cols
[2023-03-11 07:59:19] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-11 07:59:20] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-11 07:59:20] [INFO ] Invariant cache hit.
[2023-03-11 07:59:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-11 07:59:20] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
[2023-03-11 07:59:20] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-11 07:59:20] [INFO ] Invariant cache hit.
[2023-03-11 07:59:20] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/78 places, 497/573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1088 ms. Remains : 57/78 places, 497/573 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s8 0) (EQ s39 0) (EQ s53 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 736 reset in 135 ms.
Product exploration explored 100000 steps with 231 reset in 123 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 700 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 924232 steps, run visited all 1 properties in 1590 ms. (steps per millisecond=581 )
Probabilistic random walk after 924232 steps, saw 112557 distinct states, run finished after 1590 ms. (steps per millisecond=581 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 254 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 497/497 transitions.
Applied a total of 0 rules in 31 ms. Remains 57 /57 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2023-03-11 07:59:23] [INFO ] Invariant cache hit.
[2023-03-11 07:59:24] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-11 07:59:24] [INFO ] Invariant cache hit.
[2023-03-11 07:59:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-11 07:59:24] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2023-03-11 07:59:24] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-11 07:59:24] [INFO ] Invariant cache hit.
[2023-03-11 07:59:24] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1034 ms. Remains : 57/57 places, 497/497 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 650 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 924232 steps, run visited all 1 properties in 1622 ms. (steps per millisecond=569 )
Probabilistic random walk after 924232 steps, saw 112557 distinct states, run finished after 1622 ms. (steps per millisecond=569 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 243 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 147 reset in 99 ms.
Product exploration explored 100000 steps with 124 reset in 59 ms.
Built C files in :
/tmp/ltsmin11553699724693713309
[2023-03-11 07:59:27] [INFO ] Computing symmetric may disable matrix : 497 transitions.
[2023-03-11 07:59:27] [INFO ] Computation of Complete disable matrix. took 65 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:59:27] [INFO ] Computing symmetric may enable matrix : 497 transitions.
[2023-03-11 07:59:27] [INFO ] Computation of Complete enable matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:59:27] [INFO ] Computing Do-Not-Accords matrix : 497 transitions.
[2023-03-11 07:59:27] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:59:27] [INFO ] Built C files in 266ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11553699724693713309
Running compilation step : cd /tmp/ltsmin11553699724693713309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1891 ms.
Running link step : cd /tmp/ltsmin11553699724693713309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin11553699724693713309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11889114116435068957.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 497/497 transitions.
Applied a total of 0 rules in 26 ms. Remains 57 /57 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2023-03-11 07:59:42] [INFO ] Invariant cache hit.
[2023-03-11 07:59:42] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-11 07:59:42] [INFO ] Invariant cache hit.
[2023-03-11 07:59:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-11 07:59:43] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2023-03-11 07:59:43] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-11 07:59:43] [INFO ] Invariant cache hit.
[2023-03-11 07:59:43] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 924 ms. Remains : 57/57 places, 497/497 transitions.
Built C files in :
/tmp/ltsmin12597581986217179310
[2023-03-11 07:59:43] [INFO ] Computing symmetric may disable matrix : 497 transitions.
[2023-03-11 07:59:43] [INFO ] Computation of Complete disable matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:59:43] [INFO ] Computing symmetric may enable matrix : 497 transitions.
[2023-03-11 07:59:43] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:59:43] [INFO ] Computing Do-Not-Accords matrix : 497 transitions.
[2023-03-11 07:59:43] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:59:43] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12597581986217179310
Running compilation step : cd /tmp/ltsmin12597581986217179310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1862 ms.
Running link step : cd /tmp/ltsmin12597581986217179310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12597581986217179310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14055531720424664504.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 07:59:58] [INFO ] Flatten gal took : 67 ms
[2023-03-11 07:59:58] [INFO ] Flatten gal took : 89 ms
[2023-03-11 07:59:59] [INFO ] Time to serialize gal into /tmp/LTL13140100832460517216.gal : 31 ms
[2023-03-11 07:59:59] [INFO ] Time to serialize properties into /tmp/LTL10694232422952347085.prop : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13140100832460517216.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2562148097014178050.hoa' '-atoms' '/tmp/LTL10694232422952347085.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10694232422952347085.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2562148097014178050.hoa
Detected timeout of ITS tools.
[2023-03-11 08:00:14] [INFO ] Flatten gal took : 67 ms
[2023-03-11 08:00:14] [INFO ] Flatten gal took : 56 ms
[2023-03-11 08:00:14] [INFO ] Time to serialize gal into /tmp/LTL3541539552718001799.gal : 7 ms
[2023-03-11 08:00:14] [INFO ] Time to serialize properties into /tmp/LTL12175593243087993261.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3541539552718001799.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12175593243087993261.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p1==0)||(p9==0))||((p51==0)||(p73==0)))"))))
Formula 0 simplified : FG!"(((p1==0)||(p9==0))||((p51==0)||(p73==0)))"
Detected timeout of ITS tools.
[2023-03-11 08:00:29] [INFO ] Flatten gal took : 92 ms
[2023-03-11 08:00:29] [INFO ] Applying decomposition
[2023-03-11 08:00:29] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18225424413663030801.txt' '-o' '/tmp/graph18225424413663030801.bin' '-w' '/tmp/graph18225424413663030801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18225424413663030801.bin' '-l' '-1' '-v' '-w' '/tmp/graph18225424413663030801.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:00:29] [INFO ] Decomposing Gal with order
[2023-03-11 08:00:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:00:29] [INFO ] Removed a total of 2656 redundant transitions.
[2023-03-11 08:00:30] [INFO ] Flatten gal took : 122 ms
[2023-03-11 08:00:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 49 ms.
[2023-03-11 08:00:30] [INFO ] Time to serialize gal into /tmp/LTL1005718996151625640.gal : 15 ms
[2023-03-11 08:00:30] [INFO ] Time to serialize properties into /tmp/LTL5796824662934617191.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1005718996151625640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5796824662934617191.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i9.u16.p1==0)||(i9.u16.p9==0))||((u10.p51==0)||(i9.u16.p73==0)))"))))
Formula 0 simplified : FG!"(((i9.u16.p1==0)||(i9.u16.p9==0))||((u10.p51==0)||(i9.u16.p73==0)))"
Reverse transition relation is NOT exact ! Due to transitions t306, t307, t308, t309, t310, t311, t312, t313, t314, t315, t316, t317, t318, t319, t320, t32...779
Computing Next relation with stutter on 117826 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin489507981190639597
[2023-03-11 08:00:45] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin489507981190639597
Running compilation step : cd /tmp/ltsmin489507981190639597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1339 ms.
Running link step : cd /tmp/ltsmin489507981190639597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin489507981190639597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-08a-LTLFireability-15 finished in 100429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-11 08:01:00] [INFO ] Flatten gal took : 81 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin796843929886507879
[2023-03-11 08:01:00] [INFO ] Computing symmetric may disable matrix : 573 transitions.
[2023-03-11 08:01:00] [INFO ] Applying decomposition
[2023-03-11 08:01:00] [INFO ] Computation of Complete disable matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:01:00] [INFO ] Flatten gal took : 49 ms
[2023-03-11 08:01:00] [INFO ] Computing symmetric may enable matrix : 573 transitions.
[2023-03-11 08:01:00] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:01:00] [INFO ] Computing Do-Not-Accords matrix : 573 transitions.
[2023-03-11 08:01:00] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:01:00] [INFO ] Built C files in 220ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin796843929886507879
Running compilation step : cd /tmp/ltsmin796843929886507879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13729937834858345941.txt' '-o' '/tmp/graph13729937834858345941.bin' '-w' '/tmp/graph13729937834858345941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13729937834858345941.bin' '-l' '-1' '-v' '-w' '/tmp/graph13729937834858345941.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:01:00] [INFO ] Decomposing Gal with order
[2023-03-11 08:01:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:01:00] [INFO ] Removed a total of 2960 redundant transitions.
[2023-03-11 08:01:00] [INFO ] Flatten gal took : 101 ms
[2023-03-11 08:01:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 27 ms.
[2023-03-11 08:01:00] [INFO ] Time to serialize gal into /tmp/LTLFireability542275592196498703.gal : 8 ms
[2023-03-11 08:01:00] [INFO ] Time to serialize properties into /tmp/LTLFireability5011781045337908697.ltl : 0 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability542275592196498703.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5011781045337908697.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((u25.p1==0)||(u25.p9==0))||((i2.u17.p51==0)||(u25.p73==0)))"))))
Formula 0 simplified : FG!"(((u25.p1==0)||(u25.p9==0))||((i2.u17.p51==0)||(u25.p73==0)))"
Compilation finished in 2189 ms.
Running link step : cd /tmp/ltsmin796843929886507879;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin796843929886507879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t53, t293, t571, u25.t303, i0.u26.t1, i0.u26.t305, i0.u26.t570, i1.u3.t40, i2.u2.t41, i2.u2.t...512
Computing Next relation with stutter on 117826 deadlock states
LTSmin run took 408116 ms.
FORMULA AutonomousCar-PT-08a-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 572260 ms.

BK_STOP 1678522071480

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-08a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-08a, 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 r005-oct2-167813593400644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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