Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593400596.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is AutonomousCar-PT-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593400596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 114K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678520806762

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 07:46:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 07:46:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:46:49] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-11 07:46:49] [INFO ] Transformed 57 places.
[2023-03-11 07:46:49] [INFO ] Transformed 289 transitions.
[2023-03-11 07:46:49] [INFO ] Found NUPN structural information;
[2023-03-11 07:46:49] [INFO ] Parsed PT model containing 57 places and 289 transitions and 2123 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 113 transitions
Reduce redundant transitions removed 113 transitions.
FORMULA AutonomousCar-PT-05a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 176/176 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 55 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 55 transition count 169
Applied a total of 4 rules in 21 ms. Remains 55 /57 variables (removed 2) and now considering 169/176 (removed 7) transitions.
// Phase 1: matrix 169 rows 55 cols
[2023-03-11 07:46:49] [INFO ] Computed 9 place invariants in 10 ms
[2023-03-11 07:46:50] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-11 07:46:50] [INFO ] Invariant cache hit.
[2023-03-11 07:46:50] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-11 07:46:50] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [51, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 514 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/57 places, 169/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 540 ms. Remains : 53/57 places, 169/176 transitions.
Support contains 30 out of 53 places after structural reductions.
[2023-03-11 07:46:50] [INFO ] Flatten gal took : 63 ms
[2023-03-11 07:46:50] [INFO ] Flatten gal took : 30 ms
[2023-03-11 07:46:50] [INFO ] Input system was already deterministic with 169 transitions.
Incomplete random walk after 10000 steps, including 576 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 24) seen :19
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 169 rows 53 cols
[2023-03-11 07:46:51] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-11 07:46:51] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 07:46:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-11 07:46:51] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-11 07:46:51] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-11 07:46:51] [INFO ] After 84ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-11 07:46:51] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-11 07:46:51] [INFO ] After 446ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 13 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 169/169 transitions.
Graph (complete) has 379 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 52 transition count 161
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 47 transition count 161
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 13 place count 47 transition count 159
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 45 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 43 transition count 147
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 43 transition count 147
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 23 place count 42 transition count 146
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 42 transition count 141
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 58 place count 37 transition count 116
Applied a total of 58 rules in 74 ms. Remains 37 /53 variables (removed 16) and now considering 116/169 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 37/53 places, 116/169 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 116 rows 37 cols
[2023-03-11 07:46:52] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:46:52] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 07:46:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 07:46:52] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 07:46:52] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-11 07:46:52] [INFO ] After 47ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 07:46:52] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-11 07:46:52] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 12 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 116/116 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 36 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 36 transition count 110
Applied a total of 2 rules in 12 ms. Remains 36 /37 variables (removed 1) and now considering 110/116 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 36/37 places, 110/116 transitions.
Incomplete random walk after 10000 steps, including 123 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 110 rows 36 cols
[2023-03-11 07:46:52] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 07:46:52] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:46:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-11 07:46:52] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:46:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-11 07:46:52] [INFO ] After 47ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:46:52] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-11 07:46:52] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 10 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 110/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 35 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 35 transition count 104
Applied a total of 2 rules in 8 ms. Remains 35 /36 variables (removed 1) and now considering 104/110 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 35/36 places, 104/110 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 130 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 128 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Finished probabilistic random walk after 2874 steps, run visited all 2 properties in 21 ms. (steps per millisecond=136 )
Probabilistic random walk after 2874 steps, saw 879 distinct states, run finished after 21 ms. (steps per millisecond=136 ) properties seen :2
FORMULA AutonomousCar-PT-05a-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 10 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 49 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 145
Applied a total of 8 rules in 5 ms. Remains 49 /53 variables (removed 4) and now considering 145/169 (removed 24) transitions.
// Phase 1: matrix 145 rows 49 cols
[2023-03-11 07:46:54] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-11 07:46:54] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-11 07:46:54] [INFO ] Invariant cache hit.
[2023-03-11 07:46:54] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 07:46:54] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-11 07:46:54] [INFO ] Invariant cache hit.
[2023-03-11 07:46:54] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/53 places, 145/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 49/53 places, 145/169 transitions.
Stuttering acceptance computed with spot in 573 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s4 0) (EQ s44 0) (EQ s47 0)), p1:(AND (EQ s12 1) (EQ s18 1) (EQ s26 1) (EQ s30 1) (EQ s38 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-02 finished in 1196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 49 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 145
Applied a total of 8 rules in 5 ms. Remains 49 /53 variables (removed 4) and now considering 145/169 (removed 24) transitions.
[2023-03-11 07:46:55] [INFO ] Invariant cache hit.
[2023-03-11 07:46:55] [INFO ] Implicit Places using invariants in 132 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/53 places, 145/169 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143 ms. Remains : 48/53 places, 145/169 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s13 0) (EQ s17 0) (EQ s25 0) (EQ s29 0) (EQ s37 0) (EQ s44 0))], 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 30 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-04 finished in 375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 53 transition count 164
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 48 transition count 164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 48 transition count 163
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 47 transition count 163
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 43 transition count 139
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 43 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 42 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 41 transition count 138
Applied a total of 24 rules in 40 ms. Remains 41 /53 variables (removed 12) and now considering 138/169 (removed 31) transitions.
// Phase 1: matrix 138 rows 41 cols
[2023-03-11 07:46:55] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 07:46:55] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-11 07:46:55] [INFO ] Invariant cache hit.
[2023-03-11 07:46:55] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-11 07:46:55] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-11 07:46:55] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-11 07:46:55] [INFO ] Invariant cache hit.
[2023-03-11 07:46:56] [INFO ] Dead Transitions using invariants and state equation in 976 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/53 places, 138/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1239 ms. Remains : 41/53 places, 138/169 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-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:(AND (EQ s1 1) (EQ s3 1) (EQ s36 1) (EQ s39 1) (OR (EQ s10 0) (EQ s15 0) (EQ s20 0) (EQ s25 0) (EQ s32 0) (EQ s37 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-05 finished in 1326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 53 transition count 162
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 46 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 46 transition count 161
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 45 transition count 161
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 42 transition count 143
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 42 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 40 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 39 transition count 141
Applied a total of 28 rules in 31 ms. Remains 39 /53 variables (removed 14) and now considering 141/169 (removed 28) transitions.
// Phase 1: matrix 141 rows 39 cols
[2023-03-11 07:46:56] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 07:46:57] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-11 07:46:57] [INFO ] Invariant cache hit.
[2023-03-11 07:46:57] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-11 07:46:57] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2023-03-11 07:46:57] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-11 07:46:57] [INFO ] Invariant cache hit.
[2023-03-11 07:46:57] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/53 places, 141/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 584 ms. Remains : 39/53 places, 141/169 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s24 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 20 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-07 finished in 640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1 U p2)))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 53 transition count 162
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 46 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 46 transition count 161
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 16 place count 45 transition count 161
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 43 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 43 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 41 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 40 transition count 147
Applied a total of 26 rules in 28 ms. Remains 40 /53 variables (removed 13) and now considering 147/169 (removed 22) transitions.
// Phase 1: matrix 147 rows 40 cols
[2023-03-11 07:46:57] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 07:46:57] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-11 07:46:57] [INFO ] Invariant cache hit.
[2023-03-11 07:46:57] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-03-11 07:46:57] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-11 07:46:57] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-11 07:46:57] [INFO ] Invariant cache hit.
[2023-03-11 07:46:57] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/53 places, 147/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 316 ms. Remains : 40/53 places, 147/169 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s30 1) (EQ s1 1) (EQ s7 1) (EQ s21 1) (EQ s36 1)), p0:(AND (EQ s1 1) (EQ s7 1) (EQ s21 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-08 finished in 421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 8 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 53 transition count 164
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 48 transition count 164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 48 transition count 162
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 46 transition count 162
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 42 transition count 138
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 42 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 41 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 40 transition count 137
Applied a total of 26 rules in 22 ms. Remains 40 /53 variables (removed 13) and now considering 137/169 (removed 32) transitions.
// Phase 1: matrix 137 rows 40 cols
[2023-03-11 07:46:57] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-11 07:46:58] [INFO ] Implicit Places using invariants in 76 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/53 places, 137/169 transitions.
Applied a total of 0 rules in 13 ms. Remains 39 /39 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 113 ms. Remains : 39/53 places, 137/169 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s11 0) (EQ s14 0) (EQ s19 0) (EQ s26 0) (EQ s29 0) (EQ s36 0)), p0:(OR (NEQ s9 1) (NEQ s14 1) (NEQ s19 1) (NEQ s24 1) (NEQ s29 1) (NEQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 58 reset in 127 ms.
Product exploration explored 100000 steps with 2 reset in 96 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 307 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 980 steps, including 76 resets, run visited all 2 properties in 28 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 334 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 8 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 137/137 transitions.
Applied a total of 0 rules in 6 ms. Remains 39 /39 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 39 cols
[2023-03-11 07:46:59] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-11 07:46:59] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 07:46:59] [INFO ] Invariant cache hit.
[2023-03-11 07:46:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:46:59] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-11 07:46:59] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 07:46:59] [INFO ] Invariant cache hit.
[2023-03-11 07:46:59] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 369 ms. Remains : 39/39 places, 137/137 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 2407 steps, including 155 resets, run visited all 2 properties in 29 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 253 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 31 reset in 102 ms.
Product exploration explored 100000 steps with 2 reset in 94 ms.
Built C files in :
/tmp/ltsmin5821708514215587283
[2023-03-11 07:47:01] [INFO ] Computing symmetric may disable matrix : 137 transitions.
[2023-03-11 07:47:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:47:01] [INFO ] Computing symmetric may enable matrix : 137 transitions.
[2023-03-11 07:47:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:47:01] [INFO ] Computing Do-Not-Accords matrix : 137 transitions.
[2023-03-11 07:47:01] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:47:01] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5821708514215587283
Running compilation step : cd /tmp/ltsmin5821708514215587283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 467 ms.
Running link step : cd /tmp/ltsmin5821708514215587283;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin5821708514215587283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9047365989865977131.hoa' '--buchi-type=spotba'
LTSmin run took 456 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05a-LTLFireability-09 finished in 4194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(!p1)))))'
Support contains 10 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 151
Applied a total of 6 rules in 2 ms. Remains 50 /53 variables (removed 3) and now considering 151/169 (removed 18) transitions.
// Phase 1: matrix 151 rows 50 cols
[2023-03-11 07:47:02] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-11 07:47:02] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 07:47:02] [INFO ] Invariant cache hit.
[2023-03-11 07:47:02] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-11 07:47:02] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-11 07:47:02] [INFO ] Invariant cache hit.
[2023-03-11 07:47:02] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 151/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 50/53 places, 151/169 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (NEQ s12 1) (NEQ s18 1) (NEQ s24 1) (NEQ s30 1) (NEQ s36 1) (NEQ s46 1)), p0:(AND (EQ s1 1) (EQ s5 1) (EQ s37 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-11 finished in 452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||(G(p3)&&p2))))'
Support contains 14 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 151
Applied a total of 6 rules in 6 ms. Remains 50 /53 variables (removed 3) and now considering 151/169 (removed 18) transitions.
// Phase 1: matrix 151 rows 50 cols
[2023-03-11 07:47:02] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 07:47:02] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-11 07:47:02] [INFO ] Invariant cache hit.
[2023-03-11 07:47:02] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-11 07:47:02] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-11 07:47:02] [INFO ] Invariant cache hit.
[2023-03-11 07:47:03] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 151/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 50/53 places, 151/169 transitions.
Stuttering acceptance computed with spot in 375 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=p3, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p3), acceptance={} source=5 dest: 5}]], initial=1, aps=[p3:(OR (EQ s12 0) (EQ s18 0) (EQ s27 0) (EQ s31 0) (EQ s37 0) (EQ s46 0) (AND (EQ s14 1) (EQ s21 1) (EQ s27 1) (EQ s31 1) (EQ s37 1) (EQ s46 1))), p0:(AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-12 finished in 815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 49 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 145
Applied a total of 8 rules in 5 ms. Remains 49 /53 variables (removed 4) and now considering 145/169 (removed 24) transitions.
// Phase 1: matrix 145 rows 49 cols
[2023-03-11 07:47:03] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 07:47:03] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-11 07:47:03] [INFO ] Invariant cache hit.
[2023-03-11 07:47:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 07:47:03] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-11 07:47:03] [INFO ] Invariant cache hit.
[2023-03-11 07:47:03] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/53 places, 145/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 49/53 places, 145/169 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1 1) (EQ s2 1) (EQ s19 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 468 ms.
Product exploration explored 100000 steps with 33333 reset in 410 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05a-LTLFireability-13 finished in 1621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 151
Applied a total of 6 rules in 3 ms. Remains 50 /53 variables (removed 3) and now considering 151/169 (removed 18) transitions.
// Phase 1: matrix 151 rows 50 cols
[2023-03-11 07:47:05] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 07:47:05] [INFO ] Implicit Places using invariants in 123 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/53 places, 151/169 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143 ms. Remains : 49/53 places, 151/169 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 61 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-14 finished in 288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((F(p2)||p1))))))'
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 169/169 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 53 transition count 164
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 48 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 46 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 46 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 45 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 42 transition count 143
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 42 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 41 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 40 transition count 142
Applied a total of 26 rules in 29 ms. Remains 40 /53 variables (removed 13) and now considering 142/169 (removed 27) transitions.
// Phase 1: matrix 142 rows 40 cols
[2023-03-11 07:47:05] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 07:47:05] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-11 07:47:05] [INFO ] Invariant cache hit.
[2023-03-11 07:47:05] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-11 07:47:05] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-11 07:47:05] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-11 07:47:05] [INFO ] Invariant cache hit.
[2023-03-11 07:47:05] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/53 places, 142/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 40/53 places, 142/169 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s1 1) (EQ s2 1) (EQ s33 1) (EQ s36 1)) (EQ s1 0) (EQ s2 0) (EQ s12 0) (EQ s36 0)), p1:(OR (EQ s1 0) (EQ s5 0) (EQ s22 0) (EQ s36 0)), p2:(...], 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 2 reset in 127 ms.
Product exploration explored 100000 steps with 5 reset in 97 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 478 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 231 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 785 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:47:06] [INFO ] Invariant cache hit.
[2023-03-11 07:47:07] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:47:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-11 07:47:07] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:47:07] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-11 07:47:07] [INFO ] After 29ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:47:07] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-11 07:47:07] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 142/142 transitions.
Graph (complete) has 352 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 39 transition count 139
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 39 transition count 135
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 31 place count 35 transition count 115
Applied a total of 31 rules in 21 ms. Remains 35 /40 variables (removed 5) and now considering 115/142 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 35/40 places, 115/142 transitions.
Finished random walk after 5641 steps, including 127 resets, run visited all 1 properties in 28 ms. (steps per millisecond=201 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 418 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 173 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 142/142 transitions.
Applied a total of 0 rules in 10 ms. Remains 40 /40 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2023-03-11 07:47:08] [INFO ] Invariant cache hit.
[2023-03-11 07:47:08] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-11 07:47:08] [INFO ] Invariant cache hit.
[2023-03-11 07:47:08] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-11 07:47:08] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-11 07:47:08] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-11 07:47:08] [INFO ] Invariant cache hit.
[2023-03-11 07:47:08] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 513 ms. Remains : 40/40 places, 142/142 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 362 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 192 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Finished random walk after 3847 steps, including 284 resets, run visited all 3 properties in 21 ms. (steps per millisecond=183 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 472 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 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5 reset in 122 ms.
Product exploration explored 100000 steps with 65 reset in 144 ms.
Built C files in :
/tmp/ltsmin9032049436895214565
[2023-03-11 07:47:10] [INFO ] Computing symmetric may disable matrix : 142 transitions.
[2023-03-11 07:47:10] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:47:10] [INFO ] Computing symmetric may enable matrix : 142 transitions.
[2023-03-11 07:47:10] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:47:10] [INFO ] Computing Do-Not-Accords matrix : 142 transitions.
[2023-03-11 07:47:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:47:10] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9032049436895214565
Running compilation step : cd /tmp/ltsmin9032049436895214565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 393 ms.
Running link step : cd /tmp/ltsmin9032049436895214565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin9032049436895214565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6752436357758227085.hoa' '--buchi-type=spotba'
LTSmin run took 439 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05a-LTLFireability-15 finished in 6342 ms.
All properties solved by simple procedures.
Total runtime 22288 ms.

BK_STOP 1678520832592

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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