Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.7K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678512886166

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-03b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 05:34:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 05:34:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:34:48] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-11 05:34:48] [INFO ] Transformed 298 places.
[2023-03-11 05:34:48] [INFO ] Transformed 296 transitions.
[2023-03-11 05:34:48] [INFO ] Found NUPN structural information;
[2023-03-11 05:34:48] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutoFlight-PT-03b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 264 transition count 262
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 264 transition count 262
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 73 place count 264 transition count 257
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 84 place count 253 transition count 246
Iterating global reduction 1 with 11 rules applied. Total rules applied 95 place count 253 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 252 transition count 245
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 252 transition count 245
Applied a total of 97 rules in 55 ms. Remains 252 /298 variables (removed 46) and now considering 245/296 (removed 51) transitions.
// Phase 1: matrix 245 rows 252 cols
[2023-03-11 05:34:48] [INFO ] Computed 22 place invariants in 11 ms
[2023-03-11 05:34:49] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-11 05:34:49] [INFO ] Invariant cache hit.
[2023-03-11 05:34:49] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2023-03-11 05:34:49] [INFO ] Invariant cache hit.
[2023-03-11 05:34:49] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/298 places, 245/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 754 ms. Remains : 252/298 places, 245/296 transitions.
Support contains 33 out of 252 places after structural reductions.
[2023-03-11 05:34:49] [INFO ] Flatten gal took : 65 ms
[2023-03-11 05:34:49] [INFO ] Flatten gal took : 18 ms
[2023-03-11 05:34:49] [INFO ] Input system was already deterministic with 245 transitions.
Support contains 30 out of 252 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 28) seen :24
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 05:34:50] [INFO ] Invariant cache hit.
[2023-03-11 05:34:50] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-11 05:34:50] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:34:50] [INFO ] After 80ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-11 05:34:50] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 5 ms to minimize.
[2023-03-11 05:34:50] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2023-03-11 05:34:50] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 0 ms to minimize.
[2023-03-11 05:34:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 247 ms
[2023-03-11 05:34:50] [INFO ] After 373ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 05:34:50] [INFO ] After 468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 05:34:50] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-11 05:34:50] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 05:34:51] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 05:34:51] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2023-03-11 05:34:51] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-03-11 05:34:51] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2023-03-11 05:34:51] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2023-03-11 05:34:51] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2023-03-11 05:34:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 346 ms
[2023-03-11 05:34:51] [INFO ] After 506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-11 05:34:51] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 245/245 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 252 transition count 160
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 95 rules applied. Total rules applied 180 place count 167 transition count 150
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 187 place count 161 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 160 transition count 149
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 188 place count 160 transition count 117
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 252 place count 128 transition count 117
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 256 place count 124 transition count 113
Iterating global reduction 4 with 4 rules applied. Total rules applied 260 place count 124 transition count 113
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 260 place count 124 transition count 110
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 266 place count 121 transition count 110
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 356 place count 76 transition count 59
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 368 place count 76 transition count 47
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 380 place count 64 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 381 place count 63 transition count 46
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 5 with 25 rules applied. Total rules applied 406 place count 51 transition count 33
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 14 rules applied. Total rules applied 420 place count 38 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 421 place count 37 transition count 32
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 421 place count 37 transition count 25
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 435 place count 30 transition count 25
Applied a total of 435 rules in 55 ms. Remains 30 /252 variables (removed 222) and now considering 25/245 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 30/252 places, 25/245 transitions.
Finished random walk after 32 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=16 )
Computed a total of 69 stabilizing places and 69 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X((G(p0)&&p1)) U ((!X(p2) U p0)&&p3)))))'
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 244 transition count 237
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 244 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 244 transition count 236
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 239 transition count 231
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 239 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 238 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 238 transition count 230
Applied a total of 29 rules in 36 ms. Remains 238 /252 variables (removed 14) and now considering 230/245 (removed 15) transitions.
// Phase 1: matrix 230 rows 238 cols
[2023-03-11 05:34:52] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-11 05:34:52] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-11 05:34:52] [INFO ] Invariant cache hit.
[2023-03-11 05:34:52] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-11 05:34:52] [INFO ] Invariant cache hit.
[2023-03-11 05:34:52] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/252 places, 230/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 238/252 places, 230/245 transitions.
Stuttering acceptance computed with spot in 749 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p0)), (OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) p2)), true, (NOT p0), (OR (NOT p0) p2)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) p0 p1), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND p3 p0 p1), acceptance={0} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=3 dest: 4}, { cond=(AND p3 p0 p1 p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=p2, acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s134 1), p0:(EQ s37 1), p1:(EQ s10 1), p2:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-01 finished in 1567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 242 transition count 235
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 242 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 242 transition count 234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 236 transition count 228
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 233 transition count 225
Applied a total of 39 rules in 55 ms. Remains 233 /252 variables (removed 19) and now considering 225/245 (removed 20) transitions.
// Phase 1: matrix 225 rows 233 cols
[2023-03-11 05:34:53] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-11 05:34:53] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-11 05:34:53] [INFO ] Invariant cache hit.
[2023-03-11 05:34:54] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-11 05:34:54] [INFO ] Invariant cache hit.
[2023-03-11 05:34:54] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/252 places, 225/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 233/252 places, 225/245 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s27 1) (EQ s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-02 finished in 659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 251 transition count 161
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 90 rules applied. Total rules applied 173 place count 168 transition count 154
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 179 place count 164 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 162 transition count 152
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 181 place count 162 transition count 118
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 249 place count 128 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 253 place count 124 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 257 place count 124 transition count 114
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 257 place count 124 transition count 111
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 263 place count 121 transition count 111
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 353 place count 76 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 354 place count 75 transition count 59
Reduce places removed 4 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 5 rules applied. Total rules applied 359 place count 71 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 360 place count 70 transition count 58
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 360 place count 70 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 366 place count 67 transition count 55
Applied a total of 366 rules in 33 ms. Remains 67 /252 variables (removed 185) and now considering 55/245 (removed 190) transitions.
// Phase 1: matrix 55 rows 67 cols
[2023-03-11 05:34:54] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-11 05:34:54] [INFO ] Implicit Places using invariants in 74 ms returned [27, 38, 55, 60, 66]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 76 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/252 places, 55/245 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 57 transition count 50
Applied a total of 10 rules in 4 ms. Remains 57 /62 variables (removed 5) and now considering 50/55 (removed 5) transitions.
// Phase 1: matrix 50 rows 57 cols
[2023-03-11 05:34:54] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-11 05:34:54] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-11 05:34:54] [INFO ] Invariant cache hit.
[2023-03-11 05:34:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:34:54] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/252 places, 50/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 57/252 places, 50/245 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s23 0) (EQ s49 0)), p1:(EQ s6 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5127 reset in 297 ms.
Product exploration explored 100000 steps with 5156 reset in 208 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 336 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 520 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13995 steps, run visited all 1 properties in 38 ms. (steps per millisecond=368 )
Probabilistic random walk after 13995 steps, saw 3129 distinct states, run finished after 38 ms. (steps per millisecond=368 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 382 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1)]
Support contains 1 out of 57 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 : 57/57 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-11 05:34:56] [INFO ] Invariant cache hit.
[2023-03-11 05:34:56] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-11 05:34:56] [INFO ] Invariant cache hit.
[2023-03-11 05:34:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:34:56] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-11 05:34:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 05:34:56] [INFO ] Invariant cache hit.
[2023-03-11 05:34:56] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 300 ms. Remains : 57/57 places, 50/50 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 515 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13995 steps, run visited all 1 properties in 26 ms. (steps per millisecond=538 )
Probabilistic random walk after 13995 steps, saw 3129 distinct states, run finished after 26 ms. (steps per millisecond=538 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1)]
Product exploration explored 100000 steps with 5146 reset in 171 ms.
Product exploration explored 100000 steps with 5164 reset in 225 ms.
Built C files in :
/tmp/ltsmin15083219537930477095
[2023-03-11 05:34:57] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2023-03-11 05:34:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:34:57] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2023-03-11 05:34:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:34:57] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2023-03-11 05:34:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:34:57] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15083219537930477095
Running compilation step : cd /tmp/ltsmin15083219537930477095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 538 ms.
Running link step : cd /tmp/ltsmin15083219537930477095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin15083219537930477095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4438627520852469364.hoa' '--buchi-type=spotba'
LTSmin run took 243 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-03b-LTLFireability-05 finished in 4269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G((G(p0) U p1)))&&(p2||F(p3))))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 244 transition count 237
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 244 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 244 transition count 236
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 239 transition count 231
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 239 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 237 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 236 transition count 228
Applied a total of 33 rules in 38 ms. Remains 236 /252 variables (removed 16) and now considering 228/245 (removed 17) transitions.
// Phase 1: matrix 228 rows 236 cols
[2023-03-11 05:34:58] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-11 05:34:58] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-11 05:34:58] [INFO ] Invariant cache hit.
[2023-03-11 05:34:58] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-11 05:34:58] [INFO ] Invariant cache hit.
[2023-03-11 05:34:59] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/252 places, 228/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 236/252 places, 228/245 transitions.
Stuttering acceptance computed with spot in 470 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}], [{ cond=(OR p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s114 0), p3:(EQ s142 0), p1:(EQ s114 1), p0:(EQ s105 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 156 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-06 finished in 1171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(p1&&X((p1 U (X(p2)||G(p1)))))))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 243 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 243 transition count 236
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 237 transition count 230
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 237 transition count 230
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 235 transition count 228
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 235 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 234 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 234 transition count 227
Applied a total of 36 rules in 35 ms. Remains 234 /252 variables (removed 18) and now considering 227/245 (removed 18) transitions.
// Phase 1: matrix 227 rows 234 cols
[2023-03-11 05:34:59] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-11 05:34:59] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-11 05:34:59] [INFO ] Invariant cache hit.
[2023-03-11 05:35:00] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-11 05:35:00] [INFO ] Invariant cache hit.
[2023-03-11 05:35:00] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/252 places, 227/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 234/252 places, 227/245 transitions.
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s21 0), p1:(NEQ s196 1), p2:(EQ s214 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 660 reset in 272 ms.
Product exploration explored 100000 steps with 660 reset in 260 ms.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Detected a total of 57/234 stabilizing places and 57/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 465 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 546 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Finished Best-First random walk after 1028 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=514 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 800 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 590 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 516 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 227/227 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 233 transition count 151
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 84 rules applied. Total rules applied 159 place count 158 transition count 142
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 167 place count 152 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 169 place count 150 transition count 140
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 169 place count 150 transition count 108
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 233 place count 118 transition count 108
Performed 43 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 319 place count 75 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 320 place count 74 transition count 58
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 329 place count 68 transition count 55
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 332 place count 65 transition count 55
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 332 place count 65 transition count 52
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 338 place count 62 transition count 52
Applied a total of 338 rules in 43 ms. Remains 62 /234 variables (removed 172) and now considering 52/227 (removed 175) transitions.
// Phase 1: matrix 52 rows 62 cols
[2023-03-11 05:35:04] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-11 05:35:04] [INFO ] Implicit Places using invariants in 176 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 190 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/234 places, 52/227 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 56 transition count 47
Applied a total of 10 rules in 5 ms. Remains 56 /61 variables (removed 5) and now considering 47/52 (removed 5) transitions.
// Phase 1: matrix 47 rows 56 cols
[2023-03-11 05:35:04] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-11 05:35:04] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-11 05:35:04] [INFO ] Invariant cache hit.
[2023-03-11 05:35:04] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/234 places, 47/227 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 455 ms. Remains : 56/234 places, 47/227 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/56 stabilizing places and 4/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Knowledge based reduction with 8 factoid took 1017 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 588 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Finished random walk after 516 steps, including 25 resets, run visited all 6 properties in 3 ms. (steps per millisecond=172 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 1050 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 580 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 520 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 565 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 5075 reset in 173 ms.
Product exploration explored 100000 steps with 5040 reset in 200 ms.
Built C files in :
/tmp/ltsmin10112617581747191564
[2023-03-11 05:35:09] [INFO ] Computing symmetric may disable matrix : 47 transitions.
[2023-03-11 05:35:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:35:09] [INFO ] Computing symmetric may enable matrix : 47 transitions.
[2023-03-11 05:35:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:35:09] [INFO ] Computing Do-Not-Accords matrix : 47 transitions.
[2023-03-11 05:35:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:35:09] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10112617581747191564
Running compilation step : cd /tmp/ltsmin10112617581747191564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 184 ms.
Running link step : cd /tmp/ltsmin10112617581747191564;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin10112617581747191564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7534064593506991360.hoa' '--buchi-type=spotba'
LTSmin run took 416 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-03b-LTLFireability-07 finished in 10545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(p1)&&X(X(G((p2&&X(p3))))))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 243 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 243 transition count 236
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 243 transition count 235
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 238 transition count 230
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 238 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 237 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 236 transition count 228
Applied a total of 33 rules in 14 ms. Remains 236 /252 variables (removed 16) and now considering 228/245 (removed 17) transitions.
// Phase 1: matrix 228 rows 236 cols
[2023-03-11 05:35:10] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-11 05:35:10] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 05:35:10] [INFO ] Invariant cache hit.
[2023-03-11 05:35:10] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-11 05:35:10] [INFO ] Invariant cache hit.
[2023-03-11 05:35:10] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/252 places, 228/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 478 ms. Remains : 236/252 places, 228/245 transitions.
Stuttering acceptance computed with spot in 584 ms :[true, (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 8}], [{ cond=(OR (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2 p3), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2 p3), acceptance={} source=5 dest: 5}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 2}, { cond=(AND p0 p1), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=6, aps=[p1:(EQ s111 0), p2:(EQ s111 1), p0:(EQ s87 0), p3:(EQ s87 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 67 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-08 finished in 1086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 242 transition count 235
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 242 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 242 transition count 234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 236 transition count 228
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 233 transition count 225
Applied a total of 39 rules in 32 ms. Remains 233 /252 variables (removed 19) and now considering 225/245 (removed 20) transitions.
// Phase 1: matrix 225 rows 233 cols
[2023-03-11 05:35:11] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-11 05:35:11] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-11 05:35:11] [INFO ] Invariant cache hit.
[2023-03-11 05:35:11] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-11 05:35:11] [INFO ] Invariant cache hit.
[2023-03-11 05:35:11] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/252 places, 225/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 233/252 places, 225/245 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s50 1) (EQ s176 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 156 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-09 finished in 563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 251 transition count 158
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 96 rules applied. Total rules applied 182 place count 165 transition count 148
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 188 place count 159 transition count 148
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 188 place count 159 transition count 114
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 256 place count 125 transition count 114
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 262 place count 119 transition count 108
Iterating global reduction 3 with 6 rules applied. Total rules applied 268 place count 119 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 268 place count 119 transition count 105
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 274 place count 116 transition count 105
Performed 43 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 360 place count 73 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 361 place count 72 transition count 55
Reduce places removed 5 places and 0 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 3 with 7 rules applied. Total rules applied 368 place count 67 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 370 place count 65 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 370 place count 65 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 376 place count 62 transition count 50
Applied a total of 376 rules in 19 ms. Remains 62 /252 variables (removed 190) and now considering 50/245 (removed 195) transitions.
// Phase 1: matrix 50 rows 62 cols
[2023-03-11 05:35:11] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-11 05:35:12] [INFO ] Implicit Places using invariants in 48 ms returned [23, 34, 45, 55, 61]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 48 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/252 places, 50/245 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 54 transition count 47
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 54 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 53 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 53 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 52 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 52 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 51 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 51 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 49 transition count 42
Applied a total of 16 rules in 4 ms. Remains 49 /57 variables (removed 8) and now considering 42/50 (removed 8) transitions.
// Phase 1: matrix 42 rows 49 cols
[2023-03-11 05:35:12] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-11 05:35:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-11 05:35:12] [INFO ] Invariant cache hit.
[2023-03-11 05:35:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:35:12] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/252 places, 42/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 199 ms. Remains : 49/252 places, 42/245 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s44 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]]
Product exploration explored 100000 steps with 12007 reset in 166 ms.
Stack based approach found an accepted trace after 3761 steps with 448 reset with depth 5 and stack size 5 in 6 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-10 finished in 445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G((p1||G(p2)))))))'
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 243 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 243 transition count 236
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 243 transition count 235
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 238 transition count 230
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 235 transition count 227
Applied a total of 35 rules in 18 ms. Remains 235 /252 variables (removed 17) and now considering 227/245 (removed 18) transitions.
// Phase 1: matrix 227 rows 235 cols
[2023-03-11 05:35:12] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-11 05:35:12] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-11 05:35:12] [INFO ] Invariant cache hit.
[2023-03-11 05:35:12] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-11 05:35:12] [INFO ] Invariant cache hit.
[2023-03-11 05:35:12] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/252 places, 227/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 235/252 places, 227/245 transitions.
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s20 1) (EQ s149 1)), p1:(EQ s78 1), p2:(EQ s61 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]]
Stuttering criterion allowed to conclude after 155 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-11 finished in 767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(X(F(p1))))))'
Support contains 5 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 243 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 243 transition count 236
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 243 transition count 235
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 237 transition count 229
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 234 transition count 226
Applied a total of 37 rules in 32 ms. Remains 234 /252 variables (removed 18) and now considering 226/245 (removed 19) transitions.
// Phase 1: matrix 226 rows 234 cols
[2023-03-11 05:35:13] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-11 05:35:13] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-11 05:35:13] [INFO ] Invariant cache hit.
[2023-03-11 05:35:13] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-11 05:35:13] [INFO ] Invariant cache hit.
[2023-03-11 05:35:13] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/252 places, 226/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 234/252 places, 226/245 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s61 1) (EQ s135 1)) (EQ s191 1)), p1:(OR (EQ s207 0) (EQ s230 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 245 ms.
Product exploration explored 100000 steps with 33333 reset in 174 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLFireability-12 finished in 1247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 251 transition count 158
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 93 rules applied. Total rules applied 179 place count 165 transition count 151
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 183 place count 161 transition count 151
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 183 place count 161 transition count 118
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 249 place count 128 transition count 118
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 256 place count 121 transition count 111
Iterating global reduction 3 with 7 rules applied. Total rules applied 263 place count 121 transition count 111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 263 place count 121 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 271 place count 117 transition count 107
Performed 44 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 359 place count 73 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 361 place count 72 transition count 57
Applied a total of 361 rules in 25 ms. Remains 72 /252 variables (removed 180) and now considering 57/245 (removed 188) transitions.
// Phase 1: matrix 57 rows 72 cols
[2023-03-11 05:35:14] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-11 05:35:14] [INFO ] Implicit Places using invariants in 83 ms returned [22, 23, 24, 25, 29, 30, 41, 52, 58, 64, 71]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 84 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/252 places, 57/245 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 61 transition count 52
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 56 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 52 transition count 48
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 52 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 51 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 51 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 50 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 50 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 49 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 49 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 48 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 47 transition count 63
Applied a total of 28 rules in 6 ms. Remains 47 /61 variables (removed 14) and now considering 63/57 (removed -6) transitions.
// Phase 1: matrix 63 rows 47 cols
[2023-03-11 05:35:14] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-11 05:35:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-11 05:35:14] [INFO ] Invariant cache hit.
[2023-03-11 05:35:14] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-11 05:35:14] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/252 places, 63/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 47/252 places, 63/245 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6133 reset in 183 ms.
Stack based approach found an accepted trace after 17357 steps with 1058 reset with depth 10 and stack size 10 in 19 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-14 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 243 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 243 transition count 236
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 243 transition count 235
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 238 transition count 230
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 235 transition count 227
Applied a total of 35 rules in 35 ms. Remains 235 /252 variables (removed 17) and now considering 227/245 (removed 18) transitions.
// Phase 1: matrix 227 rows 235 cols
[2023-03-11 05:35:14] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-11 05:35:15] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-11 05:35:15] [INFO ] Invariant cache hit.
[2023-03-11 05:35:15] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-11 05:35:15] [INFO ] Invariant cache hit.
[2023-03-11 05:35:15] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/252 places, 227/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 530 ms. Remains : 235/252 places, 227/245 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s55 1), p1:(EQ s195 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-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-15 finished in 769 ms.
All properties solved by simple procedures.
Total runtime 27160 ms.

BK_STOP 1678512915902

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-03b.tgz
mv AutoFlight-PT-03b 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 ;