Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 12 22:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 26K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716274997095

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-01b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 07:03:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 07:03:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:03:20] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-21 07:03:20] [INFO ] Transformed 114 places.
[2024-05-21 07:03:21] [INFO ] Transformed 112 transitions.
[2024-05-21 07:03:21] [INFO ] Found NUPN structural information;
[2024-05-21 07:03:21] [INFO ] Parsed PT model containing 114 places and 112 transitions and 264 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA AutoFlight-PT-01b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 105 transition count 103
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 105 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 105 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 103 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 103 transition count 100
Applied a total of 23 rules in 36 ms. Remains 103 /114 variables (removed 11) and now considering 100/112 (removed 12) transitions.
// Phase 1: matrix 100 rows 103 cols
[2024-05-21 07:03:21] [INFO ] Computed 10 invariants in 8 ms
[2024-05-21 07:03:21] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-21 07:03:21] [INFO ] Invariant cache hit.
[2024-05-21 07:03:21] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-21 07:03:21] [INFO ] Invariant cache hit.
[2024-05-21 07:03:21] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/114 places, 100/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 772 ms. Remains : 103/114 places, 100/112 transitions.
Support contains 29 out of 103 places after structural reductions.
[2024-05-21 07:03:22] [INFO ] Flatten gal took : 44 ms
[2024-05-21 07:03:22] [INFO ] Flatten gal took : 16 ms
[2024-05-21 07:03:22] [INFO ] Input system was already deterministic with 100 transitions.
Support contains 28 out of 103 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 24) seen :18
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-21 07:03:23] [INFO ] Invariant cache hit.
[2024-05-21 07:03:23] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-21 07:03:23] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 07:03:23] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 07:03:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 07:03:23] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:03:23] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 07:03:23] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 12 ms to minimize.
[2024-05-21 07:03:23] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-05-21 07:03:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2024-05-21 07:03:24] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 07:03:24] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 07:03:24] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-21 07:03:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 208 ms
[2024-05-21 07:03:24] [INFO ] After 740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-21 07:03:24] [INFO ] After 906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 2 properties in 17 ms.
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 100/100 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 103 transition count 70
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 64 place count 73 transition count 66
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 71 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 70 transition count 65
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 68 place count 70 transition count 49
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 100 place count 54 transition count 49
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 103 place count 51 transition count 46
Iterating global reduction 4 with 3 rules applied. Total rules applied 106 place count 51 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 106 place count 51 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 50 transition count 45
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 138 place count 35 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 35 transition count 28
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 142 place count 35 transition count 25
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 145 place count 32 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 146 place count 31 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 147 place count 30 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 147 place count 30 transition count 23
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 149 place count 29 transition count 23
Applied a total of 149 rules in 39 ms. Remains 29 /103 variables (removed 74) and now considering 23/100 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 29/103 places, 23/100 transitions.
Incomplete random walk after 10000 steps, including 325 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 23 rows 29 cols
[2024-05-21 07:03:24] [INFO ] Computed 9 invariants in 5 ms
[2024-05-21 07:03:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 07:03:24] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 07:03:24] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 07:03:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 07:03:24] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 07:03:24] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 07:03:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 07:03:24] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 07:03:24] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 07:03:24] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 07:03:24] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-21 07:03:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-21 07:03:24] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-21 07:03:24] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 23/23 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 29 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 28 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 27 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 27 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 26 transition count 20
Applied a total of 6 rules in 7 ms. Remains 26 /29 variables (removed 3) and now considering 20/23 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 26/29 places, 20/23 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Probably explored full state space saw : 79 states, properties seen :0
Probabilistic random walk after 208 steps, saw 79 distinct states, run finished after 17 ms. (steps per millisecond=12 ) properties seen :0
Explored full state space saw : 79 states, properties seen :0
Exhaustive walk after 208 steps, saw 79 distinct states, run finished after 2 ms. (steps per millisecond=104 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA AutoFlight-PT-01b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32 stabilizing places and 32 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G((p1||F((G(p2)||(p2&&F(!p3))))))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 96 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 93 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 93 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 92 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 92 transition count 88
Applied a total of 23 rules in 51 ms. Remains 92 /103 variables (removed 11) and now considering 88/100 (removed 12) transitions.
// Phase 1: matrix 88 rows 92 cols
[2024-05-21 07:03:25] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 07:03:25] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 07:03:25] [INFO ] Invariant cache hit.
[2024-05-21 07:03:25] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-21 07:03:25] [INFO ] Invariant cache hit.
[2024-05-21 07:03:25] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/103 places, 88/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 92/103 places, 88/100 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 811 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) p3), (NOT p2), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2 p3 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND p1 p3 (NOT p0)) (AND (NOT p2) p3 (NOT p0))), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p3), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s21 0), p2:(NEQ s11 1), p3:(AND (EQ s12 1) (EQ s76 1)), p0:(EQ s45 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 524 ms.
Product exploration explored 100000 steps with 50000 reset in 390 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/92 stabilizing places and 24/88 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p3) p0), (X (NOT (OR (AND p1 p3 (NOT p0)) (AND (NOT p2) p3 (NOT p0))))), (X (NOT (AND p1 p2 p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p3 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 48 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-01b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-01b-LTLFireability-00 finished in 2310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1||F(p2)||X(F((p1&&F(p3)))))&&p0)))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 98 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 96 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 96 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 95 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 95 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 94 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 94 transition count 90
Applied a total of 19 rules in 37 ms. Remains 94 /103 variables (removed 9) and now considering 90/100 (removed 10) transitions.
// Phase 1: matrix 90 rows 94 cols
[2024-05-21 07:03:27] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 07:03:27] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 07:03:27] [INFO ] Invariant cache hit.
[2024-05-21 07:03:27] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-21 07:03:27] [INFO ] Invariant cache hit.
[2024-05-21 07:03:27] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/103 places, 90/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 94/103 places, 90/100 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(AND (EQ s30 1) (EQ s68 1) (EQ s48 1)), p1:(EQ s6 1), p2:(EQ s15 1), p3:(EQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-03 finished in 696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 102 transition count 68
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 66 place count 71 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 69 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 68 place count 69 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 100 place count 53 transition count 48
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 50 transition count 45
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 50 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 106 place count 50 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 49 transition count 44
Performed 18 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 144 place count 31 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 30 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 29 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 146 place count 29 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 28 transition count 22
Applied a total of 148 rules in 27 ms. Remains 28 /103 variables (removed 75) and now considering 22/100 (removed 78) transitions.
// Phase 1: matrix 22 rows 28 cols
[2024-05-21 07:03:28] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 07:03:28] [INFO ] Implicit Places using invariants in 56 ms returned [11, 16, 21, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 60 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/103 places, 22/100 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 22 transition count 20
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 21 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 20 transition count 18
Applied a total of 8 rules in 6 ms. Remains 20 /24 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 07:03:28] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 07:03:28] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 07:03:28] [INFO ] Invariant cache hit.
[2024-05-21 07:03:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 07:03:28] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/103 places, 18/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 20/103 places, 18/100 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-04 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:(EQ s4 0)], 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 12234 reset in 397 ms.
Product exploration explored 100000 steps with 12235 reset in 267 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 07:03:29] [INFO ] Invariant cache hit.
[2024-05-21 07:03:29] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 07:03:29] [INFO ] Invariant cache hit.
[2024-05-21 07:03:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 07:03:29] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-21 07:03:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 07:03:29] [INFO ] Invariant cache hit.
[2024-05-21 07:03:29] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Finished random walk after 29 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12233 reset in 137 ms.
Product exploration explored 100000 steps with 12220 reset in 302 ms.
Built C files in :
/tmp/ltsmin5557085170997080027
[2024-05-21 07:03:30] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-21 07:03:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:03:30] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-21 07:03:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:03:30] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-21 07:03:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:03:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5557085170997080027
Running compilation step : cd /tmp/ltsmin5557085170997080027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 374 ms.
Running link step : cd /tmp/ltsmin5557085170997080027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin5557085170997080027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3363858561444478228.hoa' '--buchi-type=spotba'
LTSmin run took 110 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-01b-LTLFireability-04 finished in 3484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(p1))))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 96 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 93 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 93 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 92 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 92 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 91 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 91 transition count 87
Applied a total of 25 rules in 17 ms. Remains 91 /103 variables (removed 12) and now considering 87/100 (removed 13) transitions.
// Phase 1: matrix 87 rows 91 cols
[2024-05-21 07:03:31] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 07:03:31] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 07:03:31] [INFO ] Invariant cache hit.
[2024-05-21 07:03:31] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-21 07:03:31] [INFO ] Invariant cache hit.
[2024-05-21 07:03:31] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/103 places, 87/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 368 ms. Remains : 91/103 places, 87/100 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s56 0) (EQ s87 0)), p1:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2727 reset in 126 ms.
Product exploration explored 100000 steps with 2710 reset in 118 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 472 steps, including 7 resets, run visited all 3 properties in 7 ms. (steps per millisecond=67 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 225 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
[2024-05-21 07:03:33] [INFO ] Invariant cache hit.
[2024-05-21 07:03:33] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 07:03:33] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:03:33] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-21 07:03:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:03:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 07:03:33] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 07:03:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:03:33] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-21 07:03:33] [INFO ] Computed and/alt/rep : 86/125/86 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-21 07:03:33] [INFO ] Added : 86 causal constraints over 18 iterations in 291 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-21 07:03:33] [INFO ] Invariant cache hit.
[2024-05-21 07:03:34] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 07:03:34] [INFO ] Invariant cache hit.
[2024-05-21 07:03:34] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-21 07:03:34] [INFO ] Invariant cache hit.
[2024-05-21 07:03:34] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 91/91 places, 87/87 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 32 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
[2024-05-21 07:03:35] [INFO ] Invariant cache hit.
[2024-05-21 07:03:35] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-21 07:03:35] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 07:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:03:35] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-05-21 07:03:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:03:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 07:03:36] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:03:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:03:36] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-21 07:03:36] [INFO ] Computed and/alt/rep : 86/125/86 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-21 07:03:36] [INFO ] Added : 86 causal constraints over 18 iterations in 230 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 2710 reset in 182 ms.
Product exploration explored 100000 steps with 2732 reset in 196 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 87/87 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 91 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 91 transition count 86
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 26 place count 91 transition count 86
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 40 place count 91 transition count 86
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 59 place count 72 transition count 67
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 78 place count 72 transition count 67
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 97 place count 72 transition count 65
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 107 place count 62 transition count 55
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 117 place count 62 transition count 55
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 117 rules in 33 ms. Remains 62 /91 variables (removed 29) and now considering 55/87 (removed 32) transitions.
[2024-05-21 07:03:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 62 cols
[2024-05-21 07:03:37] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 07:03:37] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/91 places, 55/87 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 62/91 places, 55/87 transitions.
Built C files in :
/tmp/ltsmin12566874825578407710
[2024-05-21 07:03:37] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12566874825578407710
Running compilation step : cd /tmp/ltsmin12566874825578407710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 361 ms.
Running link step : cd /tmp/ltsmin12566874825578407710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12566874825578407710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3729476332633069436.hoa' '--buchi-type=spotba'
LTSmin run took 3285 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-01b-LTLFireability-07 finished in 9840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 102 transition count 69
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 64 place count 72 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 70 transition count 65
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 66 place count 70 transition count 49
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 98 place count 54 transition count 49
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 50 transition count 45
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 50 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 106 place count 50 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 48 transition count 43
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 144 place count 31 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 31 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 146 place count 30 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 147 place count 29 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 147 place count 29 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 149 place count 28 transition count 22
Applied a total of 149 rules in 15 ms. Remains 28 /103 variables (removed 75) and now considering 22/100 (removed 78) transitions.
// Phase 1: matrix 22 rows 28 cols
[2024-05-21 07:03:41] [INFO ] Computed 9 invariants in 0 ms
[2024-05-21 07:03:41] [INFO ] Implicit Places using invariants in 48 ms returned [11, 16, 21, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/103 places, 22/100 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 22 transition count 20
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 21 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 20 transition count 18
Applied a total of 8 rules in 3 ms. Remains 20 /24 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 07:03:41] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 07:03:41] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 07:03:41] [INFO ] Invariant cache hit.
[2024-05-21 07:03:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/103 places, 18/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 134 ms. Remains : 20/103 places, 18/100 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s4 1), p0:(EQ s8 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-09 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 95
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 95 transition count 92
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 95 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 94 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 94 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 93 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 93 transition count 90
Applied a total of 20 rules in 11 ms. Remains 93 /103 variables (removed 10) and now considering 90/100 (removed 10) transitions.
// Phase 1: matrix 90 rows 93 cols
[2024-05-21 07:03:41] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 07:03:41] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 07:03:41] [INFO ] Invariant cache hit.
[2024-05-21 07:03:41] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-21 07:03:41] [INFO ] Invariant cache hit.
[2024-05-21 07:03:41] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/103 places, 90/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 93/103 places, 90/100 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s16 1), p0:(OR (EQ s68 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-12 finished in 426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(p0)||(p1&&F(p0))) U p2))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 102 transition count 71
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 60 place count 74 transition count 67
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 72 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 71 transition count 66
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 64 place count 71 transition count 49
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 98 place count 54 transition count 49
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 52 transition count 47
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 52 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 102 place count 52 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 51 transition count 46
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 138 place count 34 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 33 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 32 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 140 place count 32 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 31 transition count 25
Applied a total of 142 rules in 19 ms. Remains 31 /103 variables (removed 72) and now considering 25/100 (removed 75) transitions.
// Phase 1: matrix 25 rows 31 cols
[2024-05-21 07:03:42] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 07:03:42] [INFO ] Implicit Places using invariants in 44 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/103 places, 25/100 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 22
Applied a total of 6 rules in 2 ms. Remains 27 /30 variables (removed 3) and now considering 22/25 (removed 3) transitions.
// Phase 1: matrix 22 rows 27 cols
[2024-05-21 07:03:42] [INFO ] Computed 8 invariants in 0 ms
[2024-05-21 07:03:42] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 07:03:42] [INFO ] Invariant cache hit.
[2024-05-21 07:03:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 07:03:42] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/103 places, 22/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 174 ms. Remains : 27/103 places, 22/100 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=0 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=2 dest: 3}], [{ cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s13 1) (EQ s9 1)), p0:(EQ s9 1), p1:(NEQ s6 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 32 steps with 6 reset in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-13 finished in 427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(p1) U ((p2&&X(p1))||X(G(p1))))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 97 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 95 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 95 transition count 91
Applied a total of 17 rules in 5 ms. Remains 95 /103 variables (removed 8) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 95 cols
[2024-05-21 07:03:42] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 07:03:42] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 07:03:42] [INFO ] Invariant cache hit.
[2024-05-21 07:03:42] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-21 07:03:42] [INFO ] Invariant cache hit.
[2024-05-21 07:03:42] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/103 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 95/103 places, 91/100 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s50 1), p2:(NEQ s31 1), p1:(NEQ s85 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 12054 reset in 142 ms.
Product exploration explored 100000 steps with 12103 reset in 122 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Computed a total of 27 stabilizing places and 27 stable transitions
Detected a total of 27/95 stabilizing places and 27/91 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 1105 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 13 factoid took 1590 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-21 07:03:46] [INFO ] Invariant cache hit.
[2024-05-21 07:03:46] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 07:03:46] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 07:03:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:03:46] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-21 07:03:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:03:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 07:03:46] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:03:46] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-21 07:03:46] [INFO ] Computed and/alt/rep : 90/129/90 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-21 07:03:46] [INFO ] Added : 83 causal constraints over 17 iterations in 271 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 95 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 94 transition count 66
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 70 transition count 63
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 68 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 67 transition count 62
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 55 place count 67 transition count 45
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 89 place count 50 transition count 45
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 121 place count 34 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 33 transition count 26
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 125 place count 31 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 126 place count 30 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 126 place count 30 transition count 24
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 128 place count 29 transition count 24
Applied a total of 128 rules in 19 ms. Remains 29 /95 variables (removed 66) and now considering 24/91 (removed 67) transitions.
// Phase 1: matrix 24 rows 29 cols
[2024-05-21 07:03:46] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 07:03:46] [INFO ] Implicit Places using invariants in 50 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/95 places, 24/91 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 25 transition count 21
Applied a total of 6 rules in 2 ms. Remains 25 /28 variables (removed 3) and now considering 21/24 (removed 3) transitions.
// Phase 1: matrix 21 rows 25 cols
[2024-05-21 07:03:46] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 07:03:46] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 07:03:46] [INFO ] Invariant cache hit.
[2024-05-21 07:03:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 07:03:47] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/95 places, 21/91 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 25/95 places, 21/91 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/25 stabilizing places and 6/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-21 07:03:47] [INFO ] Invariant cache hit.
[2024-05-21 07:03:47] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 07:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:03:47] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-21 07:03:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:03:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 07:03:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:03:47] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-21 07:03:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 07:03:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 07:03:47] [INFO ] Computed and/alt/rep : 16/33/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 07:03:47] [INFO ] Added : 15 causal constraints over 4 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20738 reset in 94 ms.
Stack based approach found an accepted trace after 1303 steps with 276 reset with depth 8 and stack size 8 in 3 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-14 finished in 5434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 102 transition count 69
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 72 transition count 68
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 61 place count 72 transition count 51
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 95 place count 55 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 50 transition count 46
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 50 transition count 46
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 105 place count 50 transition count 43
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 111 place count 47 transition count 43
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 145 place count 30 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 29 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 147 place count 28 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 147 place count 28 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 27 transition count 22
Applied a total of 149 rules in 12 ms. Remains 27 /103 variables (removed 76) and now considering 22/100 (removed 78) transitions.
// Phase 1: matrix 22 rows 27 cols
[2024-05-21 07:03:47] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 07:03:47] [INFO ] Implicit Places using invariants in 40 ms returned [10, 15, 20, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 41 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/103 places, 22/100 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 21 transition count 20
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 21 transition count 20
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 20 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 20 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 19 transition count 18
Applied a total of 8 rules in 2 ms. Remains 19 /23 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-21 07:03:47] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 07:03:47] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 07:03:47] [INFO ] Invariant cache hit.
[2024-05-21 07:03:47] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/103 places, 18/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127 ms. Remains : 19/103 places, 18/100 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-15 finished in 180 ms.
All properties solved by simple procedures.
Total runtime 27411 ms.

BK_STOP 1716275029168

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AutoFlight-PT-01b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180000043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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