Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180300202.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AutonomousCar-PT-07b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180300202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 334K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716308899815

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 16:28:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 16:28:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:28:23] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-05-21 16:28:23] [INFO ] Transformed 323 places.
[2024-05-21 16:28:23] [INFO ] Transformed 846 transitions.
[2024-05-21 16:28:23] [INFO ] Found NUPN structural information;
[2024-05-21 16:28:23] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-07b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 290 transition count 813
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 290 transition count 813
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 285 transition count 808
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 285 transition count 808
Applied a total of 76 rules in 113 ms. Remains 285 /323 variables (removed 38) and now considering 808/846 (removed 38) transitions.
// Phase 1: matrix 808 rows 285 cols
[2024-05-21 16:28:24] [INFO ] Computed 12 invariants in 34 ms
[2024-05-21 16:28:24] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-21 16:28:24] [INFO ] Invariant cache hit.
[2024-05-21 16:28:25] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
[2024-05-21 16:28:25] [INFO ] Invariant cache hit.
[2024-05-21 16:28:26] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 285/323 places, 808/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2367 ms. Remains : 285/323 places, 808/846 transitions.
Support contains 47 out of 285 places after structural reductions.
[2024-05-21 16:28:26] [INFO ] Flatten gal took : 255 ms
[2024-05-21 16:28:27] [INFO ] Flatten gal took : 152 ms
[2024-05-21 16:28:27] [INFO ] Input system was already deterministic with 808 transitions.
Incomplete random walk after 10000 steps, including 97 resets, run finished after 667 ms. (steps per millisecond=14 ) properties (out of 29) seen :22
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :4
Running SMT prover for 3 properties.
[2024-05-21 16:28:28] [INFO ] Invariant cache hit.
[2024-05-21 16:28:28] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 16:28:29] [INFO ] After 784ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-21 16:28:29] [INFO ] Deduced a trap composed of 31 places in 377 ms of which 10 ms to minimize.
[2024-05-21 16:28:30] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 1 ms to minimize.
[2024-05-21 16:28:30] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 2 ms to minimize.
[2024-05-21 16:28:30] [INFO ] Deduced a trap composed of 34 places in 247 ms of which 1 ms to minimize.
[2024-05-21 16:28:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1479 ms
[2024-05-21 16:28:30] [INFO ] After 2306ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 16:28:30] [INFO ] After 2547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 16:28:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-21 16:28:31] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 16:28:31] [INFO ] Deduced a trap composed of 21 places in 300 ms of which 3 ms to minimize.
[2024-05-21 16:28:32] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 1 ms to minimize.
[2024-05-21 16:28:32] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 1 ms to minimize.
[2024-05-21 16:28:32] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 9 ms to minimize.
[2024-05-21 16:28:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1353 ms
[2024-05-21 16:28:33] [INFO ] Deduced a trap composed of 15 places in 330 ms of which 3 ms to minimize.
[2024-05-21 16:28:33] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 1 ms to minimize.
[2024-05-21 16:28:33] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 0 ms to minimize.
[2024-05-21 16:28:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 940 ms
[2024-05-21 16:28:34] [INFO ] After 2852ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-05-21 16:28:34] [INFO ] After 3286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 50 ms.
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 265 edges and 285 vertex of which 4 / 285 are part of one of the 2 SCC in 12 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1141 edges and 283 vertex of which 278 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.16 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 278 transition count 696
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 138 rules applied. Total rules applied 245 place count 175 transition count 661
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 22 rules applied. Total rules applied 267 place count 155 transition count 659
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 269 place count 153 transition count 659
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 269 place count 153 transition count 650
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 287 place count 144 transition count 650
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 297 place count 134 transition count 640
Iterating global reduction 4 with 10 rules applied. Total rules applied 307 place count 134 transition count 640
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 4 with 196 rules applied. Total rules applied 503 place count 134 transition count 444
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 503 place count 134 transition count 443
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 505 place count 133 transition count 443
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 507 place count 131 transition count 435
Iterating global reduction 5 with 2 rules applied. Total rules applied 509 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 5 with 2 rules applied. Total rules applied 511 place count 131 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 512 place count 130 transition count 433
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 624 place count 74 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 625 place count 74 transition count 376
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 637 place count 62 transition count 285
Iterating global reduction 8 with 12 rules applied. Total rules applied 649 place count 62 transition count 285
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 654 place count 62 transition count 280
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 9 with 2 rules applied. Total rules applied 656 place count 61 transition count 279
Free-agglomeration rule applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 664 place count 61 transition count 271
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 672 place count 53 transition count 271
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 673 place count 53 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 674 place count 52 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 675 place count 51 transition count 269
Applied a total of 675 rules in 353 ms. Remains 51 /285 variables (removed 234) and now considering 269/808 (removed 539) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 51/285 places, 269/808 transitions.
Finished random walk after 91 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 50 stabilizing places and 51 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 270 transition count 793
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 270 transition count 793
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 265 transition count 788
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 265 transition count 788
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 264 transition count 787
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 264 transition count 787
Applied a total of 42 rules in 45 ms. Remains 264 /285 variables (removed 21) and now considering 787/808 (removed 21) transitions.
// Phase 1: matrix 787 rows 264 cols
[2024-05-21 16:28:35] [INFO ] Computed 12 invariants in 6 ms
[2024-05-21 16:28:35] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 16:28:35] [INFO ] Invariant cache hit.
[2024-05-21 16:28:35] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2024-05-21 16:28:35] [INFO ] Invariant cache hit.
[2024-05-21 16:28:36] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 264/285 places, 787/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1425 ms. Remains : 264/285 places, 787/808 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 261 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 4 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-00 finished in 1797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&X(F(p2))&&p0)))'
Support contains 7 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 272 transition count 795
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 272 transition count 795
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 222 place count 272 transition count 599
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 227 place count 267 transition count 594
Iterating global reduction 1 with 5 rules applied. Total rules applied 232 place count 267 transition count 594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 233 place count 266 transition count 593
Iterating global reduction 1 with 1 rules applied. Total rules applied 234 place count 266 transition count 593
Applied a total of 234 rules in 29 ms. Remains 266 /285 variables (removed 19) and now considering 593/808 (removed 215) transitions.
// Phase 1: matrix 593 rows 266 cols
[2024-05-21 16:28:36] [INFO ] Computed 12 invariants in 5 ms
[2024-05-21 16:28:37] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-21 16:28:37] [INFO ] Invariant cache hit.
[2024-05-21 16:28:37] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2024-05-21 16:28:37] [INFO ] Invariant cache hit.
[2024-05-21 16:28:38] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 266/285 places, 593/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1158 ms. Remains : 266/285 places, 593/808 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s206 0) (EQ s247 1) (OR (EQ s142 0) (EQ s94 1))), p1:(OR (EQ s35 0) (EQ s234 1)), p2:(EQ s156 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-01 finished in 1485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||((p1&&G(!p2)) U X(p1)))))'
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 269 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 269 transition count 792
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 228 place count 269 transition count 596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 233 place count 264 transition count 591
Iterating global reduction 1 with 5 rules applied. Total rules applied 238 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 263 transition count 590
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 263 transition count 590
Applied a total of 240 rules in 51 ms. Remains 263 /285 variables (removed 22) and now considering 590/808 (removed 218) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-05-21 16:28:38] [INFO ] Computed 12 invariants in 7 ms
[2024-05-21 16:28:38] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 16:28:38] [INFO ] Invariant cache hit.
[2024-05-21 16:28:38] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2024-05-21 16:28:38] [INFO ] Invariant cache hit.
[2024-05-21 16:28:39] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/285 places, 590/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1293 ms. Remains : 263/285 places, 590/808 transitions.
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s123 0) (EQ s254 1)), p1:(OR (EQ s209 0) (EQ s58 1)), p2:(OR (EQ s254 0) (EQ s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 769 ms.
Product exploration explored 100000 steps with 33333 reset in 583 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 p0) p1 p2), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 36 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLCardinality-02 finished in 3063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((F(G(p1)) U p2))||p0))))'
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 262 edges and 285 vertex of which 4 / 285 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.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 283 transition count 701
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 141 rules applied. Total rules applied 247 place count 178 transition count 665
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 269 place count 157 transition count 664
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 156 transition count 664
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 270 place count 156 transition count 655
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 288 place count 147 transition count 655
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 297 place count 138 transition count 646
Iterating global reduction 4 with 9 rules applied. Total rules applied 306 place count 138 transition count 646
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 4 with 196 rules applied. Total rules applied 502 place count 138 transition count 450
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 502 place count 138 transition count 449
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 504 place count 137 transition count 449
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 506 place count 135 transition count 441
Iterating global reduction 5 with 2 rules applied. Total rules applied 508 place count 135 transition count 441
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 5 with 2 rules applied. Total rules applied 510 place count 135 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 511 place count 134 transition count 439
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 7 with 112 rules applied. Total rules applied 623 place count 78 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 624 place count 78 transition count 381
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 636 place count 66 transition count 291
Iterating global reduction 8 with 12 rules applied. Total rules applied 648 place count 66 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 654 place count 66 transition count 285
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 9 with 2 rules applied. Total rules applied 656 place count 65 transition count 284
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 657 place count 65 transition count 284
Applied a total of 657 rules in 222 ms. Remains 65 /285 variables (removed 220) and now considering 284/808 (removed 524) transitions.
// Phase 1: matrix 284 rows 65 cols
[2024-05-21 16:28:41] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 16:28:41] [INFO ] Implicit Places using invariants in 204 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 208 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/285 places, 284/808 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 445 ms. Remains : 64/285 places, 284/808 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s23 0) (EQ s44 1)), p2:(OR (EQ s49 0) (EQ s35 1)), p1:(OR (EQ s1 0) (EQ s21 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 152 ms.
Product exploration explored 100000 steps with 44 reset in 209 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Computed a total of 7 stabilizing places and 8 stable transitions
Detected a total of 7/64 stabilizing places and 8/284 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 242 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1421 steps, including 68 resets, run visited all 5 properties in 40 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 (NOT p0) p2))]
Knowledge based reduction with 12 factoid took 574 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 284/284 transitions.
Applied a total of 0 rules in 20 ms. Remains 64 /64 variables (removed 0) and now considering 284/284 (removed 0) transitions.
// Phase 1: matrix 284 rows 64 cols
[2024-05-21 16:28:43] [INFO ] Computed 10 invariants in 8 ms
[2024-05-21 16:28:44] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-21 16:28:44] [INFO ] Invariant cache hit.
[2024-05-21 16:28:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:28:44] [INFO ] Implicit Places using invariants and state equation in 279 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 499 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/64 places, 284/284 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 61 transition count 283
Applied a total of 2 rules in 19 ms. Remains 61 /62 variables (removed 1) and now considering 283/284 (removed 1) transitions.
// Phase 1: matrix 283 rows 61 cols
[2024-05-21 16:28:44] [INFO ] Computed 8 invariants in 5 ms
[2024-05-21 16:28:44] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-21 16:28:44] [INFO ] Invariant cache hit.
[2024-05-21 16:28:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:28:44] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/64 places, 283/284 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 866 ms. Remains : 61/64 places, 283/284 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Computed a total of 7 stabilizing places and 8 stable transitions
Detected a total of 7/61 stabilizing places and 8/283 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 203 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 450 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 16:28:45] [INFO ] Invariant cache hit.
[2024-05-21 16:28:45] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 16:28:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 16:28:45] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 16:28:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:28:45] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 16:28:45] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2024-05-21 16:28:46] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 4 ms to minimize.
[2024-05-21 16:28:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 410 ms
[2024-05-21 16:28:46] [INFO ] After 445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-21 16:28:46] [INFO ] After 675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 283/283 transitions.
Graph (complete) has 537 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 60 transition count 280
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 11 place count 60 transition count 272
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 52 transition count 272
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 52 transition count 270
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 52 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 51 transition count 271
Applied a total of 23 rules in 73 ms. Remains 51 /61 variables (removed 10) and now considering 271/283 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 51/61 places, 271/283 transitions.
Incomplete random walk after 10000 steps, including 199 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Finished Best-First random walk after 701 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=350 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 (NOT p0) p2))]
Knowledge based reduction with 12 factoid took 820 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 59 reset in 121 ms.
Product exploration explored 100000 steps with 100 reset in 322 ms.
Built C files in :
/tmp/ltsmin3730207575867587985
[2024-05-21 16:28:48] [INFO ] Computing symmetric may disable matrix : 283 transitions.
[2024-05-21 16:28:48] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:28:48] [INFO ] Computing symmetric may enable matrix : 283 transitions.
[2024-05-21 16:28:48] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:28:48] [INFO ] Computing Do-Not-Accords matrix : 283 transitions.
[2024-05-21 16:28:48] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:28:48] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3730207575867587985
Running compilation step : cd /tmp/ltsmin3730207575867587985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2010 ms.
Running link step : cd /tmp/ltsmin3730207575867587985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin3730207575867587985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10650966582488650610.hoa' '--buchi-type=spotba'
LTSmin run took 2791 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-07b-LTLCardinality-03 finished in 11785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G(p1))))))'
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 269 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 269 transition count 792
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 228 place count 269 transition count 596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 233 place count 264 transition count 591
Iterating global reduction 1 with 5 rules applied. Total rules applied 238 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 263 transition count 590
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 263 transition count 590
Applied a total of 240 rules in 30 ms. Remains 263 /285 variables (removed 22) and now considering 590/808 (removed 218) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-05-21 16:28:53] [INFO ] Computed 12 invariants in 4 ms
[2024-05-21 16:28:53] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 16:28:53] [INFO ] Invariant cache hit.
[2024-05-21 16:28:53] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2024-05-21 16:28:53] [INFO ] Invariant cache hit.
[2024-05-21 16:28:54] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/285 places, 590/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1205 ms. Remains : 263/285 places, 590/808 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s178 0) (EQ s140 1)), p1:(AND (EQ s140 0) (EQ s178 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-04 finished in 1392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||(p0 U X(G(p1))))) U p2))'
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 265 edges and 285 vertex of which 4 / 285 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 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 282 transition count 697
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 146 rules applied. Total rules applied 255 place count 174 transition count 659
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 24 rules applied. Total rules applied 279 place count 152 transition count 657
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 281 place count 150 transition count 657
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 281 place count 150 transition count 650
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 295 place count 143 transition count 650
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 305 place count 133 transition count 640
Iterating global reduction 4 with 10 rules applied. Total rules applied 315 place count 133 transition count 640
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 4 with 196 rules applied. Total rules applied 511 place count 133 transition count 444
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 511 place count 133 transition count 443
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 513 place count 132 transition count 443
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 514 place count 131 transition count 442
Iterating global reduction 5 with 1 rules applied. Total rules applied 515 place count 131 transition count 442
Performed 55 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 625 place count 76 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 626 place count 76 transition count 385
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 639 place count 63 transition count 287
Iterating global reduction 6 with 13 rules applied. Total rules applied 652 place count 63 transition count 287
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 657 place count 63 transition count 282
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 659 place count 62 transition count 281
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 660 place count 62 transition count 280
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 661 place count 62 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 663 place count 60 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 664 place count 59 transition count 278
Applied a total of 664 rules in 134 ms. Remains 59 /285 variables (removed 226) and now considering 278/808 (removed 530) transitions.
// Phase 1: matrix 278 rows 59 cols
[2024-05-21 16:28:54] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 16:28:54] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-21 16:28:54] [INFO ] Invariant cache hit.
[2024-05-21 16:28:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:28:55] [INFO ] Implicit Places using invariants and state equation in 251 ms returned [54, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 407 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/285 places, 278/808 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 56 transition count 277
Applied a total of 2 rules in 11 ms. Remains 56 /57 variables (removed 1) and now considering 277/278 (removed 1) transitions.
// Phase 1: matrix 277 rows 56 cols
[2024-05-21 16:28:55] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:28:55] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 16:28:55] [INFO ] Invariant cache hit.
[2024-05-21 16:28:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:28:55] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/285 places, 277/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 917 ms. Remains : 56/285 places, 277/808 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s9 1), p0:(NEQ s15 1), p1:(OR (EQ s1 0) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-06 finished in 1055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 270 edges and 285 vertex of which 4 / 285 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 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 282 transition count 694
Reduce places removed 111 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 152 rules applied. Total rules applied 264 place count 171 transition count 653
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 288 place count 147 transition count 653
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 288 place count 147 transition count 646
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 302 place count 140 transition count 646
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 312 place count 130 transition count 636
Iterating global reduction 3 with 10 rules applied. Total rules applied 322 place count 130 transition count 636
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 518 place count 130 transition count 440
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 518 place count 130 transition count 439
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 520 place count 129 transition count 439
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 521 place count 128 transition count 432
Iterating global reduction 4 with 1 rules applied. Total rules applied 522 place count 128 transition count 432
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 524 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 525 place count 127 transition count 430
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 631 place count 74 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 632 place count 74 transition count 375
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 645 place count 61 transition count 277
Iterating global reduction 7 with 13 rules applied. Total rules applied 658 place count 61 transition count 277
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 664 place count 61 transition count 271
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 8 with 2 rules applied. Total rules applied 666 place count 60 transition count 270
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 8 with 2 rules applied. Total rules applied 668 place count 59 transition count 270
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 670 place count 57 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 671 place count 56 transition count 268
Applied a total of 671 rules in 130 ms. Remains 56 /285 variables (removed 229) and now considering 268/808 (removed 540) transitions.
// Phase 1: matrix 268 rows 56 cols
[2024-05-21 16:28:55] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 16:28:55] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 16:28:55] [INFO ] Invariant cache hit.
[2024-05-21 16:28:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:28:56] [INFO ] Implicit Places using invariants and state equation in 291 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 463 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/285 places, 268/808 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 267
Applied a total of 2 rules in 20 ms. Remains 54 /55 variables (removed 1) and now considering 267/268 (removed 1) transitions.
// Phase 1: matrix 267 rows 54 cols
[2024-05-21 16:28:56] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 16:28:56] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-21 16:28:56] [INFO ] Invariant cache hit.
[2024-05-21 16:28:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:28:56] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/285 places, 267/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1055 ms. Remains : 54/285 places, 267/808 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 138 reset in 210 ms.
Product exploration explored 100000 steps with 3 reset in 125 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/54 stabilizing places and 7/267 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 267/267 transitions.
Applied a total of 0 rules in 10 ms. Remains 54 /54 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 16:28:57] [INFO ] Invariant cache hit.
[2024-05-21 16:28:57] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-21 16:28:57] [INFO ] Invariant cache hit.
[2024-05-21 16:28:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:28:58] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-21 16:28:58] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-21 16:28:58] [INFO ] Invariant cache hit.
[2024-05-21 16:28:58] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 602 ms. Remains : 54/54 places, 267/267 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/54 stabilizing places and 7/267 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 233 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33 reset in 102 ms.
Product exploration explored 100000 steps with 270 reset in 480 ms.
Built C files in :
/tmp/ltsmin3822192637674462641
[2024-05-21 16:28:59] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2024-05-21 16:28:59] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:28:59] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2024-05-21 16:28:59] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:28:59] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2024-05-21 16:28:59] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:28:59] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3822192637674462641
Running compilation step : cd /tmp/ltsmin3822192637674462641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1384 ms.
Running link step : cd /tmp/ltsmin3822192637674462641;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3822192637674462641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5849514619724474393.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 267/267 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 16:29:14] [INFO ] Invariant cache hit.
[2024-05-21 16:29:14] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-21 16:29:14] [INFO ] Invariant cache hit.
[2024-05-21 16:29:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:29:15] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-21 16:29:15] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 16:29:15] [INFO ] Invariant cache hit.
[2024-05-21 16:29:15] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 642 ms. Remains : 54/54 places, 267/267 transitions.
Built C files in :
/tmp/ltsmin3362596014486666901
[2024-05-21 16:29:15] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2024-05-21 16:29:15] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:29:15] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2024-05-21 16:29:15] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:29:15] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2024-05-21 16:29:15] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:29:15] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3362596014486666901
Running compilation step : cd /tmp/ltsmin3362596014486666901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1365 ms.
Running link step : cd /tmp/ltsmin3362596014486666901;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3362596014486666901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7111111024938265372.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 16:29:30] [INFO ] Flatten gal took : 39 ms
[2024-05-21 16:29:30] [INFO ] Flatten gal took : 40 ms
[2024-05-21 16:29:30] [INFO ] Time to serialize gal into /tmp/LTL18000178232268051661.gal : 8 ms
[2024-05-21 16:29:30] [INFO ] Time to serialize properties into /tmp/LTL2488904156164517178.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18000178232268051661.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15286540021445170020.hoa' '-atoms' '/tmp/LTL2488904156164517178.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2488904156164517178.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15286540021445170020.hoa
Reverse transition relation is NOT exact ! Due to transitions t11, t72, t76, t99, t104, t127, t132, t157, t162, t184, t188, t212, t216, t238, t243, t56.t67...1707
Computing Next relation with stutter on 52211 deadlock states
Detected timeout of ITS tools.
[2024-05-21 16:29:45] [INFO ] Flatten gal took : 36 ms
[2024-05-21 16:29:45] [INFO ] Flatten gal took : 36 ms
[2024-05-21 16:29:45] [INFO ] Time to serialize gal into /tmp/LTL8170355135562439331.gal : 8 ms
[2024-05-21 16:29:45] [INFO ] Time to serialize properties into /tmp/LTL11360987805767763133.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8170355135562439331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11360987805767763133.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p23==0)||(p317==1))"))))
Formula 0 simplified : GF!"((p23==0)||(p317==1))"
Reverse transition relation is NOT exact ! Due to transitions t11, t72, t76, t99, t104, t127, t132, t157, t162, t184, t188, t212, t216, t238, t243, t56.t67...1707
Computing Next relation with stutter on 52211 deadlock states
Detected timeout of ITS tools.
[2024-05-21 16:30:00] [INFO ] Flatten gal took : 33 ms
[2024-05-21 16:30:00] [INFO ] Applying decomposition
[2024-05-21 16:30:00] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8337137602640359019.txt' '-o' '/tmp/graph8337137602640359019.bin' '-w' '/tmp/graph8337137602640359019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8337137602640359019.bin' '-l' '-1' '-v' '-w' '/tmp/graph8337137602640359019.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:30:01] [INFO ] Decomposing Gal with order
[2024-05-21 16:30:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:30:01] [INFO ] Removed a total of 1330 redundant transitions.
[2024-05-21 16:30:01] [INFO ] Flatten gal took : 176 ms
[2024-05-21 16:30:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2024-05-21 16:30:01] [INFO ] Time to serialize gal into /tmp/LTL5200903178234679043.gal : 12 ms
[2024-05-21 16:30:01] [INFO ] Time to serialize properties into /tmp/LTL8315794683563219965.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5200903178234679043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8315794683563219965.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((u4.p23==0)||(i16.u21.p317==1))"))))
Formula 0 simplified : GF!"((u4.p23==0)||(i16.u21.p317==1))"
Reverse transition relation is NOT exact ! Due to transitions t56_t670, t56_t671, t56_t672, t56_t673, t56_t674, t56_t675, t56_t676, t56_t677, t56_t678, t56...1782
Computing Next relation with stutter on 52211 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5948287218845463393
[2024-05-21 16:30:16] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5948287218845463393
Running compilation step : cd /tmp/ltsmin5948287218845463393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1021 ms.
Running link step : cd /tmp/ltsmin5948287218845463393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5948287218845463393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-07 finished in 95922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p0)))))'
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 269 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 269 transition count 792
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 228 place count 269 transition count 596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 233 place count 264 transition count 591
Iterating global reduction 1 with 5 rules applied. Total rules applied 238 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 263 transition count 590
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 263 transition count 590
Applied a total of 240 rules in 19 ms. Remains 263 /285 variables (removed 22) and now considering 590/808 (removed 218) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-05-21 16:30:31] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 16:30:31] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 16:30:31] [INFO ] Invariant cache hit.
[2024-05-21 16:30:32] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2024-05-21 16:30:32] [INFO ] Invariant cache hit.
[2024-05-21 16:30:32] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/285 places, 590/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1297 ms. Remains : 263/285 places, 590/808 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s90 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-08 finished in 1486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 269 transition count 792
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 269 transition count 792
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 228 place count 269 transition count 596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 233 place count 264 transition count 591
Iterating global reduction 1 with 5 rules applied. Total rules applied 238 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 239 place count 263 transition count 590
Iterating global reduction 1 with 1 rules applied. Total rules applied 240 place count 263 transition count 590
Applied a total of 240 rules in 31 ms. Remains 263 /285 variables (removed 22) and now considering 590/808 (removed 218) transitions.
[2024-05-21 16:30:33] [INFO ] Invariant cache hit.
[2024-05-21 16:30:33] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 16:30:33] [INFO ] Invariant cache hit.
[2024-05-21 16:30:33] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2024-05-21 16:30:33] [INFO ] Invariant cache hit.
[2024-05-21 16:30:34] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/285 places, 590/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1390 ms. Remains : 263/285 places, 590/808 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s92 0) (EQ s217 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-09 finished in 1488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(p1))))'
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 270 transition count 793
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 270 transition count 793
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 226 place count 270 transition count 597
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 231 place count 265 transition count 592
Iterating global reduction 1 with 5 rules applied. Total rules applied 236 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 237 place count 264 transition count 591
Iterating global reduction 1 with 1 rules applied. Total rules applied 238 place count 264 transition count 591
Applied a total of 238 rules in 19 ms. Remains 264 /285 variables (removed 21) and now considering 591/808 (removed 217) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-05-21 16:30:34] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 16:30:34] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 16:30:34] [INFO ] Invariant cache hit.
[2024-05-21 16:30:35] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2024-05-21 16:30:35] [INFO ] Invariant cache hit.
[2024-05-21 16:30:35] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 264/285 places, 591/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1165 ms. Remains : 264/285 places, 591/808 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s126 0) (EQ s9 1)), p1:(OR (EQ s143 0) (EQ s70 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 667 ms.
Product exploration explored 100000 steps with 50000 reset in 323 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), (X p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLCardinality-10 finished in 2347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 268 edges and 285 vertex of which 4 / 285 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 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 282 transition count 695
Reduce places removed 110 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 150 rules applied. Total rules applied 261 place count 172 transition count 655
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 285 place count 148 transition count 655
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 285 place count 148 transition count 650
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 295 place count 143 transition count 650
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 306 place count 132 transition count 639
Iterating global reduction 3 with 11 rules applied. Total rules applied 317 place count 132 transition count 639
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 513 place count 132 transition count 443
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 513 place count 132 transition count 442
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 515 place count 131 transition count 442
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 517 place count 129 transition count 434
Iterating global reduction 4 with 2 rules applied. Total rules applied 519 place count 129 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 4 with 2 rules applied. Total rules applied 521 place count 129 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 522 place count 128 transition count 432
Performed 55 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 632 place count 73 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 633 place count 73 transition count 375
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 646 place count 60 transition count 277
Iterating global reduction 7 with 13 rules applied. Total rules applied 659 place count 60 transition count 277
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 665 place count 60 transition count 271
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 8 with 2 rules applied. Total rules applied 667 place count 59 transition count 270
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 669 place count 57 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 670 place count 56 transition count 268
Applied a total of 670 rules in 57 ms. Remains 56 /285 variables (removed 229) and now considering 268/808 (removed 540) transitions.
// Phase 1: matrix 268 rows 56 cols
[2024-05-21 16:30:36] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 16:30:37] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-21 16:30:37] [INFO ] Invariant cache hit.
[2024-05-21 16:30:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:30:37] [INFO ] Implicit Places using invariants and state equation in 279 ms returned [51, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 474 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/285 places, 268/808 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 267
Applied a total of 2 rules in 13 ms. Remains 53 /54 variables (removed 1) and now considering 267/268 (removed 1) transitions.
// Phase 1: matrix 267 rows 53 cols
[2024-05-21 16:30:37] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 16:30:37] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-21 16:30:37] [INFO ] Invariant cache hit.
[2024-05-21 16:30:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:30:37] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/285 places, 267/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1019 ms. Remains : 53/285 places, 267/808 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-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:(OR (EQ s36 0) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 537 reset in 125 ms.
Product exploration explored 100000 steps with 131 reset in 128 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 267/267 transitions.
Applied a total of 0 rules in 11 ms. Remains 53 /53 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 16:30:38] [INFO ] Invariant cache hit.
[2024-05-21 16:30:39] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 16:30:39] [INFO ] Invariant cache hit.
[2024-05-21 16:30:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:30:39] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2024-05-21 16:30:39] [INFO ] Redundant transitions in 24 ms returned [263]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 266 rows 53 cols
[2024-05-21 16:30:39] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 16:30:39] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/53 places, 266/267 transitions.
Reduce places removed 1 places and 1 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 51 transition count 264
Applied a total of 2 rules in 15 ms. Remains 51 /53 variables (removed 2) and now considering 264/266 (removed 2) transitions.
// Phase 1: matrix 264 rows 51 cols
[2024-05-21 16:30:39] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:30:39] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 16:30:39] [INFO ] Invariant cache hit.
[2024-05-21 16:30:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:30:40] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/53 places, 264/267 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1180 ms. Remains : 51/53 places, 264/267 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21 reset in 83 ms.
Product exploration explored 100000 steps with 230 reset in 121 ms.
Built C files in :
/tmp/ltsmin15901440858003620018
[2024-05-21 16:30:40] [INFO ] Computing symmetric may disable matrix : 264 transitions.
[2024-05-21 16:30:40] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:30:40] [INFO ] Computing symmetric may enable matrix : 264 transitions.
[2024-05-21 16:30:40] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:30:41] [INFO ] Computing Do-Not-Accords matrix : 264 transitions.
[2024-05-21 16:30:41] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:30:41] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15901440858003620018
Running compilation step : cd /tmp/ltsmin15901440858003620018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1654 ms.
Running link step : cd /tmp/ltsmin15901440858003620018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15901440858003620018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12410892740009730572.hoa' '--buchi-type=spotba'
LTSmin run took 1664 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-07b-LTLCardinality-11 finished in 7493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 270 transition count 793
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 270 transition count 793
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 226 place count 270 transition count 597
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 230 place count 266 transition count 593
Iterating global reduction 1 with 4 rules applied. Total rules applied 234 place count 266 transition count 593
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 235 place count 265 transition count 592
Iterating global reduction 1 with 1 rules applied. Total rules applied 236 place count 265 transition count 592
Applied a total of 236 rules in 22 ms. Remains 265 /285 variables (removed 20) and now considering 592/808 (removed 216) transitions.
// Phase 1: matrix 592 rows 265 cols
[2024-05-21 16:30:44] [INFO ] Computed 12 invariants in 4 ms
[2024-05-21 16:30:44] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-21 16:30:44] [INFO ] Invariant cache hit.
[2024-05-21 16:30:44] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2024-05-21 16:30:45] [INFO ] Invariant cache hit.
[2024-05-21 16:30:45] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 265/285 places, 592/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1182 ms. Remains : 265/285 places, 592/808 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s8 0) (EQ s149 1)), p1:(AND (EQ s2 0) (EQ s209 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 607 steps with 4 reset in 2 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-12 finished in 1328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!(p0 U p1))||!(G(p0) U G(p2))||X(p3))))'
Support contains 7 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 272 transition count 795
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 272 transition count 795
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 222 place count 272 transition count 599
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 226 place count 268 transition count 595
Iterating global reduction 1 with 4 rules applied. Total rules applied 230 place count 268 transition count 595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 231 place count 267 transition count 594
Iterating global reduction 1 with 1 rules applied. Total rules applied 232 place count 267 transition count 594
Applied a total of 232 rules in 28 ms. Remains 267 /285 variables (removed 18) and now considering 594/808 (removed 214) transitions.
// Phase 1: matrix 594 rows 267 cols
[2024-05-21 16:30:45] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 16:30:45] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 16:30:46] [INFO ] Invariant cache hit.
[2024-05-21 16:30:46] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2024-05-21 16:30:46] [INFO ] Invariant cache hit.
[2024-05-21 16:30:47] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/285 places, 594/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1332 ms. Remains : 267/285 places, 594/808 transitions.
Stuttering acceptance computed with spot in 355 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3))), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p3), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 p1 p3), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s27 0) (EQ s182 1)), p2:(OR (EQ s51 0) (EQ s31 1)), p1:(EQ s122 1), p3:(AND (EQ s85 0) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11554 reset in 319 ms.
Product exploration explored 100000 steps with 11556 reset in 286 ms.
Computed a total of 44 stabilizing places and 45 stable transitions
Computed a total of 44 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 127 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Finished random walk after 1981 steps, including 19 resets, run visited all 10 properties in 82 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p3) p1)), (F (NOT (AND p0 (NOT p3)))), (F (AND p2 p1)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (AND p0 p2) (AND p2 p1)))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1)))), (F (NOT p0)), (F (AND p0 p2 p3 p1)), (F (AND p0 p3)), (F (AND p0 p2 p1))]
Knowledge based reduction with 9 factoid took 632 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 307 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Applied a total of 0 rules in 6 ms. Remains 267 /267 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2024-05-21 16:30:49] [INFO ] Invariant cache hit.
[2024-05-21 16:30:50] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 16:30:50] [INFO ] Invariant cache hit.
[2024-05-21 16:30:50] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2024-05-21 16:30:50] [INFO ] Invariant cache hit.
[2024-05-21 16:30:51] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1523 ms. Remains : 267/267 places, 594/594 transitions.
Computed a total of 44 stabilizing places and 45 stable transitions
Computed a total of 44 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p3 p1)))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 178 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Incomplete random walk after 10000 steps, including 30 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 16:30:52] [INFO ] Invariant cache hit.
[2024-05-21 16:30:52] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-21 16:30:52] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 16:30:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 16:30:52] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 16:30:53] [INFO ] Deduced a trap composed of 28 places in 341 ms of which 2 ms to minimize.
[2024-05-21 16:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2024-05-21 16:30:53] [INFO ] After 835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-21 16:30:53] [INFO ] After 992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 241 edges and 267 vertex of which 4 / 267 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 1086 edges and 265 vertex of which 263 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 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 263 transition count 499
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 129 rules applied. Total rules applied 222 place count 174 transition count 459
Reduce places removed 23 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 26 rules applied. Total rules applied 248 place count 151 transition count 456
Reduce places removed 3 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 5 rules applied. Total rules applied 253 place count 148 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 254 place count 147 transition count 454
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 254 place count 147 transition count 445
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 272 place count 138 transition count 445
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 5 with 112 rules applied. Total rules applied 384 place count 82 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 385 place count 82 transition count 388
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 398 place count 69 transition count 298
Iterating global reduction 6 with 13 rules applied. Total rules applied 411 place count 69 transition count 298
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 416 place count 69 transition count 293
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 418 place count 68 transition count 292
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 427 place count 68 transition count 283
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 436 place count 59 transition count 283
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 438 place count 59 transition count 281
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 439 place count 59 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 440 place count 58 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 441 place count 57 transition count 280
Applied a total of 441 rules in 117 ms. Remains 57 /267 variables (removed 210) and now considering 280/594 (removed 314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 57/267 places, 280/594 transitions.
Finished random walk after 2016 steps, including 16 resets, run visited all 1 properties in 15 ms. (steps per millisecond=134 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p3 p1)))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p3) p1)), (F (NOT (AND p0 (NOT p3)))), (F (AND p2 p1)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (AND p0 p2) (AND p2 p1)))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 (NOT p3) p1)))), (F (NOT p0)), (F (AND p0 p2 p3 p1)), (F (AND p0 p3)), (F (AND p0 p2 p1))]
Knowledge based reduction with 9 factoid took 557 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 281 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 308 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Product exploration explored 100000 steps with 11600 reset in 317 ms.
Product exploration explored 100000 steps with 11606 reset in 356 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 319 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 241 edges and 267 vertex of which 4 / 267 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 91 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 265 transition count 592
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 109 place count 265 transition count 575
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 109 place count 265 transition count 575
Deduced a syphon composed of 110 places in 1 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 128 place count 265 transition count 575
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 200 place count 193 transition count 503
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 272 place count 193 transition count 503
Performed 70 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 109 places in 1 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 342 place count 193 transition count 513
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 344 place count 193 transition count 511
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 403 place count 134 transition count 375
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 3 with 59 rules applied. Total rules applied 462 place count 134 transition count 375
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 472 place count 134 transition count 365
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 478 place count 128 transition count 359
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 484 place count 128 transition count 359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 485 place count 128 transition count 359
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 487 place count 126 transition count 357
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 489 place count 126 transition count 357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 490 place count 126 transition count 359
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 490 rules in 98 ms. Remains 126 /267 variables (removed 141) and now considering 359/594 (removed 235) transitions.
[2024-05-21 16:30:56] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 359 rows 126 cols
[2024-05-21 16:30:56] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 16:30:56] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/267 places, 359/594 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 126/267 places, 359/594 transitions.
Built C files in :
/tmp/ltsmin11662641938367583316
[2024-05-21 16:30:56] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11662641938367583316
Running compilation step : cd /tmp/ltsmin11662641938367583316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2063 ms.
Running link step : cd /tmp/ltsmin11662641938367583316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin11662641938367583316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1637708525464249521.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Applied a total of 0 rules in 12 ms. Remains 267 /267 variables (removed 0) and now considering 594/594 (removed 0) transitions.
// Phase 1: matrix 594 rows 267 cols
[2024-05-21 16:31:12] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 16:31:12] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 16:31:12] [INFO ] Invariant cache hit.
[2024-05-21 16:31:12] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2024-05-21 16:31:12] [INFO ] Invariant cache hit.
[2024-05-21 16:31:13] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1038 ms. Remains : 267/267 places, 594/594 transitions.
Built C files in :
/tmp/ltsmin11022338601704499607
[2024-05-21 16:31:13] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11022338601704499607
Running compilation step : cd /tmp/ltsmin11022338601704499607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1917 ms.
Running link step : cd /tmp/ltsmin11022338601704499607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin11022338601704499607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9717738877945877648.hoa' '--buchi-type=spotba'
LTSmin run took 12509 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-07b-LTLCardinality-13 finished in 41863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 3 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 808/808 transitions.
Graph (trivial) has 268 edges and 285 vertex of which 4 / 285 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 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 282 transition count 694
Reduce places removed 111 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 152 rules applied. Total rules applied 264 place count 171 transition count 653
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 288 place count 147 transition count 653
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 288 place count 147 transition count 647
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 300 place count 141 transition count 647
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 310 place count 131 transition count 637
Iterating global reduction 3 with 10 rules applied. Total rules applied 320 place count 131 transition count 637
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 516 place count 131 transition count 441
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 516 place count 131 transition count 440
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 130 transition count 440
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 520 place count 128 transition count 432
Iterating global reduction 4 with 2 rules applied. Total rules applied 522 place count 128 transition count 432
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 524 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 525 place count 127 transition count 430
Performed 54 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 633 place count 73 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 634 place count 73 transition count 374
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 645 place count 62 transition count 291
Iterating global reduction 7 with 11 rules applied. Total rules applied 656 place count 62 transition count 291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 661 place count 62 transition count 286
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 8 with 2 rules applied. Total rules applied 663 place count 61 transition count 285
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 665 place count 59 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 666 place count 58 transition count 283
Applied a total of 666 rules in 74 ms. Remains 58 /285 variables (removed 227) and now considering 283/808 (removed 525) transitions.
// Phase 1: matrix 283 rows 58 cols
[2024-05-21 16:31:27] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 16:31:27] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 16:31:27] [INFO ] Invariant cache hit.
[2024-05-21 16:31:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 16:31:28] [INFO ] Implicit Places using invariants and state equation in 277 ms returned [51, 57]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 438 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/285 places, 283/808 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 282
Applied a total of 2 rules in 16 ms. Remains 55 /56 variables (removed 1) and now considering 282/283 (removed 1) transitions.
// Phase 1: matrix 282 rows 55 cols
[2024-05-21 16:31:28] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 16:31:28] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 16:31:28] [INFO ] Invariant cache hit.
[2024-05-21 16:31:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 16:31:28] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/285 places, 282/808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 999 ms. Remains : 55/285 places, 282/808 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s15 1), p0:(OR (EQ s9 0) (EQ s53 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]]
Entered a terminal (fully accepting) state of product in 621 steps with 42 reset in 3 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-15 finished in 1153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-21 16:31:28] [INFO ] Flatten gal took : 71 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12717375651608058076
[2024-05-21 16:31:29] [INFO ] Computing symmetric may disable matrix : 808 transitions.
[2024-05-21 16:31:29] [INFO ] Computation of Complete disable matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:31:29] [INFO ] Applying decomposition
[2024-05-21 16:31:29] [INFO ] Computing symmetric may enable matrix : 808 transitions.
[2024-05-21 16:31:29] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:31:29] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8476880772435762156.txt' '-o' '/tmp/graph8476880772435762156.bin' '-w' '/tmp/graph8476880772435762156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8476880772435762156.bin' '-l' '-1' '-v' '-w' '/tmp/graph8476880772435762156.weights' '-q' '0' '-e' '0.001'
[2024-05-21 16:31:29] [INFO ] Decomposing Gal with order
[2024-05-21 16:31:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:31:29] [INFO ] Computing Do-Not-Accords matrix : 808 transitions.
[2024-05-21 16:31:29] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 16:31:29] [INFO ] Built C files in 452ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12717375651608058076
Running compilation step : cd /tmp/ltsmin12717375651608058076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 16:31:29] [INFO ] Removed a total of 1952 redundant transitions.
[2024-05-21 16:31:29] [INFO ] Flatten gal took : 134 ms
[2024-05-21 16:31:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 16 ms.
[2024-05-21 16:31:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality5032755778024763003.gal : 8 ms
[2024-05-21 16:31:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality1635144991958820843.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5032755778024763003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1635144991958820843.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((i2.i2.u5.p23==0)||(i17.u98.p317==1))"))))
Formula 0 simplified : GF!"((i2.i2.u5.p23==0)||(i17.u98.p317==1))"
Compilation finished in 4373 ms.
Running link step : cd /tmp/ltsmin12717375651608058076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin12717375651608058076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 16:52:32] [INFO ] Applying decomposition
[2024-05-21 16:52:32] [INFO ] Flatten gal took : 62 ms
[2024-05-21 16:52:32] [INFO ] Decomposing Gal with order
[2024-05-21 16:52:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 16:52:32] [INFO ] Removed a total of 2544 redundant transitions.
[2024-05-21 16:52:32] [INFO ] Flatten gal took : 250 ms
[2024-05-21 16:52:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 47 ms.
[2024-05-21 16:52:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality5086648159427382383.gal : 4 ms
[2024-05-21 16:52:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality16554563237304816728.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5086648159427382383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16554563237304816728.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((i1.i0.i0.u24.p23==0)||(i1.i1.u22.p317==1))"))))
Formula 0 simplified : GF!"((i1.i0.i0.u24.p23==0)||(i1.i1.u22.p317==1))"
Reverse transition relation is NOT exact ! Due to transitions t628, t629, i0.u2.t269, i0.u2.t270, i0.u3.t267, i1.t805, i1.i0.u19.t36, i1.i0.u19.t40, i1.i0....1632
Computing Next relation with stutter on 390272 deadlock states
Detected timeout of ITS tools.
[2024-05-21 17:13:34] [INFO ] Flatten gal took : 112 ms
[2024-05-21 17:13:34] [INFO ] Input system was already deterministic with 808 transitions.
[2024-05-21 17:13:34] [INFO ] Transformed 285 places.
[2024-05-21 17:13:34] [INFO ] Transformed 808 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2024-05-21 17:13:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality16880907070852062361.gal : 16 ms
[2024-05-21 17:13:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality762347391382215170.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16880907070852062361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality762347391382215170.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((p23==0)||(p317==1))"))))
Formula 0 simplified : GF!"((p23==0)||(p317==1))"
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t19, t28, t36, t40, t41, t42, t71, t72, t75, t76, t78, t92, t98, t99, t102, t104, t...753
Computing Next relation with stutter on 390272 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9447256 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16040604 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-07b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AutonomousCar-PT-07b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180300202"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;