Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463873000516.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r294-smll-165463873000516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 7.4K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 7 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 7.6K Jun 7 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 7 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Jun 7 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 121K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 334K Jun 3 16:02 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 1654906954092

Running Version 202205111006
[2022-06-11 00:22:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 00:22:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 00:22:36] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2022-06-11 00:22:36] [INFO ] Transformed 323 places.
[2022-06-11 00:22:36] [INFO ] Transformed 846 transitions.
[2022-06-11 00:22:36] [INFO ] Found NUPN structural information;
[2022-06-11 00:22:36] [INFO ] Parsed PT model containing 323 places and 846 transitions in 421 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-07b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 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 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 298 place count 268 transition count 595
Iterating global reduction 1 with 8 rules applied. Total rules applied 306 place count 268 transition count 595
Applied a total of 306 rules in 98 ms. Remains 268 /323 variables (removed 55) and now considering 595/846 (removed 251) transitions.
// Phase 1: matrix 595 rows 268 cols
[2022-06-11 00:22:36] [INFO ] Computed 12 place invariants in 34 ms
[2022-06-11 00:22:37] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 595 rows 268 cols
[2022-06-11 00:22:37] [INFO ] Computed 12 place invariants in 7 ms
[2022-06-11 00:22:37] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
// Phase 1: matrix 595 rows 268 cols
[2022-06-11 00:22:37] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 00:22:37] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/323 places, 595/846 transitions.
Finished structural reductions, in 1 iterations. Remains : 268/323 places, 595/846 transitions.
Support contains 54 out of 268 places after structural reductions.
[2022-06-11 00:22:38] [INFO ] Flatten gal took : 160 ms
[2022-06-11 00:22:38] [INFO ] Flatten gal took : 92 ms
[2022-06-11 00:22:38] [INFO ] Input system was already deterministic with 595 transitions.
Support contains 51 out of 268 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 783 ms. (steps per millisecond=12 ) properties (out of 31) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 595 rows 268 cols
[2022-06-11 00:22:39] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 00:22:40] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2022-06-11 00:22:41] [INFO ] After 1030ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:17
[2022-06-11 00:22:42] [INFO ] Deduced a trap composed of 31 places in 333 ms of which 10 ms to minimize.
[2022-06-11 00:22:42] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 3 ms to minimize.
[2022-06-11 00:22:42] [INFO ] Deduced a trap composed of 14 places in 291 ms of which 2 ms to minimize.
[2022-06-11 00:22:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1095 ms
[2022-06-11 00:22:42] [INFO ] After 2226ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:19
[2022-06-11 00:22:42] [INFO ] After 2664ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:19
[2022-06-11 00:22:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-06-11 00:22:44] [INFO ] After 1320ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :19
[2022-06-11 00:22:44] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 2 ms to minimize.
[2022-06-11 00:22:45] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 2 ms to minimize.
[2022-06-11 00:22:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 540 ms
[2022-06-11 00:22:46] [INFO ] After 3009ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :19
Attempting to minimize the solution found.
Minimization took 866 ms.
[2022-06-11 00:22:47] [INFO ] After 4260ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :19
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 343 ms.
Support contains 37 out of 268 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 268/268 places, 595/595 transitions.
Graph (trivial) has 205 edges and 268 vertex of which 4 / 268 are part of one of the 2 SCC in 9 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1087 edges and 266 vertex of which 264 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 89 rules applied. Total rules applied 91 place count 264 transition count 502
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 129 rules applied. Total rules applied 220 place count 176 transition count 461
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 245 place count 152 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 246 place count 151 transition count 460
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 246 place count 151 transition count 454
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 258 place count 145 transition count 454
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 259 place count 144 transition count 453
Iterating global reduction 4 with 1 rules applied. Total rules applied 260 place count 144 transition count 453
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 342 place count 103 transition count 412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 343 place count 103 transition count 411
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 345 place count 101 transition count 397
Iterating global reduction 5 with 2 rules applied. Total rules applied 347 place count 101 transition count 397
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 349 place count 101 transition count 395
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 6 with 2 rules applied. Total rules applied 351 place count 100 transition count 394
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 352 place count 100 transition count 393
Free-agglomeration rule applied 20 times.
Iterating global reduction 6 with 20 rules applied. Total rules applied 372 place count 100 transition count 373
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 392 place count 80 transition count 373
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 398 place count 80 transition count 373
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 399 place count 79 transition count 372
Applied a total of 399 rules in 215 ms. Remains 79 /268 variables (removed 189) and now considering 372/595 (removed 223) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/268 places, 372/595 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 19) seen :12
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 372 rows 79 cols
[2022-06-11 00:22:48] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-11 00:22:48] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-11 00:22:48] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 00:22:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-11 00:22:48] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 00:22:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 00:22:49] [INFO ] After 72ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 00:22:49] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-06-11 00:22:49] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 7 out of 79 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 79/79 places, 372/372 transitions.
Graph (complete) has 704 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 78 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 76 transition count 368
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 76 transition count 365
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 73 transition count 365
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 71 transition count 363
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 71 transition count 363
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 61 transition count 353
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 50 place count 54 transition count 346
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 54 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 2 with 32 rules applied. Total rules applied 86 place count 50 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 49 transition count 313
Applied a total of 87 rules in 80 ms. Remains 49 /79 variables (removed 30) and now considering 313/372 (removed 59) transitions.
Finished structural reductions, in 1 iterations. Remains : 49/79 places, 313/372 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1648102 steps, run timeout after 3001 ms. (steps per millisecond=549 ) properties seen :{1=1}
Probabilistic random walk after 1648102 steps, saw 231070 distinct states, run finished after 3004 ms. (steps per millisecond=548 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 313 rows 49 cols
[2022-06-11 00:22:52] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:22:52] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-06-11 00:22:52] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 00:22:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-06-11 00:22:52] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 00:22:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 00:22:52] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 00:22:52] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-11 00:22:53] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 49 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 49/49 places, 313/313 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 305
Applied a total of 2 rules in 22 ms. Remains 48 /49 variables (removed 1) and now considering 305/313 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/49 places, 305/313 transitions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1885342 steps, run timeout after 3001 ms. (steps per millisecond=628 ) properties seen :{}
Probabilistic random walk after 1885342 steps, saw 259269 distinct states, run finished after 3002 ms. (steps per millisecond=628 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 305 rows 48 cols
[2022-06-11 00:22:56] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 00:22:56] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-06-11 00:22:56] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 00:22:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-06-11 00:22:56] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 00:22:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 00:22:56] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 00:22:56] [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 32 ms.
[2022-06-11 00:22:56] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 305/305 transitions.
Applied a total of 0 rules in 15 ms. Remains 48 /48 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 305/305 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 305/305 transitions.
Applied a total of 0 rules in 12 ms. Remains 48 /48 variables (removed 0) and now considering 305/305 (removed 0) transitions.
// Phase 1: matrix 305 rows 48 cols
[2022-06-11 00:22:56] [INFO ] Computed 12 place invariants in 1 ms
[2022-06-11 00:22:56] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 305 rows 48 cols
[2022-06-11 00:22:56] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 00:22:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 00:22:56] [INFO ] Implicit Places using invariants and state equation in 248 ms returned [43, 47]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 353 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 46/48 places, 304/305 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 45 transition count 303
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 44 transition count 302
Applied a total of 4 rules in 26 ms. Remains 44 /46 variables (removed 2) and now considering 302/304 (removed 2) transitions.
// Phase 1: matrix 302 rows 44 cols
[2022-06-11 00:22:56] [INFO ] Computed 10 place invariants in 1 ms
[2022-06-11 00:22:57] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 302 rows 44 cols
[2022-06-11 00:22:57] [INFO ] Computed 10 place invariants in 4 ms
[2022-06-11 00:22:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 00:22:57] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 44/48 places, 302/305 transitions.
Finished structural reductions, in 2 iterations. Remains : 44/48 places, 302/305 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2008174 steps, run timeout after 3001 ms. (steps per millisecond=669 ) properties seen :{}
Probabilistic random walk after 2008174 steps, saw 280762 distinct states, run finished after 3001 ms. (steps per millisecond=669 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 302 rows 44 cols
[2022-06-11 00:23:00] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 00:23:00] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-11 00:23:00] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 00:23:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-11 00:23:00] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 00:23:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 00:23:00] [INFO ] After 36ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 00:23:00] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-06-11 00:23:00] [INFO ] After 316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44/44 places, 302/302 transitions.
Applied a total of 0 rules in 18 ms. Remains 44 /44 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 44/44 places, 302/302 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 44/44 places, 302/302 transitions.
Applied a total of 0 rules in 17 ms. Remains 44 /44 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 44 cols
[2022-06-11 00:23:00] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 00:23:01] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 302 rows 44 cols
[2022-06-11 00:23:01] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 00:23:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 00:23:01] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2022-06-11 00:23:01] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 302 rows 44 cols
[2022-06-11 00:23:01] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 00:23:01] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/44 places, 302/302 transitions.
Graph (complete) has 557 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 301
Applied a total of 2 rules in 21 ms. Remains 43 /44 variables (removed 1) and now considering 301/302 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 301 rows 43 cols
[2022-06-11 00:23:01] [INFO ] Computed 10 place invariants in 3 ms
[2022-06-11 00:23:01] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-11 00:23:01] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 00:23:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-11 00:23:02] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 00:23:02] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-06-11 00:23:02] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 00:23:02] [INFO ] Flatten gal took : 68 ms
[2022-06-11 00:23:02] [INFO ] Flatten gal took : 53 ms
[2022-06-11 00:23:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2741734440782521481.gal : 19 ms
[2022-06-11 00:23:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9863194461381174544.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5426092528776815655;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2741734440782521481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9863194461381174544.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality9863194461381174544.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22 after 190
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :190 after 646
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :646 after 4602
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4602 after 5178
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5178 after 18016
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :18016 after 26022
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :26022 after 48330
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :48330 after 155154
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :155154 after 434866
Reachability property AtomicPropp7 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.3129e+06,7.47577,152076,2,2692,20,357785,6,0,475,314148,0
Total reachable state count : 1312900

Verifying 1 reachability properties.
Reachability property AtomicPropp7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp7,1,7.47753,152076,2,44,20,357785,7,0,490,314148,0
FORMULA AutonomousCar-PT-07b-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA AutonomousCar-PT-07b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 44 stabilizing places and 45 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(F((F(((p0 U p1)||p2))||p3)))||p1)) U p0))'
Support contains 7 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Graph (trivial) has 248 edges and 268 vertex of which 4 / 268 are part of one of the 2 SCC in 2 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 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 265 transition count 496
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 136 rules applied. Total rules applied 233 place count 169 transition count 456
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 258 place count 145 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 259 place count 144 transition count 455
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 259 place count 144 transition count 449
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 271 place count 138 transition count 449
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 274 place count 135 transition count 446
Iterating global reduction 4 with 3 rules applied. Total rules applied 277 place count 135 transition count 446
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 278 place count 134 transition count 439
Iterating global reduction 4 with 1 rules applied. Total rules applied 279 place count 134 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 281 place count 134 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 282 place count 133 transition count 437
Performed 56 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 394 place count 77 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 395 place count 77 transition count 379
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 407 place count 65 transition count 295
Iterating global reduction 7 with 12 rules applied. Total rules applied 419 place count 65 transition count 295
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 424 place count 65 transition count 290
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 8 with 4 rules applied. Total rules applied 428 place count 63 transition count 288
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 430 place count 61 transition count 286
Applied a total of 430 rules in 211 ms. Remains 61 /268 variables (removed 207) and now considering 286/595 (removed 309) transitions.
// Phase 1: matrix 286 rows 61 cols
[2022-06-11 00:23:10] [INFO ] Computed 11 place invariants in 3 ms
[2022-06-11 00:23:10] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 286 rows 61 cols
[2022-06-11 00:23:10] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-11 00:23:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 00:23:11] [INFO ] Implicit Places using invariants and state equation in 285 ms returned [56, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 431 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/268 places, 286/595 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 58 transition count 285
Applied a total of 2 rules in 47 ms. Remains 58 /59 variables (removed 1) and now considering 285/286 (removed 1) transitions.
// Phase 1: matrix 285 rows 58 cols
[2022-06-11 00:23:11] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-11 00:23:11] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 285 rows 58 cols
[2022-06-11 00:23:11] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-11 00:23:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 00:23:11] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/268 places, 285/595 transitions.
Finished structural reductions, in 2 iterations. Remains : 58/268 places, 285/595 transitions.
Stuttering acceptance computed with spot in 436 ms :[(NOT p0), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s12 1), p2:(AND (EQ s1 1) (EQ s9 1) (EQ s40 1) (EQ s54 1)), p3:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 84 steps with 5 reset in 8 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-00 finished in 1629 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Graph (trivial) has 251 edges and 268 vertex of which 4 / 268 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 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 265 transition count 495
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 139 rules applied. Total rules applied 237 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 262 place count 143 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 262 place count 143 transition count 447
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 274 place count 137 transition count 447
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 278 place count 133 transition count 443
Iterating global reduction 3 with 4 rules applied. Total rules applied 282 place count 133 transition count 443
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 283 place count 132 transition count 436
Iterating global reduction 3 with 1 rules applied. Total rules applied 284 place count 132 transition count 436
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 286 place count 132 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 287 place count 131 transition count 434
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 5 with 114 rules applied. Total rules applied 401 place count 74 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 402 place count 74 transition count 375
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 414 place count 62 transition count 291
Iterating global reduction 6 with 12 rules applied. Total rules applied 426 place count 62 transition count 291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 431 place count 62 transition count 286
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 7 with 4 rules applied. Total rules applied 435 place count 60 transition count 284
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 437 place count 58 transition count 282
Applied a total of 437 rules in 134 ms. Remains 58 /268 variables (removed 210) and now considering 282/595 (removed 313) transitions.
// Phase 1: matrix 282 rows 58 cols
[2022-06-11 00:23:12] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-11 00:23:12] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 282 rows 58 cols
[2022-06-11 00:23:12] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-11 00:23:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 00:23:12] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [53, 57]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 383 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/268 places, 282/595 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 55 transition count 281
Applied a total of 2 rules in 15 ms. Remains 55 /56 variables (removed 1) and now considering 281/282 (removed 1) transitions.
// Phase 1: matrix 281 rows 55 cols
[2022-06-11 00:23:12] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-11 00:23:12] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 281 rows 55 cols
[2022-06-11 00:23:12] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-11 00:23:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 00:23:12] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/268 places, 281/595 transitions.
Finished structural reductions, in 2 iterations. Remains : 55/268 places, 281/595 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(OR (EQ s1 0) (EQ s9 0) (EQ s45 0) (EQ s51 0)), p0:(AND (EQ s1 1) (EQ s5 1) (EQ s45 1) (EQ s51 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-04 finished in 973 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(X(F(F((X(p0) U p1)))))))))'
Support contains 4 out of 268 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 591
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 263 transition count 590
Applied a total of 10 rules in 22 ms. Remains 263 /268 variables (removed 5) and now considering 590/595 (removed 5) transitions.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:12] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 00:23:13] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:13] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 00:23:13] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:13] [INFO ] Computed 12 place invariants in 7 ms
[2022-06-11 00:23:14] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/268 places, 590/595 transitions.
Finished structural reductions, in 1 iterations. Remains : 263/268 places, 590/595 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), 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=[p1:(AND (EQ s4 1) (EQ s6 1) (EQ s202 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, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-05 finished in 1704 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(X(((p0 U !p1)||p2)))))))'
Support contains 5 out of 268 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 591
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 263 transition count 590
Applied a total of 10 rules in 21 ms. Remains 263 /268 variables (removed 5) and now considering 590/595 (removed 5) transitions.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:14] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 00:23:14] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:14] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 00:23:15] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:15] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 00:23:16] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/268 places, 590/595 transitions.
Finished structural reductions, in 1 iterations. Remains : 263/268 places, 590/595 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(EQ s94 1), p1:(AND (EQ s4 1) (EQ s11 1) (EQ s89 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, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 517 ms.
Product exploration explored 100000 steps with 20000 reset in 320 ms.
Computed a total of 42 stabilizing places and 43 stable transitions
Computed a total of 42 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 163 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 924772 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :{}
Probabilistic random walk after 924772 steps, saw 152282 distinct states, run finished after 3003 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:20] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:20] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-06-11 00:23:20] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 00:23:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-06-11 00:23:21] [INFO ] After 319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 00:23:21] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 1 ms to minimize.
[2022-06-11 00:23:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2022-06-11 00:23:21] [INFO ] After 589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-06-11 00:23:21] [INFO ] After 719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 263/263 places, 590/590 transitions.
Graph (trivial) has 245 edges and 263 vertex of which 4 / 263 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1082 edges and 261 vertex of which 259 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 95 rules applied. Total rules applied 97 place count 259 transition count 491
Reduce places removed 93 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 134 rules applied. Total rules applied 231 place count 166 transition count 450
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 256 place count 142 transition count 449
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 259 place count 141 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 260 place count 140 transition count 447
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 260 place count 140 transition count 441
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 272 place count 134 transition count 441
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 394 place count 73 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 395 place count 73 transition count 379
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 409 place count 59 transition count 280
Iterating global reduction 6 with 14 rules applied. Total rules applied 423 place count 59 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 429 place count 59 transition count 274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 431 place count 58 transition count 273
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 439 place count 58 transition count 265
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 447 place count 50 transition count 265
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 448 place count 50 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 449 place count 49 transition count 264
Applied a total of 449 rules in 77 ms. Remains 49 /263 variables (removed 214) and now considering 264/590 (removed 326) transitions.
Finished structural reductions, in 1 iterations. Remains : 49/263 places, 264/590 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 206367 steps, run visited all 1 properties in 357 ms. (steps per millisecond=578 )
Probabilistic random walk after 206367 steps, saw 35173 distinct states, run finished after 358 ms. (steps per millisecond=576 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p1)), true]
False Knowledge obtained : [(F (AND p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 165 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 5 out of 263 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 590/590 transitions.
Applied a total of 0 rules in 4 ms. Remains 263 /263 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:22] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 00:23:22] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:22] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 00:23:23] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:23] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 00:23:23] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 263/263 places, 590/590 transitions.
Computed a total of 42 stabilizing places and 43 stable transitions
Computed a total of 42 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 212 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 90 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 807537 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :{}
Probabilistic random walk after 807537 steps, saw 134881 distinct states, run finished after 3006 ms. (steps per millisecond=268 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:26] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:26] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-06-11 00:23:27] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 00:23:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-06-11 00:23:27] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 00:23:27] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 1 ms to minimize.
[2022-06-11 00:23:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2022-06-11 00:23:27] [INFO ] After 597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-06-11 00:23:27] [INFO ] After 721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 263/263 places, 590/590 transitions.
Graph (trivial) has 245 edges and 263 vertex of which 4 / 263 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1082 edges and 261 vertex of which 259 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 95 rules applied. Total rules applied 97 place count 259 transition count 491
Reduce places removed 93 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 134 rules applied. Total rules applied 231 place count 166 transition count 450
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 256 place count 142 transition count 449
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 259 place count 141 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 260 place count 140 transition count 447
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 260 place count 140 transition count 441
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 272 place count 134 transition count 441
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 394 place count 73 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 395 place count 73 transition count 379
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 409 place count 59 transition count 280
Iterating global reduction 6 with 14 rules applied. Total rules applied 423 place count 59 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 429 place count 59 transition count 274
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 7 with 2 rules applied. Total rules applied 431 place count 58 transition count 273
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 439 place count 58 transition count 265
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 447 place count 50 transition count 265
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 448 place count 50 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 449 place count 49 transition count 264
Applied a total of 449 rules in 82 ms. Remains 49 /263 variables (removed 214) and now considering 264/590 (removed 326) transitions.
Finished structural reductions, in 1 iterations. Remains : 49/263 places, 264/590 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 206367 steps, run visited all 1 properties in 358 ms. (steps per millisecond=576 )
Probabilistic random walk after 206367 steps, saw 35173 distinct states, run finished after 359 ms. (steps per millisecond=574 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (AND p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 203 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 189 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 180 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 20000 reset in 209 ms.
Product exploration explored 100000 steps with 20000 reset in 429 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 226 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 5 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 590/590 transitions.
Graph (trivial) has 245 edges and 263 vertex of which 4 / 263 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.
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 261 transition count 588
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 111 place count 261 transition count 571
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 111 place count 261 transition count 571
Deduced a syphon composed of 112 places in 1 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 130 place count 261 transition count 571
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 207 place count 184 transition count 494
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 284 place count 184 transition count 494
Performed 73 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 73 rules applied. Total rules applied 357 place count 184 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 359 place count 184 transition count 502
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 419 place count 124 transition count 357
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 3 with 60 rules applied. Total rules applied 479 place count 124 transition count 357
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 491 place count 124 transition count 345
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 498 place count 117 transition count 338
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 505 place count 117 transition count 338
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 506 place count 117 transition count 338
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 508 place count 115 transition count 336
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 510 place count 115 transition count 336
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 511 place count 115 transition count 338
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 511 rules in 76 ms. Remains 115 /263 variables (removed 148) and now considering 338/590 (removed 252) transitions.
[2022-06-11 00:23:30] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 338 rows 115 cols
[2022-06-11 00:23:30] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-11 00:23:30] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/263 places, 338/590 transitions.
Finished structural reductions, in 1 iterations. Remains : 115/263 places, 338/590 transitions.
Product exploration explored 100000 steps with 20000 reset in 650 ms.
Product exploration explored 100000 steps with 20000 reset in 595 ms.
Built C files in :
/tmp/ltsmin5374456269085922717
[2022-06-11 00:23:31] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5374456269085922717
Running compilation step : cd /tmp/ltsmin5374456269085922717;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1962 ms.
Running link step : cd /tmp/ltsmin5374456269085922717;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5374456269085922717;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15704082045708598996.hoa' '--buchi-type=spotba'
LTSmin run took 245 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-07b-LTLFireability-06 finished in 19532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||p1))))'
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 591
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 263 transition count 590
Applied a total of 10 rules in 19 ms. Remains 263 /268 variables (removed 5) and now considering 590/595 (removed 5) transitions.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:34] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 00:23:34] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:34] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 00:23:34] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:34] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 00:23:35] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/268 places, 590/595 transitions.
Finished structural reductions, in 1 iterations. Remains : 263/268 places, 590/595 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(EQ s46 1), p1:(AND (EQ s0 1) (OR (EQ s4 0) (EQ s13 0) (EQ s177 0) (EQ s229 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-07 finished in 1309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Graph (trivial) has 253 edges and 268 vertex of which 4 / 268 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 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 265 transition count 494
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 140 rules applied. Total rules applied 239 place count 167 transition count 452
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 264 place count 142 transition count 452
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 264 place count 142 transition count 446
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 276 place count 136 transition count 446
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 280 place count 132 transition count 442
Iterating global reduction 3 with 4 rules applied. Total rules applied 284 place count 132 transition count 442
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 285 place count 131 transition count 435
Iterating global reduction 3 with 1 rules applied. Total rules applied 286 place count 131 transition count 435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 288 place count 131 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 289 place count 130 transition count 433
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 5 with 114 rules applied. Total rules applied 403 place count 73 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 404 place count 73 transition count 374
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 417 place count 60 transition count 276
Iterating global reduction 6 with 13 rules applied. Total rules applied 430 place count 60 transition count 276
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 436 place count 60 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 438 place count 59 transition count 269
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 7 with 2 rules applied. Total rules applied 440 place count 58 transition count 269
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 442 place count 56 transition count 267
Applied a total of 442 rules in 68 ms. Remains 56 /268 variables (removed 212) and now considering 267/595 (removed 328) transitions.
// Phase 1: matrix 267 rows 56 cols
[2022-06-11 00:23:35] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-11 00:23:35] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 267 rows 56 cols
[2022-06-11 00:23:35] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-11 00:23:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 00:23:35] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [49, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 303 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/268 places, 267/595 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 266
Applied a total of 2 rules in 12 ms. Remains 53 /54 variables (removed 1) and now considering 266/267 (removed 1) transitions.
// Phase 1: matrix 266 rows 53 cols
[2022-06-11 00:23:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-11 00:23:35] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 266 rows 53 cols
[2022-06-11 00:23:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-11 00:23:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 00:23:36] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/268 places, 266/595 transitions.
Finished structural reductions, in 2 iterations. Remains : 53/268 places, 266/595 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s3 1) (EQ s47 1) (EQ s51 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-07b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-08 finished in 730 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||X(p0)))'
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 591
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 263 transition count 590
Applied a total of 10 rules in 17 ms. Remains 263 /268 variables (removed 5) and now considering 590/595 (removed 5) transitions.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:36] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 00:23:36] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:36] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:36] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:36] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:37] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/268 places, 590/595 transitions.
Finished structural reductions, in 1 iterations. Remains : 263/268 places, 590/595 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-09 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 s11 1) (EQ s54 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 113 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-09 finished in 1152 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F((F(p0)&&G((p1 U X(p2))))) U p3))))'
Support contains 8 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 266 transition count 593
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 266 transition count 593
Applied a total of 4 rules in 7 ms. Remains 266 /268 variables (removed 2) and now considering 593/595 (removed 2) transitions.
// Phase 1: matrix 593 rows 266 cols
[2022-06-11 00:23:37] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:37] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 593 rows 266 cols
[2022-06-11 00:23:37] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 00:23:38] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
// Phase 1: matrix 593 rows 266 cols
[2022-06-11 00:23:38] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:38] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 266/268 places, 593/595 transitions.
Finished structural reductions, in 1 iterations. Remains : 266/268 places, 593/595 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p0), (NOT p2), (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=true, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(NOT p3), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p3) p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}, { cond=p1, acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s62 1), p0:(EQ s156 1), p1:(AND (EQ s4 1) (EQ s13 1) (EQ s48 1) (EQ s232 1)), p2:(AND (EQ s4 1) (EQ s16 1) (EQ s192 1) (EQ s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-10 finished in 1727 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)||G(F(X((!p0 U p0))))))))'
Support contains 8 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Graph (trivial) has 239 edges and 268 vertex of which 4 / 268 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 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 265 transition count 494
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 140 rules applied. Total rules applied 239 place count 167 transition count 452
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 264 place count 142 transition count 452
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 264 place count 142 transition count 445
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 278 place count 135 transition count 445
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 282 place count 131 transition count 441
Iterating global reduction 3 with 4 rules applied. Total rules applied 286 place count 131 transition count 441
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 287 place count 130 transition count 434
Iterating global reduction 3 with 1 rules applied. Total rules applied 288 place count 130 transition count 434
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 290 place count 130 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 291 place count 129 transition count 432
Performed 50 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 391 place count 79 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 392 place count 79 transition count 380
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 403 place count 68 transition count 305
Iterating global reduction 6 with 11 rules applied. Total rules applied 414 place count 68 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 420 place count 68 transition count 299
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 424 place count 66 transition count 297
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 426 place count 64 transition count 295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 427 place count 63 transition count 295
Applied a total of 427 rules in 60 ms. Remains 63 /268 variables (removed 205) and now considering 295/595 (removed 300) transitions.
// Phase 1: matrix 295 rows 63 cols
[2022-06-11 00:23:39] [INFO ] Computed 10 place invariants in 2 ms
[2022-06-11 00:23:39] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 295 rows 63 cols
[2022-06-11 00:23:39] [INFO ] Computed 10 place invariants in 1 ms
[2022-06-11 00:23:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 00:23:39] [INFO ] Implicit Places using invariants and state equation in 231 ms returned [58, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 324 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/268 places, 295/595 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 60 transition count 294
Applied a total of 2 rules in 11 ms. Remains 60 /61 variables (removed 1) and now considering 294/295 (removed 1) transitions.
// Phase 1: matrix 294 rows 60 cols
[2022-06-11 00:23:39] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-11 00:23:39] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 294 rows 60 cols
[2022-06-11 00:23:39] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-11 00:23:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 00:23:39] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/268 places, 294/595 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/268 places, 294/595 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-11 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 s11 1) (EQ s20 1) (EQ s26 1) (EQ s30 1) (EQ s39 1) (EQ s43 1) (EQ s52 1) (EQ s56 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 23 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-11 finished in 828 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X((F((X(p0)||p1))||F(p2))) U X(p3)))'
Support contains 17 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 591
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 263 transition count 590
Applied a total of 10 rules in 12 ms. Remains 263 /268 variables (removed 5) and now considering 590/595 (removed 5) transitions.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:39] [INFO ] Computed 12 place invariants in 3 ms
[2022-06-11 00:23:40] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:40] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:40] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
// Phase 1: matrix 590 rows 263 cols
[2022-06-11 00:23:40] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:41] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/268 places, 590/595 transitions.
Finished structural reductions, in 1 iterations. Remains : 263/268 places, 590/595 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p3), (NOT p3), true, (OR p1 p2 p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR p2 p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s4 1) (EQ s12 1) (EQ s114 1) (EQ s229 1)), p2:(AND (EQ s58 1) (EQ s78 1) (EQ s103 1) (EQ s133 1) (EQ s153 1) (EQ s183 1) (EQ s208 1) (EQ s230 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-13 finished in 1496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(p1 U ((p1&&G(p2))||G(p1))))))'
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 265 transition count 592
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 264 transition count 591
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 264 transition count 591
Applied a total of 8 rules in 17 ms. Remains 264 /268 variables (removed 4) and now considering 591/595 (removed 4) transitions.
// Phase 1: matrix 591 rows 264 cols
[2022-06-11 00:23:41] [INFO ] Computed 12 place invariants in 4 ms
[2022-06-11 00:23:41] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 591 rows 264 cols
[2022-06-11 00:23:41] [INFO ] Computed 12 place invariants in 5 ms
[2022-06-11 00:23:42] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
// Phase 1: matrix 591 rows 264 cols
[2022-06-11 00:23:42] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:42] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 264/268 places, 591/595 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/268 places, 591/595 transitions.
Stuttering acceptance computed with spot in 365 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p0), acceptance={} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 9}], [{ cond=(NOT p1), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 2}, { cond=(AND p2 p1), acceptance={} source=9 dest: 3}]], initial=8, aps=[p0:(OR (NEQ s4 1) (NEQ s12 1) (NEQ s114 1) (NEQ s229 1)), p1:(NEQ s249 1), p2:(NEQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 142 reset in 221 ms.
Product exploration explored 100000 steps with 139 reset in 291 ms.
Computed a total of 42 stabilizing places and 43 stable transitions
Computed a total of 42 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X p1), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 643 ms. Reduced automaton from 10 states, 34 edges and 3 AP to 10 states, 32 edges and 3 AP.
Stuttering acceptance computed with spot in 320 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 21) seen :7
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 591 rows 264 cols
[2022-06-11 00:23:45] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:46] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-06-11 00:23:46] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2022-06-11 00:23:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2022-06-11 00:23:48] [INFO ] After 1191ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2022-06-11 00:23:48] [INFO ] After 1937ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :11
Attempting to minimize the solution found.
Minimization took 540 ms.
[2022-06-11 00:23:49] [INFO ] After 2698ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :11
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 320 ms.
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 264/264 places, 591/591 transitions.
Graph (trivial) has 246 edges and 264 vertex of which 4 / 264 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1083 edges and 262 vertex of which 260 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 260 transition count 492
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 136 rules applied. Total rules applied 233 place count 166 transition count 450
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 258 place count 141 transition count 450
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 258 place count 141 transition count 443
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 272 place count 134 transition count 443
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 392 place count 74 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 393 place count 74 transition count 382
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 406 place count 61 transition count 291
Iterating global reduction 4 with 13 rules applied. Total rules applied 419 place count 61 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 425 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 5 with 2 rules applied. Total rules applied 427 place count 60 transition count 284
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 428 place count 60 transition count 283
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 437 place count 60 transition count 274
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 446 place count 51 transition count 274
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 448 place count 51 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 449 place count 50 transition count 273
Applied a total of 449 rules in 87 ms. Remains 50 /264 variables (removed 214) and now considering 273/591 (removed 318) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/264 places, 273/591 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 273 rows 50 cols
[2022-06-11 00:23:50] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-11 00:23:50] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-06-11 00:23:50] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 00:23:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-06-11 00:23:50] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 00:23:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 00:23:50] [INFO ] After 98ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 00:23:50] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-06-11 00:23:51] [INFO ] After 545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 29 ms.
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 273/273 transitions.
Applied a total of 0 rules in 9 ms. Remains 50 /50 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 273/273 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Finished probabilistic random walk after 80105 steps, run visited all 4 properties in 622 ms. (steps per millisecond=128 )
Probabilistic random walk after 80105 steps, saw 16521 distinct states, run finished after 623 ms. (steps per millisecond=128 ) properties seen :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X p1), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND p2 p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 p1 p2))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2))), (F (NOT (AND p1 p2))), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 18 factoid took 1132 ms. Reduced automaton from 10 states, 32 edges and 3 AP to 10 states, 28 edges and 3 AP.
Stuttering acceptance computed with spot in 355 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 344 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 591/591 transitions.
Applied a total of 0 rules in 6 ms. Remains 264 /264 variables (removed 0) and now considering 591/591 (removed 0) transitions.
// Phase 1: matrix 591 rows 264 cols
[2022-06-11 00:23:54] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:54] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 591 rows 264 cols
[2022-06-11 00:23:54] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:55] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
// Phase 1: matrix 591 rows 264 cols
[2022-06-11 00:23:55] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:55] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 591/591 transitions.
Computed a total of 42 stabilizing places and 43 stable transitions
Computed a total of 42 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 435 ms. Reduced automaton from 10 states, 28 edges and 3 AP to 10 states, 28 edges and 3 AP.
Stuttering acceptance computed with spot in 517 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 92 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 591 rows 264 cols
[2022-06-11 00:23:57] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:23:57] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2022-06-11 00:23:58] [INFO ] After 686ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-11 00:23:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-06-11 00:23:58] [INFO ] After 600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-11 00:23:59] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 1 ms to minimize.
[2022-06-11 00:23:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2022-06-11 00:23:59] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
[2022-06-11 00:23:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2022-06-11 00:23:59] [INFO ] After 1619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 340 ms.
[2022-06-11 00:24:00] [INFO ] After 2112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 147 ms.
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 264/264 places, 591/591 transitions.
Graph (trivial) has 246 edges and 264 vertex of which 4 / 264 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1083 edges and 262 vertex of which 260 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 260 transition count 492
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 136 rules applied. Total rules applied 233 place count 166 transition count 450
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 258 place count 141 transition count 450
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 258 place count 141 transition count 443
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 272 place count 134 transition count 443
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 392 place count 74 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 393 place count 74 transition count 382
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 406 place count 61 transition count 291
Iterating global reduction 4 with 13 rules applied. Total rules applied 419 place count 61 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 425 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 5 with 2 rules applied. Total rules applied 427 place count 60 transition count 284
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 428 place count 60 transition count 283
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 437 place count 60 transition count 274
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 446 place count 51 transition count 274
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 448 place count 51 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 449 place count 50 transition count 273
Applied a total of 449 rules in 72 ms. Remains 50 /264 variables (removed 214) and now considering 273/591 (removed 318) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/264 places, 273/591 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 273 rows 50 cols
[2022-06-11 00:24:00] [INFO ] Computed 11 place invariants in 2 ms
[2022-06-11 00:24:00] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-11 00:24:00] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 00:24:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-06-11 00:24:01] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 00:24:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 00:24:01] [INFO ] After 59ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 00:24:01] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-06-11 00:24:01] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 273/273 transitions.
Applied a total of 0 rules in 8 ms. Remains 50 /50 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 273/273 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished probabilistic random walk after 80105 steps, run visited all 2 properties in 245 ms. (steps per millisecond=326 )
Probabilistic random walk after 80105 steps, saw 16521 distinct states, run finished after 245 ms. (steps per millisecond=326 ) properties seen :2
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p0 p1 p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p1 p2))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND p1 (NOT p2))), (F (NOT p1)), (F (NOT (AND p0 p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 7 factoid took 611 ms. Reduced automaton from 10 states, 28 edges and 3 AP to 10 states, 28 edges and 3 AP.
Stuttering acceptance computed with spot in 327 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 331 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 79 reset in 211 ms.
Product exploration explored 100000 steps with 11 reset in 255 ms.
Applying partial POR strategy [true, true, true, false, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 338 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 591/591 transitions.
Graph (trivial) has 246 edges and 264 vertex of which 4 / 264 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.
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 262 transition count 589
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 112 place count 262 transition count 572
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 112 place count 262 transition count 572
Deduced a syphon composed of 114 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 132 place count 262 transition count 572
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 213 place count 181 transition count 491
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 81 rules applied. Total rules applied 294 place count 181 transition count 491
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 71 rules applied. Total rules applied 365 place count 181 transition count 500
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 366 place count 181 transition count 499
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 424 place count 123 transition count 363
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 3 with 58 rules applied. Total rules applied 482 place count 123 transition count 363
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 494 place count 123 transition count 351
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 501 place count 116 transition count 344
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 508 place count 116 transition count 344
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 509 place count 116 transition count 344
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 511 place count 114 transition count 342
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 513 place count 114 transition count 342
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 514 place count 114 transition count 344
Deduced a syphon composed of 53 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 516 place count 114 transition count 342
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 516 rules in 105 ms. Remains 114 /264 variables (removed 150) and now considering 342/591 (removed 249) transitions.
[2022-06-11 00:24:04] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 342 rows 114 cols
[2022-06-11 00:24:04] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-11 00:24:04] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/264 places, 342/591 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/264 places, 342/591 transitions.
Product exploration explored 100000 steps with 24 reset in 203 ms.
Product exploration explored 100000 steps with 5 reset in 148 ms.
Built C files in :
/tmp/ltsmin13512765736099101441
[2022-06-11 00:24:05] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13512765736099101441
Running compilation step : cd /tmp/ltsmin13512765736099101441;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1753 ms.
Running link step : cd /tmp/ltsmin13512765736099101441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13512765736099101441;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5752056280989961519.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 591/591 transitions.
Applied a total of 0 rules in 4 ms. Remains 264 /264 variables (removed 0) and now considering 591/591 (removed 0) transitions.
// Phase 1: matrix 591 rows 264 cols
[2022-06-11 00:24:20] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:24:20] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 591 rows 264 cols
[2022-06-11 00:24:20] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:24:20] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
// Phase 1: matrix 591 rows 264 cols
[2022-06-11 00:24:20] [INFO ] Computed 12 place invariants in 2 ms
[2022-06-11 00:24:21] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 591/591 transitions.
Built C files in :
/tmp/ltsmin18369541151941838024
[2022-06-11 00:24:21] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18369541151941838024
Running compilation step : cd /tmp/ltsmin18369541151941838024;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1705 ms.
Running link step : cd /tmp/ltsmin18369541151941838024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18369541151941838024;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14949696781951154289.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 00:24:36] [INFO ] Flatten gal took : 47 ms
[2022-06-11 00:24:36] [INFO ] Flatten gal took : 48 ms
[2022-06-11 00:24:36] [INFO ] Time to serialize gal into /tmp/LTL2751508129470537774.gal : 10 ms
[2022-06-11 00:24:36] [INFO ] Time to serialize properties into /tmp/LTL8279908517799104025.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2751508129470537774.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8279908517799104025.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2751508...266
Read 1 LTL properties
Checking formula 0 : !((X((X(G("(((p6!=1)||(p15!=1))||((p135!=1)||(p280!=1)))")))||(("(p306!=1)")U((("(p306!=1)")&&(G("(p149!=1)")))||(G("(p306!=1)")))))))
Formula 0 simplified : !X(XG"(((p6!=1)||(p15!=1))||((p135!=1)||(p280!=1)))" | ("(p306!=1)" U (G"(p306!=1)" | ("(p306!=1)" & G"(p149!=1)"))))
Detected timeout of ITS tools.
[2022-06-11 00:24:51] [INFO ] Flatten gal took : 44 ms
[2022-06-11 00:24:51] [INFO ] Applying decomposition
[2022-06-11 00:24:51] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7146349215721387945.txt' '-o' '/tmp/graph7146349215721387945.bin' '-w' '/tmp/graph7146349215721387945.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7146349215721387945.bin' '-l' '-1' '-v' '-w' '/tmp/graph7146349215721387945.weights' '-q' '0' '-e' '0.001'
[2022-06-11 00:24:51] [INFO ] Decomposing Gal with order
[2022-06-11 00:24:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 00:24:52] [INFO ] Removed a total of 1630 redundant transitions.
[2022-06-11 00:24:52] [INFO ] Flatten gal took : 188 ms
[2022-06-11 00:24:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 26 ms.
[2022-06-11 00:24:52] [INFO ] Time to serialize gal into /tmp/LTL4895668000386762566.gal : 11 ms
[2022-06-11 00:24:52] [INFO ] Time to serialize properties into /tmp/LTL1941410296309162568.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4895668000386762566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1941410296309162568.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4895668...245
Read 1 LTL properties
Checking formula 0 : !((X((X(G("(((u1.p6!=1)||(u1.p15!=1))||((i10.i0.u43.p135!=1)||(u1.p280!=1)))")))||(("(i19.u98.p306!=1)")U((("(i19.u98.p306!=1)")&&(G("...207
Formula 0 simplified : !X(XG"(((u1.p6!=1)||(u1.p15!=1))||((i10.i0.u43.p135!=1)||(u1.p280!=1)))" | ("(i19.u98.p306!=1)" U (G"(i19.u98.p306!=1)" | ("(i19.u98...192
Reverse transition relation is NOT exact ! Due to transitions t252, t254, t259, t287, t315, t364, t392, t420, t448, t592, i0.i1.t26, i2.u17.t229, i2.u17.t2...911
Computing Next relation with stutter on 390272 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10904020462563600176
[2022-06-11 00:25:07] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10904020462563600176
Running compilation step : cd /tmp/ltsmin10904020462563600176;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1738 ms.
Running link step : cd /tmp/ltsmin10904020462563600176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10904020462563600176;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||((LTLAPp1==true) U (((LTLAPp1==true)&&[]((LTLAPp2==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-07b-LTLFireability-14 finished in 100996 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(p0))||G(p1)))))'
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 595/595 transitions.
Graph (trivial) has 252 edges and 268 vertex of which 4 / 268 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 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 265 transition count 494
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 140 rules applied. Total rules applied 239 place count 167 transition count 452
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 264 place count 142 transition count 452
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 264 place count 142 transition count 446
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 276 place count 136 transition count 446
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 280 place count 132 transition count 442
Iterating global reduction 3 with 4 rules applied. Total rules applied 284 place count 132 transition count 442
Performed 58 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 400 place count 74 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 401 place count 74 transition count 382
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 414 place count 61 transition count 291
Iterating global reduction 4 with 13 rules applied. Total rules applied 427 place count 61 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 433 place count 61 transition count 285
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 5 with 4 rules applied. Total rules applied 437 place count 59 transition count 283
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 439 place count 57 transition count 281
Applied a total of 439 rules in 53 ms. Remains 57 /268 variables (removed 211) and now considering 281/595 (removed 314) transitions.
// Phase 1: matrix 281 rows 57 cols
[2022-06-11 00:25:22] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-11 00:25:22] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 281 rows 57 cols
[2022-06-11 00:25:22] [INFO ] Computed 11 place invariants in 1 ms
[2022-06-11 00:25:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 00:25:22] [INFO ] Implicit Places using invariants and state equation in 247 ms returned [52, 56]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 372 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/268 places, 281/595 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 54 transition count 280
Applied a total of 2 rules in 15 ms. Remains 54 /55 variables (removed 1) and now considering 280/281 (removed 1) transitions.
// Phase 1: matrix 280 rows 54 cols
[2022-06-11 00:25:22] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-11 00:25:22] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 280 rows 54 cols
[2022-06-11 00:25:22] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-11 00:25:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 00:25:23] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/268 places, 280/595 transitions.
Finished structural reductions, in 2 iterations. Remains : 54/268 places, 280/595 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-15 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 s7 0) (EQ s11 0) (EQ s50 0)), p0:(OR (EQ s1 0) (EQ s9 0) (EQ s16 0) (EQ s50 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 64 reset in 148 ms.
Product exploration explored 100000 steps with 160 reset in 137 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 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 215 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 558 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 280 rows 54 cols
[2022-06-11 00:25:24] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-11 00:25:24] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 00:25:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-11 00:25:24] [INFO ] After 25ms 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 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-07b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLFireability-15 finished in 1921 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(p1 U ((p1&&G(p2))||G(p1))))))'
[2022-06-11 00:25:24] [INFO ] Flatten gal took : 50 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2591038095992625133
[2022-06-11 00:25:24] [INFO ] Computing symmetric may disable matrix : 595 transitions.
[2022-06-11 00:25:24] [INFO ] Applying decomposition
[2022-06-11 00:25:24] [INFO ] Computation of Complete disable matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 00:25:24] [INFO ] Flatten gal took : 38 ms
[2022-06-11 00:25:24] [INFO ] Computing symmetric may enable matrix : 595 transitions.
[2022-06-11 00:25:24] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8896907915826862950.txt' '-o' '/tmp/graph8896907915826862950.bin' '-w' '/tmp/graph8896907915826862950.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8896907915826862950.bin' '-l' '-1' '-v' '-w' '/tmp/graph8896907915826862950.weights' '-q' '0' '-e' '0.001'
[2022-06-11 00:25:24] [INFO ] Decomposing Gal with order
[2022-06-11 00:25:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 00:25:24] [INFO ] Computing Do-Not-Accords matrix : 595 transitions.
[2022-06-11 00:25:24] [INFO ] Removed a total of 1608 redundant transitions.
[2022-06-11 00:25:24] [INFO ] Flatten gal took : 84 ms
[2022-06-11 00:25:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 12 ms.
[2022-06-11 00:25:24] [INFO ] Time to serialize gal into /tmp/LTLFireability15555111535306319580.gal : 6 ms
[2022-06-11 00:25:24] [INFO ] Time to serialize properties into /tmp/LTLFireability17000176371608986704.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15555111535306319580.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17000176371608986704.ltl' '-c' '-stutter-deadlock'
[2022-06-11 00:25:24] [INFO ] Computation of Completed DNA matrix. took 113 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
[2022-06-11 00:25:24] [INFO ] Built C files in 448ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2591038095992625133
Running compilation step : cd /tmp/ltsmin2591038095992625133;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((X((X(G("(((i8.u1.p6!=1)||(i8.u1.p15!=1))||((i6.u42.p135!=1)||(i8.u1.p280!=1)))")))||(("(i15.u94.p306!=1)")U((("(i15.u94.p306!=1)")&...211
Formula 0 simplified : !X(XG"(((i8.u1.p6!=1)||(i8.u1.p15!=1))||((i6.u42.p135!=1)||(i8.u1.p280!=1)))" | ("(i15.u94.p306!=1)" U (G"(i15.u94.p306!=1)" | ("(i1...196
Compilation finished in 2492 ms.
Running link step : cd /tmp/ltsmin2591038095992625133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2591038095992625133;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||((LTLAPp1==true) U (((LTLAPp1==true)&&[]((LTLAPp2==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t86, t112, t139, t165, t191, t208, t219, t245, t252, t254, t257, t313, t418, t592, i1.u51.t11...826
Computing Next relation with stutter on 390272 deadlock states
Detected timeout of ITS tools.
[2022-06-11 00:46:22] [INFO ] Applying decomposition
[2022-06-11 00:46:22] [INFO ] Flatten gal took : 89 ms
[2022-06-11 00:46:22] [INFO ] Decomposing Gal with order
[2022-06-11 00:46:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 00:46:22] [INFO ] Removed a total of 1761 redundant transitions.
[2022-06-11 00:46:22] [INFO ] Flatten gal took : 267 ms
[2022-06-11 00:46:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 76 ms.
[2022-06-11 00:46:23] [INFO ] Time to serialize gal into /tmp/LTLFireability4816060933941681387.gal : 20 ms
[2022-06-11 00:46:23] [INFO ] Time to serialize properties into /tmp/LTLFireability4603175839880804574.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4816060933941681387.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4603175839880804574.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((X((X(G("(((i0.u2.p6!=1)||(i0.u3.p15!=1))||((i1.i0.i0.i0.i0.i0.u15.p135!=1)||(i1.i0.u19.p280!=1)))")))||(("(i1.i1.u22.p306!=1)")U(((...251
Formula 0 simplified : !X(XG"(((i0.u2.p6!=1)||(i0.u3.p15!=1))||((i1.i0.i0.i0.i0.i0.u15.p135!=1)||(i1.i0.u19.p280!=1)))" | ("(i1.i1.u22.p306!=1)" U (G"(i1.i...236
Reverse transition relation is NOT exact ! Due to transitions t270, i0.u2.t254, i0.u3.t252, i1.t592, i1.i0.u19.t34, i1.i0.u19.t37, i1.i0.u19.t38, i1.i0.u19...1561
Computing Next relation with stutter on 390272 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: LTL layer: formula: X((X([]((LTLAPp0==true)))||((LTLAPp1==true) U (((LTLAPp1==true)&&[]((LTLAPp2==true)))||[]((LTLAPp1==true))))))
pins2lts-mc-linux64( 0/ 8), 0.031: "X((X([]((LTLAPp0==true)))||((LTLAPp1==true) U (((LTLAPp1==true)&&[]((LTLAPp2==true)))||[]((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.031: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.071: buchi has 10 states
pins2lts-mc-linux64( 4/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.092: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.133: DFS-FIFO for weak LTL, using special progress label 599
pins2lts-mc-linux64( 0/ 8), 0.133: There are 600 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.133: State length is 269, there are 629 groups
pins2lts-mc-linux64( 0/ 8), 0.133: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.133: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.133: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.133: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.161: ~1 levels ~960 states ~3392 transitions
pins2lts-mc-linux64( 2/ 8), 0.203: ~1 levels ~1920 states ~6896 transitions
pins2lts-mc-linux64( 2/ 8), 0.275: ~1 levels ~3840 states ~14704 transitions
pins2lts-mc-linux64( 6/ 8), 0.436: ~1 levels ~7680 states ~31072 transitions
pins2lts-mc-linux64( 0/ 8), 0.753: ~1 levels ~15360 states ~66696 transitions
pins2lts-mc-linux64( 0/ 8), 1.422: ~1 levels ~30720 states ~167048 transitions
pins2lts-mc-linux64( 0/ 8), 2.677: ~1 levels ~61440 states ~394792 transitions
pins2lts-mc-linux64( 0/ 8), 5.096: ~1 levels ~122880 states ~884048 transitions
pins2lts-mc-linux64( 0/ 8), 9.298: ~1 levels ~245760 states ~1892624 transitions
pins2lts-mc-linux64( 0/ 8), 16.335: ~1 levels ~491520 states ~3993240 transitions
pins2lts-mc-linux64( 0/ 8), 28.811: ~1 levels ~983040 states ~8207824 transitions
pins2lts-mc-linux64( 5/ 8), 51.311: ~1 levels ~1966080 states ~15669232 transitions
pins2lts-mc-linux64( 4/ 8), 97.460: ~1 levels ~3932160 states ~30286448 transitions
pins2lts-mc-linux64( 0/ 8), 208.179: ~1 levels ~7864320 states ~63305576 transitions
pins2lts-mc-linux64( 3/ 8), 475.799: ~1 levels ~15728640 states ~160916128 transitions
pins2lts-mc-linux64( 1/ 8), 982.144: ~1 levels ~31457280 states ~385948816 transitions
pins2lts-mc-linux64( 5/ 8), 1977.331: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1977.346:
pins2lts-mc-linux64( 0/ 8), 1977.346: mean standard work distribution: 2.8% (states) 1.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 1977.346:
pins2lts-mc-linux64( 0/ 8), 1977.346: Explored 60411260 states 795077552 transitions, fanout: 13.161
pins2lts-mc-linux64( 0/ 8), 1977.347: Total exploration time 1977.210 sec (1977.180 sec minimum, 1977.199 sec on average)
pins2lts-mc-linux64( 0/ 8), 1977.347: States per second: 30554, Transitions per second: 402121
pins2lts-mc-linux64( 0/ 8), 1977.347:
pins2lts-mc-linux64( 0/ 8), 1977.347: Progress states detected: 134216322
pins2lts-mc-linux64( 0/ 8), 1977.347: Redundant explorations: -54.9897
pins2lts-mc-linux64( 0/ 8), 1977.347:
pins2lts-mc-linux64( 0/ 8), 1977.347: Queue width: 8B, total height: 122531881, memory: 934.84MB
pins2lts-mc-linux64( 0/ 8), 1977.347: Tree memory: 1029.4MB, 8.0 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1977.347: Tree fill ratio (roots/leafs): 99.0%/2.0%
pins2lts-mc-linux64( 0/ 8), 1977.347: Stored 602 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1977.347: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1977.347: Est. total memory use: 1964.3MB (~1958.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2591038095992625133;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||((LTLAPp1==true) U (((LTLAPp1==true)&&[]((LTLAPp2==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2591038095992625133;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([]((LTLAPp0==true)))||((LTLAPp1==true) U (((LTLAPp1==true)&&[]((LTLAPp2==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-11 01:07:19] [INFO ] Flatten gal took : 33 ms
[2022-06-11 01:07:19] [INFO ] Input system was already deterministic with 595 transitions.
[2022-06-11 01:07:19] [INFO ] Transformed 268 places.
[2022-06-11 01:07:19] [INFO ] Transformed 595 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-11 01:07:19] [INFO ] Time to serialize gal into /tmp/LTLFireability17786403743812017747.gal : 15 ms
[2022-06-11 01:07:19] [INFO ] Time to serialize properties into /tmp/LTLFireability6546341800005704985.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17786403743812017747.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6546341800005704985.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((X(G("(((p6!=1)||(p15!=1))||((p135!=1)||(p280!=1)))")))||(("(p306!=1)")U((("(p306!=1)")&&(G("(p149!=1)")))||(G("(p306!=1)")))))))
Formula 0 simplified : !X(XG"(((p6!=1)||(p15!=1))||((p135!=1)||(p280!=1)))" | ("(p306!=1)" U (G"(p306!=1)" | ("(p306!=1)" & G"(p149!=1)"))))
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t26, t34, t37, t38, t39, t66, t67, t70, t71, t73, t86, t92, t93, t96, t97, t99...731
Computing Next relation with stutter on 390272 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="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-4028"
echo " Executing tool itstools"
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 r294-smll-165463873000516"
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 ;