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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 15K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:53 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 276K 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-07a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678521234446

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-07a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 07:53:56] [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:53:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:53:56] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-11 07:53:56] [INFO ] Transformed 73 places.
[2023-03-11 07:53:56] [INFO ] Transformed 593 transitions.
[2023-03-11 07:53:56] [INFO ] Found NUPN structural information;
[2023-03-11 07:53:56] [INFO ] Parsed PT model containing 73 places and 593 transitions and 5357 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
FORMULA AutonomousCar-PT-07a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 69 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 69 transition count 355
Applied a total of 8 rules in 42 ms. Remains 69 /73 variables (removed 4) and now considering 355/380 (removed 25) transitions.
// Phase 1: matrix 355 rows 69 cols
[2023-03-11 07:53:57] [INFO ] Computed 11 place invariants in 20 ms
[2023-03-11 07:53:57] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-11 07:53:57] [INFO ] Invariant cache hit.
[2023-03-11 07:53:57] [INFO ] State equation strengthened by 178 read => feed constraints.
[2023-03-11 07:53:57] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [65, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 654 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/73 places, 355/380 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 699 ms. Remains : 67/73 places, 355/380 transitions.
Support contains 33 out of 67 places after structural reductions.
[2023-03-11 07:53:58] [INFO ] Flatten gal took : 104 ms
[2023-03-11 07:53:58] [INFO ] Flatten gal took : 42 ms
[2023-03-11 07:53:58] [INFO ] Input system was already deterministic with 355 transitions.
Support contains 32 out of 67 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 535 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 20) seen :12
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 355 rows 67 cols
[2023-03-11 07:53:58] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-11 07:53:58] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-11 07:53:59] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 07:53:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-11 07:53:59] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 07:53:59] [INFO ] State equation strengthened by 178 read => feed constraints.
[2023-03-11 07:53:59] [INFO ] After 376ms SMT Verify possible using 178 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 07:54:00] [INFO ] After 839ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 364 ms.
[2023-03-11 07:54:00] [INFO ] After 1567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 69 ms.
Support contains 11 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 355/355 transitions.
Graph (complete) has 643 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 66 transition count 344
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 59 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 59 transition count 343
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 20 place count 58 transition count 343
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 55 transition count 326
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 55 transition count 326
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 30 place count 53 transition count 324
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 53 transition count 318
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 77 place count 47 transition count 283
Applied a total of 77 rules in 86 ms. Remains 47 /67 variables (removed 20) and now considering 283/355 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 47/67 places, 283/355 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 283 rows 47 cols
[2023-03-11 07:54:01] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-11 07:54:01] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-11 07:54:01] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 07:54:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 07:54:01] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 07:54:01] [INFO ] State equation strengthened by 127 read => feed constraints.
[2023-03-11 07:54:01] [INFO ] After 146ms SMT Verify possible using 127 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 07:54:01] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-11 07:54:02] [INFO ] After 677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 10 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 283/283 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 282
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 46 transition count 275
Applied a total of 9 rules in 49 ms. Remains 46 /47 variables (removed 1) and now considering 275/283 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 46/47 places, 275/283 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 964860 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :{}
Probabilistic random walk after 964860 steps, saw 130981 distinct states, run finished after 3002 ms. (steps per millisecond=321 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 275 rows 46 cols
[2023-03-11 07:54:05] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-11 07:54:05] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-11 07:54:05] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 07:54:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-11 07:54:05] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 07:54:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-11 07:54:05] [INFO ] After 76ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 07:54:06] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-11 07:54:06] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 10 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 275/275 transitions.
Applied a total of 0 rules in 10 ms. Remains 46 /46 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 46/46 places, 275/275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 275/275 transitions.
Applied a total of 0 rules in 8 ms. Remains 46 /46 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2023-03-11 07:54:06] [INFO ] Invariant cache hit.
[2023-03-11 07:54:06] [INFO ] Implicit Places using invariants in 209 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 45/46 places, 275/275 transitions.
Applied a total of 0 rules in 8 ms. Remains 45 /45 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 227 ms. Remains : 45/46 places, 275/275 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 275 rows 45 cols
[2023-03-11 07:54:06] [INFO ] Computed 10 place invariants in 14 ms
[2023-03-11 07:54:06] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-11 07:54:06] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:54:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-11 07:54:06] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:54:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-11 07:54:07] [INFO ] After 47ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:54:07] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-11 07:54:07] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 275/275 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 44 transition count 274
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 43 transition count 266
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 43 transition count 266
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 42 transition count 265
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 42 transition count 264
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 15 place count 41 transition count 257
Applied a total of 15 rules in 42 ms. Remains 41 /45 variables (removed 4) and now considering 257/275 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 41/45 places, 257/275 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 350 steps, run visited all 1 properties in 4 ms. (steps per millisecond=87 )
Probabilistic random walk after 350 steps, saw 296 distinct states, run finished after 5 ms. (steps per millisecond=70 ) properties seen :1
FORMULA AutonomousCar-PT-07a-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0||X(F(p1))) U (G((!p0||X(F(p1))))||(p1&&(!p0||X(F(p1))))))))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 331
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 331
Applied a total of 6 rules in 7 ms. Remains 64 /67 variables (removed 3) and now considering 331/355 (removed 24) transitions.
// Phase 1: matrix 331 rows 64 cols
[2023-03-11 07:54:07] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-11 07:54:07] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-11 07:54:07] [INFO ] Invariant cache hit.
[2023-03-11 07:54:08] [INFO ] State equation strengthened by 157 read => feed constraints.
[2023-03-11 07:54:08] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2023-03-11 07:54:08] [INFO ] Invariant cache hit.
[2023-03-11 07:54:08] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/67 places, 331/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 840 ms. Remains : 64/67 places, 331/355 transitions.
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s31 1), p0:(AND (EQ s1 1) (EQ s7 1) (EQ s29 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1003 ms.
Product exploration explored 100000 steps with 50000 reset in 882 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-00 finished in 3465 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))||G(p1)) U p2))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 67 transition count 348
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 60 transition count 346
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 58 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 58 transition count 345
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 20 place count 57 transition count 345
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 54 transition count 321
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 54 transition count 321
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 52 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 51 transition count 319
Applied a total of 32 rules in 61 ms. Remains 51 /67 variables (removed 16) and now considering 319/355 (removed 36) transitions.
// Phase 1: matrix 319 rows 51 cols
[2023-03-11 07:54:11] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 07:54:11] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-11 07:54:11] [INFO ] Invariant cache hit.
[2023-03-11 07:54:11] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-11 07:54:11] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2023-03-11 07:54:11] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-11 07:54:11] [INFO ] Invariant cache hit.
[2023-03-11 07:54:11] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/67 places, 319/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 713 ms. Remains : 51/67 places, 319/355 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s4 1) (EQ s28 1) (EQ s47 1)), p1:(AND (EQ s1 1) (EQ s7 1) (EQ s29 1) (EQ s47 1)), p0:(AND (EQ s1 1) (EQ s7 1) (EQ s23 1) (EQ s47 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-01 finished in 888 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(F(p0))||G(p1))))'
Support contains 12 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 67 transition count 349
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 61 transition count 349
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 61 transition count 347
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 59 transition count 347
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 55 transition count 315
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 55 transition count 315
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 26 place count 54 transition count 315
Applied a total of 26 rules in 33 ms. Remains 54 /67 variables (removed 13) and now considering 315/355 (removed 40) transitions.
// Phase 1: matrix 315 rows 54 cols
[2023-03-11 07:54:12] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:54:12] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-11 07:54:12] [INFO ] Invariant cache hit.
[2023-03-11 07:54:12] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-11 07:54:12] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-11 07:54:12] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-11 07:54:12] [INFO ] Invariant cache hit.
[2023-03-11 07:54:12] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/67 places, 315/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 602 ms. Remains : 54/67 places, 315/355 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-02 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 s2 0) (EQ s41 0) (EQ s50 0)), p0:(OR (EQ s13 0) (EQ s20 0) (EQ s25 0) (EQ s30 0) (EQ s35 0) (EQ s40 0) (EQ s46 0) (EQ s51 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 372 reset in 108 ms.
Product exploration explored 100000 steps with 82 reset in 104 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 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 260 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 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 664 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-11 07:54:13] [INFO ] Invariant cache hit.
[2023-03-11 07:54:13] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:54:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-11 07:54:13] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND 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 219 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-07a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-02 finished in 1730 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||(X(F(p1)) U G(p2))))))'
Support contains 12 out of 67 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 67 transition count 349
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 61 transition count 349
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 61 transition count 347
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 59 transition count 347
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 56 transition count 323
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 56 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 55 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 54 transition count 322
Applied a total of 26 rules in 24 ms. Remains 54 /67 variables (removed 13) and now considering 322/355 (removed 33) transitions.
// Phase 1: matrix 322 rows 54 cols
[2023-03-11 07:54:13] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:54:13] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 07:54:13] [INFO ] Invariant cache hit.
[2023-03-11 07:54:13] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-11 07:54:14] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-11 07:54:14] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-11 07:54:14] [INFO ] Invariant cache hit.
[2023-03-11 07:54:14] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/67 places, 322/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 54/67 places, 322/355 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s6 1) (EQ s36 1) (EQ s50 1)), p0:(AND (EQ s12 1) (EQ s19 1) (EQ s24 1) (EQ s29 1) (EQ s35 1) (EQ s41 1) (EQ s46 1) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 4 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-03 finished in 587 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(G(p0)))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 323
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 323
Applied a total of 8 rules in 2 ms. Remains 63 /67 variables (removed 4) and now considering 323/355 (removed 32) transitions.
// Phase 1: matrix 323 rows 63 cols
[2023-03-11 07:54:14] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 07:54:14] [INFO ] Implicit Places using invariants in 124 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/67 places, 323/355 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 62/67 places, 323/355 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-05 finished in 238 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 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 355/355 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 67 transition count 347
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 59 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 58 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 58 transition count 345
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 20 place count 57 transition count 345
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 54 transition count 321
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 54 transition count 321
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 28 place count 53 transition count 320
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 30 place count 52 transition count 320
Applied a total of 30 rules in 43 ms. Remains 52 /67 variables (removed 15) and now considering 320/355 (removed 35) transitions.
// Phase 1: matrix 320 rows 52 cols
[2023-03-11 07:54:14] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 07:54:14] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-11 07:54:14] [INFO ] Invariant cache hit.
[2023-03-11 07:54:14] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-11 07:54:14] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-11 07:54:14] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 07:54:14] [INFO ] Invariant cache hit.
[2023-03-11 07:54:15] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/67 places, 320/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 567 ms. Remains : 52/67 places, 320/355 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-07 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 (AND (EQ s1 1) (EQ s6 1) (EQ s30 1) (EQ s48 1)) (AND (EQ s1 1) (EQ s6 1) (EQ s30 1) (EQ s48 1) (EQ s2 1) (EQ s24 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-07 finished in 658 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 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 355/355 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 67 transition count 347
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 59 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 58 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 58 transition count 345
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 20 place count 57 transition count 345
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 54 transition count 321
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 54 transition count 321
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 52 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 51 transition count 319
Applied a total of 32 rules in 30 ms. Remains 51 /67 variables (removed 16) and now considering 319/355 (removed 36) transitions.
// Phase 1: matrix 319 rows 51 cols
[2023-03-11 07:54:15] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:54:15] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 07:54:15] [INFO ] Invariant cache hit.
[2023-03-11 07:54:15] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-11 07:54:15] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-11 07:54:15] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 07:54:15] [INFO ] Invariant cache hit.
[2023-03-11 07:54:15] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/67 places, 319/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 418 ms. Remains : 51/67 places, 319/355 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s1 1) (EQ s4 1) (EQ s29 1) (EQ s47 1)) (AND (EQ s1 1) (EQ s4 1) (EQ s21 1) (EQ s47 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-08 finished in 490 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(p1)||p0) U (X(p2) U p3)))'
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 65 transition count 339
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 339
Applied a total of 4 rules in 2 ms. Remains 65 /67 variables (removed 2) and now considering 339/355 (removed 16) transitions.
// Phase 1: matrix 339 rows 65 cols
[2023-03-11 07:54:15] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 07:54:15] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-11 07:54:15] [INFO ] Invariant cache hit.
[2023-03-11 07:54:15] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-03-11 07:54:16] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2023-03-11 07:54:16] [INFO ] Invariant cache hit.
[2023-03-11 07:54:16] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/67 places, 339/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 599 ms. Remains : 65/67 places, 339/355 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p3), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p3:(AND (EQ s1 1) (EQ s9 1) (EQ s27 1) (EQ s60 1)), p0:(OR (AND (EQ s1 1) (EQ s10 1) (EQ s15 1) (EQ s60 1)) (AND (EQ s1 1) (EQ s9 1) (EQ s44 1) (EQ s60 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-12 finished in 815 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 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 355/355 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 67 transition count 347
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 59 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 59 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 58 transition count 346
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 54 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 54 transition count 314
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 52 transition count 312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 51 transition count 312
Applied a total of 32 rules in 48 ms. Remains 51 /67 variables (removed 16) and now considering 312/355 (removed 43) transitions.
// Phase 1: matrix 312 rows 51 cols
[2023-03-11 07:54:16] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 07:54:16] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-11 07:54:16] [INFO ] Invariant cache hit.
[2023-03-11 07:54:16] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-11 07:54:17] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-11 07:54:17] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 07:54:17] [INFO ] Invariant cache hit.
[2023-03-11 07:54:17] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/67 places, 312/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 663 ms. Remains : 51/67 places, 312/355 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-13 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 s9 1) (EQ s15 1) (EQ s47 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 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-13 finished in 709 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(F((X(p1)&&p0))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 355/355 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 63 transition count 323
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 63 transition count 323
Applied a total of 8 rules in 2 ms. Remains 63 /67 variables (removed 4) and now considering 323/355 (removed 32) transitions.
// Phase 1: matrix 323 rows 63 cols
[2023-03-11 07:54:17] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:54:17] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-11 07:54:17] [INFO ] Invariant cache hit.
[2023-03-11 07:54:17] [INFO ] State equation strengthened by 150 read => feed constraints.
[2023-03-11 07:54:17] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-11 07:54:17] [INFO ] Invariant cache hit.
[2023-03-11 07:54:17] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/67 places, 323/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 63/67 places, 323/355 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s41 1) (EQ s58 1)), p1:(AND (EQ s1 1) (EQ s7 1) (EQ s41 1) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-15 finished in 578 ms.
All properties solved by simple procedures.
Total runtime 21134 ms.

BK_STOP 1678521258048

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-07a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-07a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593400628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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