Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.2K Jun 7 15:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 7 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 3 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Jun 7 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 49K Jun 3 16:02 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654898258594

Running Version 202205111006
[2022-06-10 21:57:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 21:57:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 21:57:41] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2022-06-10 21:57:41] [INFO ] Transformed 155 places.
[2022-06-10 21:57:41] [INFO ] Transformed 194 transitions.
[2022-06-10 21:57:41] [INFO ] Found NUPN structural information;
[2022-06-10 21:57:41] [INFO ] Parsed PT model containing 155 places and 194 transitions in 473 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-02b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 135 transition count 174
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 135 transition count 174
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 56 place count 135 transition count 158
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 131 transition count 154
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 131 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 130 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 130 transition count 153
Applied a total of 66 rules in 73 ms. Remains 130 /155 variables (removed 25) and now considering 153/194 (removed 41) transitions.
// Phase 1: matrix 153 rows 130 cols
[2022-06-10 21:57:41] [INFO ] Computed 7 place invariants in 13 ms
[2022-06-10 21:57:42] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 153 rows 130 cols
[2022-06-10 21:57:42] [INFO ] Computed 7 place invariants in 6 ms
[2022-06-10 21:57:42] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
// Phase 1: matrix 153 rows 130 cols
[2022-06-10 21:57:42] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-10 21:57:42] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/155 places, 153/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/155 places, 153/194 transitions.
Support contains 17 out of 130 places after structural reductions.
[2022-06-10 21:57:42] [INFO ] Flatten gal took : 69 ms
[2022-06-10 21:57:42] [INFO ] Flatten gal took : 29 ms
[2022-06-10 21:57:42] [INFO ] Input system was already deterministic with 153 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1161 ms. (steps per millisecond=8 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Finished Best-First random walk after 3973 steps, including 2 resets, run visited all 6 properties in 132 ms. (steps per millisecond=30 )
FORMULA AutonomousCar-PT-02b-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 32 stabilizing places and 33 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((p0 U p1)||X((G(F(p2))&&p3))))))'
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 153/153 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 148
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 148
Applied a total of 10 rules in 15 ms. Remains 125 /130 variables (removed 5) and now considering 148/153 (removed 5) transitions.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:57:45] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:57:45] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:57:45] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:57:45] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:57:45] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 21:57:45] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 148/153 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/130 places, 148/153 transitions.
Stuttering acceptance computed with spot in 648 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=p3, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=9 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(OR (EQ s115 0) (EQ s18 1)), p0:(OR (EQ s76 0) (EQ s80 1)), p3:(OR (EQ s115 0) (EQ s68 1)), p2:(AND (EQ s18 0) (EQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 345 ms.
Product exploration explored 100000 steps with 14 reset in 179 ms.
Computed a total of 29 stabilizing places and 30 stable transitions
Computed a total of 29 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p1 p0 p3 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1407 ms. Reduced automaton from 10 states, 25 edges and 4 AP to 10 states, 25 edges and 4 AP.
Stuttering acceptance computed with spot in 510 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:57:49] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-10 21:57:49] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-10 21:57:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-06-10 21:57:49] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :1
[2022-06-10 21:57:49] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 5 ms to minimize.
[2022-06-10 21:57:49] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2022-06-10 21:57:49] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2022-06-10 21:57:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 290 ms
[2022-06-10 21:57:49] [INFO ] After 386ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-10 21:57:49] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :1
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 125 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 148/148 transitions.
Graph (trivial) has 107 edges and 125 vertex of which 4 / 125 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 264 edges and 123 vertex of which 121 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 121 transition count 106
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 51 rules applied. Total rules applied 91 place count 85 transition count 91
Reduce places removed 8 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 13 rules applied. Total rules applied 104 place count 77 transition count 86
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 109 place count 72 transition count 86
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 109 place count 72 transition count 77
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 127 place count 63 transition count 77
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 177 place count 38 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 178 place count 38 transition count 51
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 183 place count 33 transition count 40
Iterating global reduction 5 with 5 rules applied. Total rules applied 188 place count 33 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 190 place count 33 transition count 38
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 192 place count 32 transition count 37
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 194 place count 31 transition count 38
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 195 place count 31 transition count 37
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 196 place count 31 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 197 place count 30 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 198 place count 30 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 199 place count 29 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 200 place count 28 transition count 35
Applied a total of 200 rules in 43 ms. Remains 28 /125 variables (removed 97) and now considering 35/148 (removed 113) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/125 places, 35/148 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Found 9 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p3 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (G (NOT (AND p0 (NOT p1) p3 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p3))), (G (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p3)), (F (AND p0 (NOT p1) (NOT p3))), (F (NOT (AND p3 (NOT p2)))), (F (NOT p3)), (F (AND p0 (NOT p1))), (F p2)]
Knowledge based reduction with 23 factoid took 1538 ms. Reduced automaton from 10 states, 25 edges and 4 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1)]
Support contains 3 out of 125 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:57:52] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:57:52] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:57:52] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:57:52] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:57:52] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:57:52] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 148/148 transitions.
Computed a total of 29 stabilizing places and 30 stable transitions
Computed a total of 29 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p3), (X p1), (X (X p1)), true, (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1)]
Finished random walk after 6901 steps, including 5 resets, run visited all 2 properties in 93 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND p1 (NOT p2) p3), (X p1), (X (X p1)), true, (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p2 (NOT p3)))]
Knowledge based reduction with 5 factoid took 246 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1)]
Product exploration explored 100000 steps with 12 reset in 112 ms.
Product exploration explored 100000 steps with 0 reset in 395 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p1)]
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 148/148 transitions.
Graph (trivial) has 111 edges and 125 vertex of which 4 / 125 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 123 transition count 146
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 51 place count 123 transition count 139
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 51 place count 123 transition count 139
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 60 place count 123 transition count 139
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 93 place count 90 transition count 106
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 126 place count 90 transition count 106
Performed 34 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 160 place count 90 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 90 transition count 109
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 190 place count 62 transition count 75
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 3 with 28 rules applied. Total rules applied 218 place count 62 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 222 place count 62 transition count 71
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 225 place count 59 transition count 68
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 228 place count 59 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 230 place count 59 transition count 69
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 232 place count 57 transition count 67
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 234 place count 57 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 57 transition count 71
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 235 rules in 55 ms. Remains 57 /125 variables (removed 68) and now considering 71/148 (removed 77) transitions.
[2022-06-10 21:57:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 71 rows 57 cols
[2022-06-10 21:57:54] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:57:54] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/125 places, 71/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/125 places, 71/148 transitions.
Product exploration explored 100000 steps with 1 reset in 87 ms.
Product exploration explored 100000 steps with 1 reset in 78 ms.
Built C files in :
/tmp/ltsmin14954502029267844710
[2022-06-10 21:57:54] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14954502029267844710
Running compilation step : cd /tmp/ltsmin14954502029267844710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 496 ms.
Running link step : cd /tmp/ltsmin14954502029267844710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14954502029267844710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased133779218365926262.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:09] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:09] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:10] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:10] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:10] [INFO ] Computed 7 place invariants in 7 ms
[2022-06-10 21:58:10] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 148/148 transitions.
Built C files in :
/tmp/ltsmin1897085853529696951
[2022-06-10 21:58:10] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1897085853529696951
Running compilation step : cd /tmp/ltsmin1897085853529696951;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 383 ms.
Running link step : cd /tmp/ltsmin1897085853529696951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1897085853529696951;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1583510376382751262.hoa' '--buchi-type=spotba'
LTSmin run took 11994 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLCardinality-00 finished in 37621 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((F(p1)||p0))) U G(X(p2))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 153/153 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 150
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 150
Applied a total of 6 rules in 4 ms. Remains 127 /130 variables (removed 3) and now considering 150/153 (removed 3) transitions.
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:58:22] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:22] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:58:22] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:22] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:58:22] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 21:58:23] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/130 places, 150/153 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/130 places, 150/153 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s125 0) (EQ s23 1)), p0:(OR (EQ s112 0) (EQ s20 1)), p1:(OR (EQ s112 0) (EQ s20 1))], 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 8 reset in 142 ms.
Product exploration explored 100000 steps with 21 reset in 187 ms.
Computed a total of 30 stabilizing places and 31 stable transitions
Computed a total of 30 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 594 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :2
Running SMT prover for 3 properties.
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:58:25] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:25] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-06-10 21:58:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-06-10 21:58:25] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 13 factoid took 627 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 150/150 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 150/150 (removed 0) transitions.
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:58:26] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:26] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:58:26] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:26] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:58:26] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:26] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 150/150 transitions.
Computed a total of 30 stabilizing places and 31 stable transitions
Computed a total of 30 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 224 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:58:27] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:27] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:58:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2022-06-10 21:58:27] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 21:58:27] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 3 ms to minimize.
[2022-06-10 21:58:27] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-06-10 21:58:27] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2022-06-10 21:58:28] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2022-06-10 21:58:28] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-06-10 21:58:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 480 ms
[2022-06-10 21:58:28] [INFO ] After 587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-10 21:58:28] [INFO ] After 672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 150/150 transitions.
Graph (trivial) has 111 edges and 127 vertex of which 4 / 127 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 266 edges and 125 vertex of which 123 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 123 transition count 100
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 60 rules applied. Total rules applied 108 place count 79 transition count 84
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 118 place count 70 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 69 transition count 83
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 119 place count 69 transition count 75
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 135 place count 61 transition count 75
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 183 place count 37 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 184 place count 37 transition count 50
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 188 place count 33 transition count 40
Iterating global reduction 5 with 4 rules applied. Total rules applied 192 place count 33 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 193 place count 33 transition count 39
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 195 place count 32 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
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 199 place count 30 transition count 47
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 204 place count 30 transition count 42
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 205 place count 30 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 206 place count 29 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 207 place count 28 transition count 41
Applied a total of 207 rules in 30 ms. Remains 28 /127 variables (removed 99) and now considering 41/150 (removed 109) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/127 places, 41/150 transitions.
Finished random walk after 80 steps, including 5 resets, run visited all 1 properties in 1 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 372 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 106 ms.
Product exploration explored 100000 steps with 31 reset in 91 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 150/150 transitions.
Graph (trivial) has 111 edges and 127 vertex of which 4 / 127 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 125 transition count 148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 125 transition count 142
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 51 place count 125 transition count 143
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 60 place count 125 transition count 143
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 93 place count 92 transition count 110
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 126 place count 92 transition count 110
Performed 32 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 158 place count 92 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 160 place count 92 transition count 113
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 185 place count 67 transition count 82
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 25 rules applied. Total rules applied 210 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 212 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 213 place count 66 transition count 79
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 66 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 215 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 217 place count 64 transition count 77
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 64 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 222 place count 64 transition count 96
Deduced a syphon composed of 33 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 228 place count 64 transition count 90
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 229 place count 63 transition count 89
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 230 place count 63 transition count 89
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 230 rules in 41 ms. Remains 63 /127 variables (removed 64) and now considering 89/150 (removed 61) transitions.
[2022-06-10 21:58:29] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 89 rows 63 cols
[2022-06-10 21:58:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:58:29] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/127 places, 89/150 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/127 places, 89/150 transitions.
Product exploration explored 100000 steps with 6 reset in 210 ms.
Product exploration explored 100000 steps with 0 reset in 193 ms.
Built C files in :
/tmp/ltsmin16712877115612208922
[2022-06-10 21:58:30] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16712877115612208922
Running compilation step : cd /tmp/ltsmin16712877115612208922;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 544 ms.
Running link step : cd /tmp/ltsmin16712877115612208922;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin16712877115612208922;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1080589734891235302.hoa' '--buchi-type=spotba'
LTSmin run took 537 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLCardinality-06 finished in 8593 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(F(p0))))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 153/153 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 148
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 148
Applied a total of 10 rules in 6 ms. Remains 125 /130 variables (removed 5) and now considering 148/153 (removed 5) transitions.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:31] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 21:58:31] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:31] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 21:58:31] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 125 cols
[2022-06-10 21:58:31] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-10 21:58:31] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 148/153 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/130 places, 148/153 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-10 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:(OR (EQ s8 0) (EQ s122 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 295 ms.
Product exploration explored 100000 steps with 33333 reset in 262 ms.
Computed a total of 29 stabilizing places and 30 stable transitions
Computed a total of 29 stabilizing places and 30 stable transitions
Knowledge obtained : [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 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-02b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02b-LTLCardinality-10 finished in 1260 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((!p0 U p0))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 153/153 transitions.
Graph (trivial) has 119 edges and 130 vertex of which 4 / 130 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 127 transition count 102
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 65 rules applied. Total rules applied 114 place count 79 transition count 85
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 125 place count 69 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 68 transition count 84
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 126 place count 68 transition count 76
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 142 place count 60 transition count 76
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 145 place count 57 transition count 73
Iterating global reduction 4 with 3 rules applied. Total rules applied 148 place count 57 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 56 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 56 transition count 72
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 196 place count 33 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 33 transition count 47
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 201 place count 29 transition count 37
Iterating global reduction 5 with 4 rules applied. Total rules applied 205 place count 29 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 207 place count 29 transition count 35
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 209 place count 28 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 213 place count 26 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 24 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 216 place count 23 transition count 38
Applied a total of 216 rules in 33 ms. Remains 23 /130 variables (removed 107) and now considering 38/153 (removed 115) transitions.
// Phase 1: matrix 38 rows 23 cols
[2022-06-10 21:58:32] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 21:58:32] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 38 rows 23 cols
[2022-06-10 21:58:32] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 21:58:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-10 21:58:32] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 127 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/130 places, 38/153 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/130 places, 38/153 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7 reset in 55 ms.
Product exploration explored 100000 steps with 3 reset in 60 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 22 cols
[2022-06-10 21:58:33] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:58:33] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 38 rows 22 cols
[2022-06-10 21:58:33] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:58:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-10 21:58:33] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2022-06-10 21:58:33] [INFO ] Redundant transitions in 16 ms returned [14]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 37 rows 22 cols
[2022-06-10 21:58:33] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 21:58:33] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/22 places, 37/38 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 36/37 (removed 1) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 36/38 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 48 ms.
Product exploration explored 100000 steps with 2 reset in 58 ms.
Built C files in :
/tmp/ltsmin12631948128852332697
[2022-06-10 21:58:34] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2022-06-10 21:58:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:58:34] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2022-06-10 21:58:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:58:34] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2022-06-10 21:58:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:58:34] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12631948128852332697
Running compilation step : cd /tmp/ltsmin12631948128852332697;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 151 ms.
Running link step : cd /tmp/ltsmin12631948128852332697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin12631948128852332697;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14876031189424747525.hoa' '--buchi-type=spotba'
LTSmin run took 63 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLCardinality-14 finished in 2293 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 153/153 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 150
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 150
Applied a total of 6 rules in 3 ms. Remains 127 /130 variables (removed 3) and now considering 150/153 (removed 3) transitions.
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:58:34] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:34] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:58:34] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:35] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 150 rows 127 cols
[2022-06-10 21:58:35] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 21:58:35] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/130 places, 150/153 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/130 places, 150/153 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s22 0) (EQ s112 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]]
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Computed a total of 30 stabilizing places and 31 stable transitions
Computed a total of 30 stabilizing places and 31 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-02b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02b-LTLCardinality-15 finished in 749 ms.
All properties solved by simple procedures.
Total runtime 54929 ms.

BK_STOP 1654898315765

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-02b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872900435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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