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.r009-oct2-167813598200636.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 ltsminxred
Input is AutonomousCar-PT-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:57 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 334K 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-07b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678638808509

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:33:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:33:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:33:31] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-12 16:33:31] [INFO ] Transformed 323 places.
[2023-03-12 16:33:31] [INFO ] Transformed 846 transitions.
[2023-03-12 16:33:31] [INFO ] Found NUPN structural information;
[2023-03-12 16:33:31] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 160 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 3 formulas.
FORMULA AutonomousCar-PT-07b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 276 transition count 799
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 276 transition count 799
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 290 place count 276 transition count 603
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 297 place count 269 transition count 596
Iterating global reduction 1 with 7 rules applied. Total rules applied 304 place count 269 transition count 596
Applied a total of 304 rules in 80 ms. Remains 269 /323 variables (removed 54) and now considering 596/846 (removed 250) transitions.
// Phase 1: matrix 596 rows 269 cols
[2023-03-12 16:33:31] [INFO ] Computed 12 place invariants in 16 ms
[2023-03-12 16:33:31] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-12 16:33:31] [INFO ] Invariant cache hit.
[2023-03-12 16:33:32] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2023-03-12 16:33:32] [INFO ] Invariant cache hit.
[2023-03-12 16:33:32] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/323 places, 596/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1418 ms. Remains : 269/323 places, 596/846 transitions.
Support contains 41 out of 269 places after structural reductions.
[2023-03-12 16:33:33] [INFO ] Flatten gal took : 169 ms
[2023-03-12 16:33:33] [INFO ] Flatten gal took : 90 ms
[2023-03-12 16:33:33] [INFO ] Input system was already deterministic with 596 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 27) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-12 16:33:33] [INFO ] Invariant cache hit.
[2023-03-12 16:33:34] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:33:35] [INFO ] After 1513ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:16
[2023-03-12 16:33:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-12 16:33:37] [INFO ] After 1288ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2023-03-12 16:33:37] [INFO ] Deduced a trap composed of 31 places in 334 ms of which 8 ms to minimize.
[2023-03-12 16:33:38] [INFO ] Deduced a trap composed of 45 places in 287 ms of which 21 ms to minimize.
[2023-03-12 16:33:38] [INFO ] Deduced a trap composed of 46 places in 380 ms of which 15 ms to minimize.
[2023-03-12 16:33:39] [INFO ] Deduced a trap composed of 31 places in 366 ms of which 14 ms to minimize.
[2023-03-12 16:33:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1580 ms
[2023-03-12 16:33:40] [INFO ] Deduced a trap composed of 31 places in 414 ms of which 14 ms to minimize.
[2023-03-12 16:33:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 428 ms
[2023-03-12 16:33:40] [INFO ] After 4802ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :15
Attempting to minimize the solution found.
Minimization took 811 ms.
[2023-03-12 16:33:41] [INFO ] After 6119ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :15
Fused 18 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 244 ms.
Support contains 30 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 596/596 transitions.
Graph (trivial) has 214 edges and 269 vertex of which 4 / 269 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1088 edges and 267 vertex of which 265 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 95 rules applied. Total rules applied 97 place count 265 transition count 497
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 138 rules applied. Total rules applied 235 place count 171 transition count 453
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 261 place count 145 transition count 453
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 261 place count 145 transition count 447
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 273 place count 139 transition count 447
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 276 place count 136 transition count 444
Iterating global reduction 3 with 3 rules applied. Total rules applied 279 place count 136 transition count 444
Performed 44 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 367 place count 92 transition count 399
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 371 place count 88 transition count 377
Iterating global reduction 3 with 4 rules applied. Total rules applied 375 place count 88 transition count 377
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 378 place count 88 transition count 374
Free-agglomeration rule applied 18 times.
Iterating global reduction 4 with 18 rules applied. Total rules applied 396 place count 88 transition count 356
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 414 place count 70 transition count 356
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 420 place count 70 transition count 356
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 421 place count 69 transition count 355
Applied a total of 421 rules in 165 ms. Remains 69 /269 variables (removed 200) and now considering 355/596 (removed 241) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 69/269 places, 355/596 transitions.
Incomplete random walk after 10000 steps, including 228 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 355 rows 69 cols
[2023-03-12 16:33:42] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:33:42] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:33:43] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:33:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:33:44] [INFO ] After 918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:33:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:33:44] [INFO ] After 88ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 16:33:44] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-12 16:33:44] [INFO ] After 1759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 14 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 355/355 transitions.
Graph (complete) has 653 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 64 transition count 350
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 15 place count 60 transition count 346
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 60 transition count 342
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 51 place count 56 transition count 314
Applied a total of 51 rules in 48 ms. Remains 56 /69 variables (removed 13) and now considering 314/355 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 56/69 places, 314/355 transitions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 314 rows 56 cols
[2023-03-12 16:33:45] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:33:45] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:33:45] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:33:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-12 16:33:45] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:33:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:33:45] [INFO ] After 31ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:33:45] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-12 16:33:45] [INFO ] After 481ms 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 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 314/314 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 56 transition count 313
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 54 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 54 transition count 305
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 50 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 47 transition count 298
Applied a total of 18 rules in 50 ms. Remains 47 /56 variables (removed 9) and now considering 298/314 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 47/56 places, 298/314 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 283286 steps, run visited all 1 properties in 475 ms. (steps per millisecond=596 )
Probabilistic random walk after 283286 steps, saw 44444 distinct states, run finished after 475 ms. (steps per millisecond=596 ) properties seen :1
FORMULA AutonomousCar-PT-07b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-07b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 45 stabilizing places and 46 stable transitions
FORMULA AutonomousCar-PT-07b-LTLFireability-04 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' '!(G((X((F((!p2 U (p3||G(!p2))))&&p1))||p0)))'
Support contains 13 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 596/596 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 265 transition count 592
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 265 transition count 592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 263 transition count 590
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 263 transition count 590
Applied a total of 12 rules in 52 ms. Remains 263 /269 variables (removed 6) and now considering 590/596 (removed 6) transitions.
// Phase 1: matrix 590 rows 263 cols
[2023-03-12 16:33:47] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:33:47] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-12 16:33:47] [INFO ] Invariant cache hit.
[2023-03-12 16:33:47] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-12 16:33:47] [INFO ] Invariant cache hit.
[2023-03-12 16:33:47] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 590/596 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 814 ms. Remains : 263/269 places, 590/596 transitions.
Stuttering acceptance computed with spot in 457 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND p2 (NOT p3))), true, (AND (NOT p3) p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s58 1) (EQ s78 1) (EQ s103 1) (EQ s128 1) (EQ s158 1) (EQ s178 1) (EQ s208 1) (EQ s230 1)) (AND (EQ s4 1) (EQ s12 1) (EQ s39 1) (EQ s229 1...], 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 2 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-00 finished in 1408 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 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 596/596 transitions.
Graph (trivial) has 254 edges and 269 vertex of which 4 / 269 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 266 transition count 492
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 145 rules applied. Total rules applied 247 place count 165 transition count 448
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 273 place count 139 transition count 448
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 273 place count 139 transition count 443
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 283 place count 134 transition count 443
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 287 place count 130 transition count 439
Iterating global reduction 3 with 4 rules applied. Total rules applied 291 place count 130 transition count 439
Performed 57 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 405 place count 73 transition count 381
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 419 place count 59 transition count 282
Iterating global reduction 3 with 14 rules applied. Total rules applied 433 place count 59 transition count 282
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 439 place count 59 transition count 276
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 4 with 2 rules applied. Total rules applied 441 place count 58 transition count 275
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 442 place count 58 transition count 275
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 444 place count 56 transition count 273
Applied a total of 444 rules in 164 ms. Remains 56 /269 variables (removed 213) and now considering 273/596 (removed 323) transitions.
// Phase 1: matrix 273 rows 56 cols
[2023-03-12 16:33:48] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:33:48] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-12 16:33:48] [INFO ] Invariant cache hit.
[2023-03-12 16:33:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:33:49] [INFO ] Implicit Places using invariants and state equation in 408 ms returned [51, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 617 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/269 places, 273/596 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 272
Applied a total of 2 rules in 12 ms. Remains 53 /54 variables (removed 1) and now considering 272/273 (removed 1) transitions.
// Phase 1: matrix 272 rows 53 cols
[2023-03-12 16:33:49] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:33:49] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-12 16:33:49] [INFO ] Invariant cache hit.
[2023-03-12 16:33:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:33:49] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/269 places, 272/596 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1485 ms. Remains : 53/269 places, 272/596 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-01 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:(AND (EQ s1 1) (EQ s8 1) (EQ s21 1) (EQ s49 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 12 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-01 finished in 1650 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)&&(p0||G(p1))) U X(p0)))'
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 596/596 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 265 transition count 592
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 265 transition count 592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 263 transition count 590
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 263 transition count 590
Applied a total of 12 rules in 23 ms. Remains 263 /269 variables (removed 6) and now considering 590/596 (removed 6) transitions.
// Phase 1: matrix 590 rows 263 cols
[2023-03-12 16:33:50] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:33:50] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-12 16:33:50] [INFO ] Invariant cache hit.
[2023-03-12 16:33:50] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2023-03-12 16:33:50] [INFO ] Invariant cache hit.
[2023-03-12 16:33:51] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 590/596 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1155 ms. Remains : 263/269 places, 590/596 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s15 1) (EQ s52 1) (EQ s229 1)), p1:(AND (EQ s4 1) (EQ s11 1) (EQ s129 1) (EQ s229 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-02 finished in 1519 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(F((p0||(p1&&G(p2))))))))'
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 596/596 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 593
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 593
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 265 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 265 transition count 592
Applied a total of 8 rules in 23 ms. Remains 265 /269 variables (removed 4) and now considering 592/596 (removed 4) transitions.
// Phase 1: matrix 592 rows 265 cols
[2023-03-12 16:33:51] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:33:51] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-12 16:33:51] [INFO ] Invariant cache hit.
[2023-03-12 16:33:52] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2023-03-12 16:33:52] [INFO ] Invariant cache hit.
[2023-03-12 16:33:52] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 265/269 places, 592/596 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 982 ms. Remains : 265/269 places, 592/596 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (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-07b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s159 0), p1:(EQ s156 0), p2:(OR (EQ s4 0) (EQ s6 0) (EQ s206 0) (EQ s231 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 344 ms.
Product exploration explored 100000 steps with 25000 reset in 367 ms.
Computed a total of 44 stabilizing places and 45 stable transitions
Computed a total of 44 stabilizing places and 45 stable transitions
Detected a total of 44/265 stabilizing places and 45/592 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 97 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:33:54] [INFO ] Invariant cache hit.
[2023-03-12 16:33:54] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:33:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 16:33:54] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:33:55] [INFO ] Deduced a trap composed of 32 places in 446 ms of which 0 ms to minimize.
[2023-03-12 16:33:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 466 ms
[2023-03-12 16:33:55] [INFO ] After 767ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-12 16:33:55] [INFO ] After 828ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), true, (F (OR (G p0) (G (NOT p0)))), (G (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND p1 (NOT p0) p2))]
Property proved to be true thanks to knowledge :(G (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))
Knowledge based reduction with 5 factoid took 266 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLFireability-03 finished in 3997 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(p0))'
Support contains 8 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 596/596 transitions.
Graph (trivial) has 241 edges and 269 vertex of which 4 / 269 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 266 transition count 492
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 145 rules applied. Total rules applied 247 place count 165 transition count 448
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 273 place count 139 transition count 448
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 273 place count 139 transition count 443
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 283 place count 134 transition count 443
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 287 place count 130 transition count 439
Iterating global reduction 3 with 4 rules applied. Total rules applied 291 place count 130 transition count 439
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 393 place count 79 transition count 387
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 404 place count 68 transition count 313
Iterating global reduction 3 with 11 rules applied. Total rules applied 415 place count 68 transition count 313
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 422 place count 68 transition count 306
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 4 with 2 rules applied. Total rules applied 424 place count 67 transition count 305
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 426 place count 65 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 427 place count 64 transition count 303
Applied a total of 427 rules in 121 ms. Remains 64 /269 variables (removed 205) and now considering 303/596 (removed 293) transitions.
// Phase 1: matrix 303 rows 64 cols
[2023-03-12 16:33:55] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-12 16:33:55] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-12 16:33:55] [INFO ] Invariant cache hit.
[2023-03-12 16:33:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:33:56] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 341 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/269 places, 303/596 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 302
Applied a total of 2 rules in 24 ms. Remains 61 /62 variables (removed 1) and now considering 302/303 (removed 1) transitions.
// Phase 1: matrix 302 rows 61 cols
[2023-03-12 16:33:56] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-12 16:33:56] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-12 16:33:56] [INFO ] Invariant cache hit.
[2023-03-12 16:33:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:33:56] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/269 places, 302/596 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 956 ms. Remains : 61/269 places, 302/596 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-05 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}]], initial=1, aps=[p0:(OR (NEQ s11 1) (NEQ s20 1) (NEQ s24 1) (NEQ s33 1) (NEQ s37 1) (NEQ s44 1) (NEQ s53 1) (NEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 199 reset in 106 ms.
Product exploration explored 100000 steps with 148 reset in 102 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 274 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 71 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 432 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Finished Best-First random walk after 4351 steps, including 26 resets, run visited all 1 properties in 5 ms. (steps per millisecond=870 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07b-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLFireability-05 finished in 1842 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)&&G(F((p0||G((p1||X(p0))))))))'
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 596/596 transitions.
Graph (trivial) has 253 edges and 269 vertex of which 4 / 269 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 266 transition count 493
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 144 rules applied. Total rules applied 245 place count 166 transition count 449
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 271 place count 140 transition count 449
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 271 place count 140 transition count 444
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 135 transition count 444
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 285 place count 131 transition count 440
Iterating global reduction 3 with 4 rules applied. Total rules applied 289 place count 131 transition count 440
Performed 57 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 403 place count 74 transition count 382
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 416 place count 61 transition count 290
Iterating global reduction 3 with 13 rules applied. Total rules applied 429 place count 61 transition count 290
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 434 place count 61 transition count 285
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 4 with 2 rules applied. Total rules applied 436 place count 60 transition count 284
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 437 place count 60 transition count 284
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 439 place count 58 transition count 282
Applied a total of 439 rules in 114 ms. Remains 58 /269 variables (removed 211) and now considering 282/596 (removed 314) transitions.
// Phase 1: matrix 282 rows 58 cols
[2023-03-12 16:33:57] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 16:33:57] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-12 16:33:57] [INFO ] Invariant cache hit.
[2023-03-12 16:33:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:33:58] [INFO ] Implicit Places using invariants and state equation in 240 ms returned [53, 57]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 477 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/269 places, 282/596 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 281
Applied a total of 2 rules in 34 ms. Remains 55 /56 variables (removed 1) and now considering 281/282 (removed 1) transitions.
// Phase 1: matrix 281 rows 55 cols
[2023-03-12 16:33:58] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:33:58] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-12 16:33:58] [INFO ] Invariant cache hit.
[2023-03-12 16:33:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:33:58] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/269 places, 281/596 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1095 ms. Remains : 55/269 places, 281/596 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s4 1) (EQ s42 1) (EQ s51 1)), p1:(AND (EQ s1 1) (EQ s5 1) (EQ s36 1) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-08 finished in 1446 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((p0&&(p1 U G(p2)))))'
Support contains 10 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 596/596 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 267 transition count 594
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 267 transition count 594
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 265 transition count 592
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 265 transition count 592
Applied a total of 8 rules in 32 ms. Remains 265 /269 variables (removed 4) and now considering 592/596 (removed 4) transitions.
// Phase 1: matrix 592 rows 265 cols
[2023-03-12 16:33:58] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:33:59] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-12 16:33:59] [INFO ] Invariant cache hit.
[2023-03-12 16:33:59] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2023-03-12 16:33:59] [INFO ] Invariant cache hit.
[2023-03-12 16:34:00] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 265/269 places, 592/596 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1411 ms. Remains : 265/269 places, 592/596 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s204 0), p2:(AND (EQ s53 1) (EQ s78 1) (EQ s103 1) (EQ s133 1) (EQ s158 1) (EQ s183 1) (EQ s203 1) (EQ s231 1)), p1:(NEQ s226 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 93 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-10 finished in 1734 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(p0)))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 596/596 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 265 transition count 592
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 265 transition count 592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 263 transition count 590
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 263 transition count 590
Applied a total of 12 rules in 20 ms. Remains 263 /269 variables (removed 6) and now considering 590/596 (removed 6) transitions.
// Phase 1: matrix 590 rows 263 cols
[2023-03-12 16:34:00] [INFO ] Computed 12 place invariants in 20 ms
[2023-03-12 16:34:00] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-12 16:34:00] [INFO ] Invariant cache hit.
[2023-03-12 16:34:01] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2023-03-12 16:34:01] [INFO ] Invariant cache hit.
[2023-03-12 16:34:01] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 590/596 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 919 ms. Remains : 263/269 places, 590/596 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s6 1) (EQ s139 1) (EQ s229 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-12 finished in 1046 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(F(p0)))))'
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 596/596 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 265 transition count 592
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 265 transition count 592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 263 transition count 590
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 263 transition count 590
Applied a total of 12 rules in 21 ms. Remains 263 /269 variables (removed 6) and now considering 590/596 (removed 6) transitions.
[2023-03-12 16:34:01] [INFO ] Invariant cache hit.
[2023-03-12 16:34:01] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-12 16:34:01] [INFO ] Invariant cache hit.
[2023-03-12 16:34:02] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2023-03-12 16:34:02] [INFO ] Invariant cache hit.
[2023-03-12 16:34:02] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 590/596 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1059 ms. Remains : 263/269 places, 590/596 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s97 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-14 finished in 1332 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(p0)))'
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 596/596 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 593
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 593
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 265 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 265 transition count 592
Applied a total of 8 rules in 24 ms. Remains 265 /269 variables (removed 4) and now considering 592/596 (removed 4) transitions.
// Phase 1: matrix 592 rows 265 cols
[2023-03-12 16:34:03] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-12 16:34:03] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-12 16:34:03] [INFO ] Invariant cache hit.
[2023-03-12 16:34:04] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
[2023-03-12 16:34:04] [INFO ] Invariant cache hit.
[2023-03-12 16:34:04] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 265/269 places, 592/596 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1395 ms. Remains : 265/269 places, 592/596 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s249 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 318 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-15 finished in 1563 ms.
All properties solved by simple procedures.
Total runtime 33695 ms.
ITS solved all properties within timeout

BK_STOP 1678638844753

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

+ 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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-07b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-07b, 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 r009-oct2-167813598200636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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