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-171620180200143.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-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180200143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 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 31K 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-01b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716305779706

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 15:36:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 15:36:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:36:23] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-21 15:36:23] [INFO ] Transformed 119 places.
[2024-05-21 15:36:23] [INFO ] Transformed 132 transitions.
[2024-05-21 15:36:23] [INFO ] Found NUPN structural information;
[2024-05-21 15:36:23] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 427 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-01b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 111 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 111 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 110 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 110 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 109 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 109 transition count 122
Applied a total of 20 rules in 64 ms. Remains 109 /119 variables (removed 10) and now considering 122/132 (removed 10) transitions.
// Phase 1: matrix 122 rows 109 cols
[2024-05-21 15:36:23] [INFO ] Computed 6 invariants in 15 ms
[2024-05-21 15:36:24] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-21 15:36:24] [INFO ] Invariant cache hit.
[2024-05-21 15:36:24] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2024-05-21 15:36:24] [INFO ] Invariant cache hit.
[2024-05-21 15:36:24] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/119 places, 122/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1040 ms. Remains : 109/119 places, 122/132 transitions.
Support contains 36 out of 109 places after structural reductions.
[2024-05-21 15:36:25] [INFO ] Flatten gal took : 112 ms
[2024-05-21 15:36:25] [INFO ] Flatten gal took : 28 ms
[2024-05-21 15:36:25] [INFO ] Input system was already deterministic with 122 transitions.
Support contains 35 out of 109 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 839 ms. (steps per millisecond=11 ) properties (out of 32) seen :22
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 15:36:27] [INFO ] Invariant cache hit.
[2024-05-21 15:36:27] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 15:36:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-21 15:36:27] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-21 15:36:27] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-21 15:36:27] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 97 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 4 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA AutonomousCar-PT-01b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 28 stabilizing places and 29 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' '!(G((G(F(p0)) U !p0)))'
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 122/122 transitions.
Graph (trivial) has 101 edges and 109 vertex of which 4 / 109 are part of one of the 2 SCC in 5 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 106 transition count 73
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 57 rules applied. Total rules applied 104 place count 60 transition count 62
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 111 place count 54 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 53 transition count 61
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 112 place count 53 transition count 55
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 124 place count 47 transition count 55
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 131 place count 40 transition count 48
Iterating global reduction 4 with 7 rules applied. Total rules applied 138 place count 40 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 142 place count 40 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 142 place count 40 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 144 place count 39 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 38 transition count 42
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 38 transition count 42
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 148 place count 38 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 149 place count 37 transition count 40
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 177 place count 23 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 178 place count 23 transition count 24
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 180 place count 21 transition count 21
Iterating global reduction 8 with 2 rules applied. Total rules applied 182 place count 21 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 186 place count 19 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 187 place count 18 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 188 place count 17 transition count 18
Applied a total of 188 rules in 65 ms. Remains 17 /109 variables (removed 92) and now considering 18/122 (removed 104) transitions.
// Phase 1: matrix 18 rows 17 cols
[2024-05-21 15:36:28] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 15:36:28] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 15:36:28] [INFO ] Invariant cache hit.
[2024-05-21 15:36:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:36:28] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [12, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 142 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/109 places, 18/122 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 14 transition count 17
Applied a total of 2 rules in 6 ms. Remains 14 /15 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 14 cols
[2024-05-21 15:36:28] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 15:36:28] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 15:36:28] [INFO ] Invariant cache hit.
[2024-05-21 15:36:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:36:28] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/109 places, 17/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 316 ms. Remains : 14/109 places, 17/122 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 400 ms :[p0, (NOT p0), p0, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-01 finished in 818 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)&&G(F((!p0 U (p1||G(!p0)))))))'
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 122/122 transitions.
Graph (trivial) has 97 edges and 109 vertex of which 4 / 109 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 106 transition count 73
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 57 rules applied. Total rules applied 104 place count 60 transition count 62
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 110 place count 54 transition count 62
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 110 place count 54 transition count 55
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 124 place count 47 transition count 55
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 130 place count 41 transition count 49
Iterating global reduction 3 with 6 rules applied. Total rules applied 136 place count 41 transition count 49
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 164 place count 27 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 165 place count 27 transition count 33
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 167 place count 25 transition count 29
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 25 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 173 place count 23 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 23 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 22 transition count 26
Applied a total of 175 rules in 41 ms. Remains 22 /109 variables (removed 87) and now considering 26/122 (removed 96) transitions.
// Phase 1: matrix 26 rows 22 cols
[2024-05-21 15:36:29] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 15:36:29] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 15:36:29] [INFO ] Invariant cache hit.
[2024-05-21 15:36:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:36:29] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [17, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 186 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/109 places, 26/122 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 19 transition count 25
Applied a total of 2 rules in 5 ms. Remains 19 /20 variables (removed 1) and now considering 25/26 (removed 1) transitions.
// Phase 1: matrix 25 rows 19 cols
[2024-05-21 15:36:29] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 15:36:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 15:36:29] [INFO ] Invariant cache hit.
[2024-05-21 15:36:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:36:29] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/109 places, 25/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 346 ms. Remains : 19/109 places, 25/122 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s4 1) (EQ s8 1) (EQ s14 1)), p1:(AND (NOT (AND (EQ s3 1) (EQ s4 1) (EQ s8 1) (EQ s14 1))) (NEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-03 finished in 648 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))&&G((G(p2)||p1))))'
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 122/122 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 99 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 97 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 97 transition count 106
Applied a total of 28 rules in 27 ms. Remains 97 /109 variables (removed 12) and now considering 106/122 (removed 16) transitions.
// Phase 1: matrix 106 rows 97 cols
[2024-05-21 15:36:29] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 15:36:29] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 15:36:29] [INFO ] Invariant cache hit.
[2024-05-21 15:36:30] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-21 15:36:30] [INFO ] Invariant cache hit.
[2024-05-21 15:36:30] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/109 places, 106/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 97/109 places, 106/122 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s70 0) (EQ s4 0) (EQ s6 0) (EQ s33 0) (EQ s62 0)), p2:(EQ s70 1), p0:(EQ s55 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 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-04 finished in 626 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 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 122/122 transitions.
Graph (trivial) has 100 edges and 109 vertex of which 4 / 109 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 106 transition count 74
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 56 rules applied. Total rules applied 102 place count 61 transition count 63
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 55 transition count 63
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 108 place count 55 transition count 57
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 120 place count 49 transition count 57
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 127 place count 42 transition count 50
Iterating global reduction 3 with 7 rules applied. Total rules applied 134 place count 42 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 138 place count 42 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 138 place count 42 transition count 45
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 140 place count 41 transition count 45
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 40 transition count 44
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 40 transition count 44
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 144 place count 40 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 145 place count 39 transition count 42
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 175 place count 24 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 176 place count 24 transition count 26
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 178 place count 22 transition count 23
Iterating global reduction 7 with 2 rules applied. Total rules applied 180 place count 22 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 184 place count 20 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 186 place count 18 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 187 place count 17 transition count 19
Applied a total of 187 rules in 42 ms. Remains 17 /109 variables (removed 92) and now considering 19/122 (removed 103) transitions.
// Phase 1: matrix 19 rows 17 cols
[2024-05-21 15:36:30] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 15:36:30] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 15:36:30] [INFO ] Invariant cache hit.
[2024-05-21 15:36:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:36:30] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [10, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 133 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/109 places, 19/122 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 14 transition count 18
Applied a total of 2 rules in 3 ms. Remains 14 /15 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-05-21 15:36:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 15:36:30] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 15:36:30] [INFO ] Invariant cache hit.
[2024-05-21 15:36:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:36:30] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/109 places, 18/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 339 ms. Remains : 14/109 places, 18/122 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s12 0)], 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 0 reset in 279 ms.
Product exploration explored 100000 steps with 3 reset in 210 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 122 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 51 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
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 169 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 67 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 15:36:31] [INFO ] Invariant cache hit.
[2024-05-21 15:36:31] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 15:36:31] [INFO ] Invariant cache hit.
[2024-05-21 15:36:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:36:32] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-21 15:36:32] [INFO ] Redundant transitions in 14 ms returned [13]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 17 rows 14 cols
[2024-05-21 15:36:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 15:36:32] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/14 places, 17/18 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 12 transition count 15
Applied a total of 2 rules in 3 ms. Remains 12 /14 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 12 cols
[2024-05-21 15:36:32] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 15:36:32] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 15:36:32] [INFO ] Invariant cache hit.
[2024-05-21 15:36:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:36:32] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/14 places, 15/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 263 ms. Remains : 12/14 places, 15/18 transitions.
Computed a total of 0 stabilizing places and 2 stable transitions
Computed a total of 0 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 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 66 ms :[(NOT p0)]
Finished random walk after 15 steps, including 1 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 159 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 383 ms.
Built C files in :
/tmp/ltsmin1197416525071185081
[2024-05-21 15:36:33] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2024-05-21 15:36:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:36:33] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2024-05-21 15:36:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:36:33] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2024-05-21 15:36:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:36:33] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1197416525071185081
Running compilation step : cd /tmp/ltsmin1197416525071185081;'/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 479 ms.
Running link step : cd /tmp/ltsmin1197416525071185081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin1197416525071185081;'/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/stateBased12953663398889143836.hoa' '--buchi-type=spotba'
LTSmin run took 168 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLFireability-05 finished in 3560 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)||(F(p2)&&F(!p0))))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 122/122 transitions.
Graph (trivial) has 98 edges and 109 vertex of which 4 / 109 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 106 transition count 76
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 53 rules applied. Total rules applied 97 place count 63 transition count 66
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 104 place count 57 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 56 transition count 65
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 105 place count 56 transition count 60
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 115 place count 51 transition count 60
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 121 place count 45 transition count 54
Iterating global reduction 4 with 6 rules applied. Total rules applied 127 place count 45 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 131 place count 45 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 131 place count 45 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 133 place count 44 transition count 49
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 134 place count 43 transition count 48
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 43 transition count 48
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 137 place count 43 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 138 place count 42 transition count 46
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 168 place count 27 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 169 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 171 place count 25 transition count 26
Iterating global reduction 8 with 2 rules applied. Total rules applied 173 place count 25 transition count 26
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 177 place count 23 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 179 place count 21 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 180 place count 20 transition count 22
Applied a total of 180 rules in 34 ms. Remains 20 /109 variables (removed 89) and now considering 22/122 (removed 100) transitions.
// Phase 1: matrix 22 rows 20 cols
[2024-05-21 15:36:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:36:34] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 15:36:34] [INFO ] Invariant cache hit.
[2024-05-21 15:36:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:36:34] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 132 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/109 places, 22/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 19/109 places, 22/122 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p2) (NOT p0)), (AND p0 (NOT p1)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s11 1), p2:(EQ s14 1), p1:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-07 finished in 440 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' '!(!(p0 U G((!p1 U ((F(p2)&&p3) U p2)))))'
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 122/122 transitions.
Graph (trivial) has 91 edges and 109 vertex of which 4 / 109 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 106 transition count 78
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 52 rules applied. Total rules applied 94 place count 65 transition count 67
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 101 place count 59 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 58 transition count 66
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 102 place count 58 transition count 59
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 116 place count 51 transition count 59
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 122 place count 45 transition count 53
Iterating global reduction 4 with 6 rules applied. Total rules applied 128 place count 45 transition count 53
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 132 place count 45 transition count 49
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 160 place count 31 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 161 place count 31 transition count 33
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 30 transition count 32
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 30 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 167 place count 28 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 27 transition count 29
Applied a total of 168 rules in 25 ms. Remains 27 /109 variables (removed 82) and now considering 29/122 (removed 93) transitions.
// Phase 1: matrix 29 rows 27 cols
[2024-05-21 15:36:34] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 15:36:34] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 15:36:34] [INFO ] Invariant cache hit.
[2024-05-21 15:36:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:36:34] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [20, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 89 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/109 places, 29/122 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 24 transition count 28
Applied a total of 2 rules in 3 ms. Remains 24 /25 variables (removed 1) and now considering 28/29 (removed 1) transitions.
// Phase 1: matrix 28 rows 24 cols
[2024-05-21 15:36:34] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 15:36:34] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 15:36:34] [INFO ] Invariant cache hit.
[2024-05-21 15:36:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:36:34] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/109 places, 28/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 24/109 places, 28/122 transitions.
Stuttering acceptance computed with spot in 172 ms :[p2, p2, p2]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={0} source=2 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s3 1) (EQ s11 1) (EQ s15 1) (EQ s18 1)), p1:(AND (EQ s2 1) (EQ s3 1) (EQ s11 1) (EQ s15 1)), p2:(EQ s22 1), p3:(EQ s7 1)], nbAcceptance=1, 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 7 reset in 216 ms.
Product exploration explored 100000 steps with 0 reset in 200 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND p3 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p1)) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 177 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 277 ms :[p2, p2, p2, false, false]
Incomplete random walk after 10000 steps, including 789 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 243 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 15:36:35] [INFO ] Invariant cache hit.
[2024-05-21 15:36:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 15:36:35] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND p3 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p1)) p2))), (G (NOT (AND p1 (NOT p2) p3)))]
False Knowledge obtained : [(F (AND (NOT p2) p3)), (F p2), (F (AND p1 (NOT p2) (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 16 factoid took 305 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[p2, p2, false]
Stuttering acceptance computed with spot in 142 ms :[p2, p2, false]
Support contains 5 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-21 15:36:36] [INFO ] Invariant cache hit.
[2024-05-21 15:36:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 15:36:36] [INFO ] Invariant cache hit.
[2024-05-21 15:36:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:36:36] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-21 15:36:36] [INFO ] Redundant transitions in 18 ms returned [21]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 27 rows 24 cols
[2024-05-21 15:36:36] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 15:36:36] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/24 places, 27/28 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 22 transition count 25
Applied a total of 4 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 25/27 (removed 2) transitions.
// Phase 1: matrix 25 rows 22 cols
[2024-05-21 15:36:36] [INFO ] Computed 3 invariants in 3 ms
[2024-05-21 15:36:36] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 15:36:36] [INFO ] Invariant cache hit.
[2024-05-21 15:36:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:36:36] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/24 places, 25/28 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 249 ms. Remains : 22/24 places, 25/28 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 135 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[p2, p2, false]
Finished random walk after 246 steps, including 19 resets, run visited all 3 properties in 3 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 233 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[p2, p2, false]
Stuttering acceptance computed with spot in 119 ms :[p2, p2, false]
Stuttering acceptance computed with spot in 146 ms :[p2, p2, false]
Product exploration explored 100000 steps with 1 reset in 67 ms.
Product exploration explored 100000 steps with 1 reset in 69 ms.
Built C files in :
/tmp/ltsmin16784079108734891333
[2024-05-21 15:36:37] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2024-05-21 15:36:37] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:36:37] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2024-05-21 15:36:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:36:37] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2024-05-21 15:36:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:36:37] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16784079108734891333
Running compilation step : cd /tmp/ltsmin16784079108734891333;'/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 125 ms.
Running link step : cd /tmp/ltsmin16784079108734891333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16784079108734891333;'/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/stateBased4310774129737304328.hoa' '--buchi-type=spotba'
LTSmin run took 66 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLFireability-08 finished in 3654 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 U p2)))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 122/122 transitions.
Graph (trivial) has 98 edges and 109 vertex of which 4 / 109 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.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 107 transition count 77
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 98 place count 64 transition count 66
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 104 place count 58 transition count 66
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 104 place count 58 transition count 60
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 116 place count 52 transition count 60
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 123 place count 45 transition count 53
Iterating global reduction 3 with 7 rules applied. Total rules applied 130 place count 45 transition count 53
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 134 place count 45 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 134 place count 45 transition count 48
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 136 place count 44 transition count 48
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 43 transition count 47
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 43 transition count 47
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 140 place count 43 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 141 place count 42 transition count 45
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 175 place count 25 transition count 27
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 177 place count 23 transition count 24
Iterating global reduction 6 with 2 rules applied. Total rules applied 179 place count 23 transition count 24
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 6 with 2 rules applied. Total rules applied 181 place count 22 transition count 23
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 6 with 2 rules applied. Total rules applied 183 place count 21 transition count 23
Applied a total of 183 rules in 26 ms. Remains 21 /109 variables (removed 88) and now considering 23/122 (removed 99) transitions.
// Phase 1: matrix 23 rows 21 cols
[2024-05-21 15:36:38] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 15:36:38] [INFO ] Implicit Places using invariants in 40 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/109 places, 23/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 71 ms. Remains : 20/109 places, 23/122 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s11 1), p1:(EQ s0 1), p0:(NEQ s9 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]]
Product exploration explored 100000 steps with 1 reset in 46 ms.
Product exploration explored 100000 steps with 1 reset in 81 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Detected a total of 2/20 stabilizing places and 3/23 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X p0), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), true, (X (X (NOT p2))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 161 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (NOT p0), (NOT p0)]
Finished random walk after 45 steps, including 5 resets, run visited all 4 properties in 1 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X p0), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), true, (X (X (NOT p2))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 459 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (NOT p0), (NOT p0)]
// Phase 1: matrix 23 rows 20 cols
[2024-05-21 15:36:39] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 15:36:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 15:36:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:36:39] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-21 15:36:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:36:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 15:36:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:36:39] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-21 15:36:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:36:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-21 15:36:39] [INFO ] Computed and/alt/rep : 20/93/20 causal constraints (skipped 2 transitions) in 5 ms.
[2024-05-21 15:36:39] [INFO ] Added : 6 causal constraints over 3 iterations in 53 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 23/23 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2024-05-21 15:36:39] [INFO ] Invariant cache hit.
[2024-05-21 15:36:39] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 15:36:39] [INFO ] Invariant cache hit.
[2024-05-21 15:36:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:36:40] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [15, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 173 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/20 places, 23/23 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 17 transition count 22
Applied a total of 2 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 22/23 (removed 1) transitions.
// Phase 1: matrix 22 rows 17 cols
[2024-05-21 15:36:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 15:36:40] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 15:36:40] [INFO ] Invariant cache hit.
[2024-05-21 15:36:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:36:40] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/20 places, 22/23 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 17/20 places, 22/23 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Detected a total of 2/17 stabilizing places and 3/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 260 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p0), (NOT p0)]
Finished random walk after 23 steps, including 3 resets, run visited all 4 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 549 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (NOT p0), (NOT p0)]
[2024-05-21 15:36:41] [INFO ] Invariant cache hit.
[2024-05-21 15:36:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 15:36:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:36:41] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-21 15:36:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:36:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 15:36:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:36:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-21 15:36:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:36:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-21 15:36:41] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-21 15:36:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-21 15:36:41] [INFO ] Computed and/alt/rep : 19/81/19 causal constraints (skipped 2 transitions) in 3 ms.
[2024-05-21 15:36:41] [INFO ] Added : 12 causal constraints over 4 iterations in 30 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 64 ms.
Product exploration explored 100000 steps with 1 reset in 78 ms.
Built C files in :
/tmp/ltsmin661089588014279838
[2024-05-21 15:36:41] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-21 15:36:41] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:36:41] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-21 15:36:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:36:41] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-21 15:36:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:36:41] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin661089588014279838
Running compilation step : cd /tmp/ltsmin661089588014279838;'/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 127 ms.
Running link step : cd /tmp/ltsmin661089588014279838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin661089588014279838;'/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/stateBased12573276236479684199.hoa' '--buchi-type=spotba'
LTSmin run took 48 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLFireability-09 finished in 4012 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(X((p0&&X(F((p1||X(p1))))))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 122/122 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 100 transition count 113
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 100 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 100 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 98 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 98 transition count 107
Applied a total of 26 rules in 7 ms. Remains 98 /109 variables (removed 11) and now considering 107/122 (removed 15) transitions.
// Phase 1: matrix 107 rows 98 cols
[2024-05-21 15:36:42] [INFO ] Computed 6 invariants in 8 ms
[2024-05-21 15:36:42] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 15:36:42] [INFO ] Invariant cache hit.
[2024-05-21 15:36:42] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-21 15:36:42] [INFO ] Invariant cache hit.
[2024-05-21 15:36:42] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/109 places, 107/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 368 ms. Remains : 98/109 places, 107/122 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(EQ s45 1), p0:(EQ s16 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-10 finished in 591 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)))'
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 122/122 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 99 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 96 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 96 transition count 105
Applied a total of 30 rules in 10 ms. Remains 96 /109 variables (removed 13) and now considering 105/122 (removed 17) transitions.
// Phase 1: matrix 105 rows 96 cols
[2024-05-21 15:36:42] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 15:36:42] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 15:36:42] [INFO ] Invariant cache hit.
[2024-05-21 15:36:42] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-21 15:36:42] [INFO ] Invariant cache hit.
[2024-05-21 15:36:43] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/109 places, 105/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 96/109 places, 105/122 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-11 finished in 403 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&&X(p1)))&&X(p2)))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 122/122 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 111
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 98 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 95 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 95 transition count 104
Applied a total of 32 rules in 6 ms. Remains 95 /109 variables (removed 14) and now considering 104/122 (removed 18) transitions.
// Phase 1: matrix 104 rows 95 cols
[2024-05-21 15:36:43] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 15:36:43] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 15:36:43] [INFO ] Invariant cache hit.
[2024-05-21 15:36:43] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-21 15:36:43] [INFO ] Invariant cache hit.
[2024-05-21 15:36:43] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/109 places, 104/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 95/109 places, 104/122 transitions.
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s92 1), p2:(EQ s87 1), p1:(EQ s88 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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-01b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-12 finished in 635 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) U X((G(p1)||F(G(!p1))))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 122/122 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 111
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 98 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 95 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 95 transition count 104
Applied a total of 32 rules in 6 ms. Remains 95 /109 variables (removed 14) and now considering 104/122 (removed 18) transitions.
[2024-05-21 15:36:43] [INFO ] Invariant cache hit.
[2024-05-21 15:36:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 15:36:43] [INFO ] Invariant cache hit.
[2024-05-21 15:36:43] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-21 15:36:43] [INFO ] Invariant cache hit.
[2024-05-21 15:36:44] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/109 places, 104/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 95/109 places, 104/122 transitions.
Stuttering acceptance computed with spot in 150 ms :[false, false, (AND (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s94 1), p1:(NEQ s23 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 108 ms.
Product exploration explored 100000 steps with 3 reset in 285 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Detected a total of 24/95 stabilizing places and 25/104 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 207 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[false, false, (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :3
Finished Best-First random walk after 754 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=377 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 365 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[false, false, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 122 ms :[false, false, (AND p1 (NOT p0))]
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 104/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 15:36:45] [INFO ] Invariant cache hit.
[2024-05-21 15:36:45] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 15:36:45] [INFO ] Invariant cache hit.
[2024-05-21 15:36:45] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-21 15:36:45] [INFO ] Invariant cache hit.
[2024-05-21 15:36:45] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 95/95 places, 104/104 transitions.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Detected a total of 24/95 stabilizing places and 25/104 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[false, false, (AND p1 (NOT p0))]
Finished random walk after 30 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 435 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[false, false, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 137 ms :[false, false, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[false, false, (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 5 reset in 193 ms.
Product exploration explored 100000 steps with 5 reset in 137 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 129 ms :[false, false, (AND p1 (NOT p0))]
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 104/104 transitions.
Graph (trivial) has 83 edges and 95 vertex of which 4 / 95 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 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 93 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 39 place count 93 transition count 97
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 39 place count 93 transition count 98
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 47 place count 93 transition count 98
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 70 place count 70 transition count 75
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 93 place count 70 transition count 75
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 117 place count 70 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 70 transition count 77
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 137 place count 52 transition count 58
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 18 rules applied. Total rules applied 155 place count 52 transition count 58
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 51 transition count 57
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 51 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 51 transition count 57
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 160 place count 49 transition count 55
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 162 place count 49 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 164 place count 49 transition count 63
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 164 rules in 33 ms. Remains 49 /95 variables (removed 46) and now considering 63/104 (removed 41) transitions.
[2024-05-21 15:36:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 49 cols
[2024-05-21 15:36:47] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 15:36:47] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/95 places, 63/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 49/95 places, 63/104 transitions.
Built C files in :
/tmp/ltsmin5785044094420073845
[2024-05-21 15:36:47] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5785044094420073845
Running compilation step : cd /tmp/ltsmin5785044094420073845;'/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 308 ms.
Running link step : cd /tmp/ltsmin5785044094420073845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5785044094420073845;'/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/stateBased17424796090457075259.hoa' '--buchi-type=spotba'
LTSmin run took 148 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLFireability-13 finished in 4713 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(X(F((p0&&F(G(p1)))))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 122/122 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 99 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 96 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 96 transition count 105
Applied a total of 30 rules in 6 ms. Remains 96 /109 variables (removed 13) and now considering 105/122 (removed 17) transitions.
// Phase 1: matrix 105 rows 96 cols
[2024-05-21 15:36:48] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 15:36:48] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 15:36:48] [INFO ] Invariant cache hit.
[2024-05-21 15:36:48] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-21 15:36:48] [INFO ] Invariant cache hit.
[2024-05-21 15:36:48] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/109 places, 105/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 96/109 places, 105/122 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s25 0), p1:(EQ s86 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 128 ms.
Product exploration explored 100000 steps with 0 reset in 125 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Computed a total of 24 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 p1), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 272 steps, run visited all 1 properties in 12 ms. (steps per millisecond=22 )
Probabilistic random walk after 272 steps, saw 190 distinct states, run finished after 12 ms. (steps per millisecond=22 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 108 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 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Support contains 1 out of 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 105/105 transitions.
Graph (trivial) has 85 edges and 96 vertex of which 4 / 96 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 93 transition count 70
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 43 rules applied. Total rules applied 76 place count 61 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 83 place count 55 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 54 transition count 58
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 84 place count 54 transition count 51
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 98 place count 47 transition count 51
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 46 transition count 50
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 46 transition count 50
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 138 place count 27 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 27 transition count 30
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 142 place count 24 transition count 26
Iterating global reduction 5 with 3 rules applied. Total rules applied 145 place count 24 transition count 26
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 149 place count 22 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 151 place count 20 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 152 place count 19 transition count 22
Applied a total of 152 rules in 20 ms. Remains 19 /96 variables (removed 77) and now considering 22/105 (removed 83) transitions.
// Phase 1: matrix 22 rows 19 cols
[2024-05-21 15:36:49] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 15:36:49] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 15:36:49] [INFO ] Invariant cache hit.
[2024-05-21 15:36:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:36:49] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [12, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 78 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/96 places, 22/105 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 16 transition count 21
Applied a total of 2 rules in 2 ms. Remains 16 /17 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 16 cols
[2024-05-21 15:36:49] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 15:36:49] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 15:36:49] [INFO ] Invariant cache hit.
[2024-05-21 15:36:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:36:50] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/96 places, 21/105 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 174 ms. Remains : 16/96 places, 21/105 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 37 ms :[(NOT p1)]
Finished random walk after 14 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 138 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 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Product exploration explored 100000 steps with 10 reset in 69 ms.
Product exploration explored 100000 steps with 1 reset in 74 ms.
Built C files in :
/tmp/ltsmin15950465398056881926
[2024-05-21 15:36:50] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2024-05-21 15:36:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:36:50] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2024-05-21 15:36:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:36:50] [INFO ] Computing Do-Not-Accords matrix : 21 transitions.
[2024-05-21 15:36:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:36:50] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15950465398056881926
Running compilation step : cd /tmp/ltsmin15950465398056881926;'/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 121 ms.
Running link step : cd /tmp/ltsmin15950465398056881926;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15950465398056881926;'/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/stateBased1444256127938429580.hoa' '--buchi-type=spotba'
LTSmin run took 148 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLFireability-14 finished in 2455 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(p0)||G(p1))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 122/122 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 99 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 96 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 96 transition count 105
Applied a total of 30 rules in 6 ms. Remains 96 /109 variables (removed 13) and now considering 105/122 (removed 17) transitions.
// Phase 1: matrix 105 rows 96 cols
[2024-05-21 15:36:50] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 15:36:51] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 15:36:51] [INFO ] Invariant cache hit.
[2024-05-21 15:36:51] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-21 15:36:51] [INFO ] Invariant cache hit.
[2024-05-21 15:36:51] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/109 places, 105/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 96/109 places, 105/122 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s89 1), p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-01b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-15 finished in 514 ms.
All properties solved by simple procedures.
Total runtime 28685 ms.

BK_STOP 1716305812682

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-01b"
export BK_EXAMINATION="LTLFireability"
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-01b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180200143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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