fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813597800388
Last Updated
May 14, 2023

About the Execution of LTSMin+red for AutoFlight-PT-02a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
573.951 28364.00 53701.00 35.00 FFFFFFFFFFT?F?TF normal

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.r009-oct2-167813597800388.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 ltsminxred
Input is AutoFlight-PT-02a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597800388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.5K Feb 25 18:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 18:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 18:14 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.6K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 18:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 18:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:31 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 16K 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-02a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-02a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678626523714

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-02a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:08:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 13:08:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:08:47] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-12 13:08:47] [INFO ] Transformed 57 places.
[2023-03-12 13:08:47] [INFO ] Transformed 55 transitions.
[2023-03-12 13:08:47] [INFO ] Found NUPN structural information;
[2023-03-12 13:08:47] [INFO ] Parsed PT model containing 57 places and 55 transitions and 180 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA AutoFlight-PT-02a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 17 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 57 cols
[2023-03-12 13:08:47] [INFO ] Computed 16 place invariants in 4 ms
[2023-03-12 13:08:48] [INFO ] Implicit Places using invariants in 495 ms returned [17, 48, 54]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 543 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/57 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 562 ms. Remains : 54/57 places, 45/45 transitions.
Support contains 28 out of 54 places after structural reductions.
[2023-03-12 13:08:48] [INFO ] Flatten gal took : 28 ms
[2023-03-12 13:08:48] [INFO ] Flatten gal took : 8 ms
[2023-03-12 13:08:48] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 26 out of 54 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 388 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 54 cols
[2023-03-12 13:08:48] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-12 13:08:48] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 13:08:48] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 13:08:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 13:08:48] [INFO ] After 12ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-12 13:08:48] [INFO ] After 32ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:08:48] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:08:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 62 ms returned sat
[2023-03-12 13:08:49] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:08:49] [INFO ] After 6ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:08:49] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-12 13:08:49] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 4 ms.
Computed a total of 4 stabilizing places and 1 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' '!(F(G((!p0 U p1))))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 45/45 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 54 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 53 transition count 44
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 53 transition count 40
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 49 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 48 transition count 39
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 48 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 44 transition count 35
Applied a total of 20 rules in 19 ms. Remains 44 /54 variables (removed 10) and now considering 35/45 (removed 10) transitions.
// Phase 1: matrix 35 rows 44 cols
[2023-03-12 13:08:49] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 13:08:49] [INFO ] Implicit Places using invariants in 124 ms returned [5, 11, 12, 13, 24, 33, 43]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 126 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/54 places, 35/45 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 37 transition count 30
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 32 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 32 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 30 transition count 28
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 28 transition count 26
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 28 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 27 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 22 place count 26 transition count 36
Applied a total of 22 rules in 10 ms. Remains 26 /37 variables (removed 11) and now considering 36/35 (removed -1) transitions.
// Phase 1: matrix 36 rows 26 cols
[2023-03-12 13:08:49] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 13:08:49] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-12 13:08:49] [INFO ] Invariant cache hit.
[2023-03-12 13:08:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 13:08:50] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/54 places, 36/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 464 ms. Remains : 26/54 places, 36/45 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-02a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s10 1)), p0:(OR (AND (EQ s9 1) (EQ s17 1) (EQ s12 1)) (AND (EQ s9 1) (EQ s10 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-02a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLFireability-00 finished in 913 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' '!((p0 U (F(G(p1))||G(!p2))))'
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 45/45 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 0 with 4 rules applied. Total rules applied 4 place count 54 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 50 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 50 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 45 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 44 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 44 transition count 35
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 41 transition count 32
Applied a total of 26 rules in 15 ms. Remains 41 /54 variables (removed 13) and now considering 32/45 (removed 13) transitions.
// Phase 1: matrix 32 rows 41 cols
[2023-03-12 13:08:50] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 13:08:50] [INFO ] Implicit Places using invariants in 171 ms returned [6, 11, 12, 13, 30, 40]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 173 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/54 places, 32/45 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 0 with 6 rules applied. Total rules applied 6 place count 35 transition count 26
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 29 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 28 transition count 25
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 28 transition count 22
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 20 place count 25 transition count 22
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 24 transition count 21
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 24 transition count 21
Applied a total of 22 rules in 4 ms. Remains 24 /35 variables (removed 11) and now considering 21/32 (removed 11) transitions.
// Phase 1: matrix 21 rows 24 cols
[2023-03-12 13:08:50] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 13:08:50] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-12 13:08:50] [INFO ] Invariant cache hit.
[2023-03-12 13:08:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 13:08:50] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/54 places, 21/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 370 ms. Remains : 24/54 places, 21/45 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) p2), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : AutoFlight-PT-02a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2 p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s14 1) (EQ s23 1)), p2:(AND (EQ s10 1) (EQ s22 1)), p0:(AND (NOT (AND (EQ s10 1) (EQ s22 1))) (EQ s4 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 107 steps with 2 reset in 1 ms.
FORMULA AutoFlight-PT-02a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLFireability-01 finished in 575 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 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 45/45 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 0 with 4 rules applied. Total rules applied 4 place count 54 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 50 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 50 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 45 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 44 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 44 transition count 35
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 41 transition count 32
Applied a total of 26 rules in 5 ms. Remains 41 /54 variables (removed 13) and now considering 32/45 (removed 13) transitions.
// Phase 1: matrix 32 rows 41 cols
[2023-03-12 13:08:51] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 13:08:51] [INFO ] Implicit Places using invariants in 421 ms returned [5, 11, 12, 13, 14, 22, 30, 40]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 423 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/54 places, 32/45 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 33 transition count 22
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 23 transition count 22
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 21 transition count 20
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 21 transition count 20
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 20 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 19 transition count 30
Applied a total of 28 rules in 5 ms. Remains 19 /33 variables (removed 14) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 19 cols
[2023-03-12 13:08:51] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 13:08:51] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-12 13:08:51] [INFO ] Invariant cache hit.
[2023-03-12 13:08:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 13:08:51] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/54 places, 30/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 687 ms. Remains : 19/54 places, 30/45 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-02a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLFireability-02 finished in 766 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(G(p1)))))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 44
Applied a total of 2 rules in 7 ms. Remains 53 /54 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 53 cols
[2023-03-12 13:08:51] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 13:08:51] [INFO ] Implicit Places using invariants in 66 ms returned [7, 14, 19, 31, 41, 52]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 80 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/54 places, 44/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 44 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 44 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 43 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 43 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 42 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 42 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 41 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 41 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 40 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 40 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 39 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 39 transition count 36
Applied a total of 16 rules in 7 ms. Remains 39 /47 variables (removed 8) and now considering 36/44 (removed 8) transitions.
// Phase 1: matrix 36 rows 39 cols
[2023-03-12 13:08:51] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 13:08:52] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-12 13:08:52] [INFO ] Invariant cache hit.
[2023-03-12 13:08:52] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 39/54 places, 36/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 504 ms. Remains : 39/54 places, 36/45 transitions.
Stuttering acceptance computed with spot in 367 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02a-LTLFireability-04 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: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (EQ s6 1) (EQ s31 1)), p0:(EQ s12 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLFireability-04 finished in 911 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((X(G(p0))||((p0 U (p1||G(p0))) U p2))))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 44
Applied a total of 2 rules in 2 ms. Remains 53 /54 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 53 cols
[2023-03-12 13:08:52] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 13:08:52] [INFO ] Implicit Places using invariants in 180 ms returned [7, 14, 19, 31, 41, 52]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 184 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/54 places, 44/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 44 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 44 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 43 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 43 transition count 40
Applied a total of 8 rules in 3 ms. Remains 43 /47 variables (removed 4) and now considering 40/44 (removed 4) transitions.
// Phase 1: matrix 40 rows 43 cols
[2023-03-12 13:08:52] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 13:08:53] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-12 13:08:53] [INFO ] Invariant cache hit.
[2023-03-12 13:08:53] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 43/54 places, 40/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 357 ms. Remains : 43/54 places, 40/45 transitions.
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : AutoFlight-PT-02a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s11 1), p1:(AND (NEQ s21 1) (NEQ s20 1)), p0:(NEQ s21 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30529 steps with 10141 reset in 199 ms.
FORMULA AutoFlight-PT-02a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLFireability-05 finished in 931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 44
Applied a total of 2 rules in 2 ms. Remains 53 /54 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 53 cols
[2023-03-12 13:08:53] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 13:08:53] [INFO ] Implicit Places using invariants in 175 ms returned [7, 14, 19, 31, 41, 52]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 177 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/54 places, 44/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 44 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 44 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 43 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 43 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 42 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 42 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 41 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 41 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 40 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 40 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 39 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 39 transition count 36
Applied a total of 16 rules in 5 ms. Remains 39 /47 variables (removed 8) and now considering 36/44 (removed 8) transitions.
// Phase 1: matrix 36 rows 39 cols
[2023-03-12 13:08:53] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 13:08:54] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-12 13:08:54] [INFO ] Invariant cache hit.
[2023-03-12 13:08:54] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 39/54 places, 36/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 454 ms. Remains : 39/54 places, 36/45 transitions.
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s10 1) (NEQ s29 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 65 steps with 5 reset in 1 ms.
FORMULA AutoFlight-PT-02a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLFireability-08 finished in 747 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 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 45/45 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 0 with 4 rules applied. Total rules applied 4 place count 54 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 50 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 50 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 45 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 44 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 44 transition count 35
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 40 transition count 31
Applied a total of 28 rules in 4 ms. Remains 40 /54 variables (removed 14) and now considering 31/45 (removed 14) transitions.
// Phase 1: matrix 31 rows 40 cols
[2023-03-12 13:08:54] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 13:08:54] [INFO ] Implicit Places using invariants in 69 ms returned [5, 10, 11, 12, 13, 21, 39]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 70 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/54 places, 31/45 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 33 transition count 24
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 26 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 24 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 24 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 21 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 21 transition count 19
Applied a total of 24 rules in 3 ms. Remains 21 /33 variables (removed 12) and now considering 19/31 (removed 12) transitions.
// Phase 1: matrix 19 rows 21 cols
[2023-03-12 13:08:54] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 13:08:54] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-12 13:08:54] [INFO ] Invariant cache hit.
[2023-03-12 13:08:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 13:08:54] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/54 places, 19/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 254 ms. Remains : 21/54 places, 19/45 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-02a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s20 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 50000 reset in 149 ms.
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-02a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-02a-LTLFireability-10 finished in 869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 45/45 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 0 with 4 rules applied. Total rules applied 4 place count 54 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 50 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 50 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 45 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 44 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 44 transition count 35
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 40 transition count 31
Applied a total of 28 rules in 6 ms. Remains 40 /54 variables (removed 14) and now considering 31/45 (removed 14) transitions.
// Phase 1: matrix 31 rows 40 cols
[2023-03-12 13:08:55] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 13:08:55] [INFO ] Implicit Places using invariants in 66 ms returned [5, 10, 11, 12, 13, 21, 39]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 68 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/54 places, 31/45 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 33 transition count 24
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 26 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 24 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 24 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 21 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 21 transition count 19
Applied a total of 24 rules in 2 ms. Remains 21 /33 variables (removed 12) and now considering 19/31 (removed 12) transitions.
// Phase 1: matrix 19 rows 21 cols
[2023-03-12 13:08:55] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 13:08:55] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-12 13:08:55] [INFO ] Invariant cache hit.
[2023-03-12 13:08:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 13:08:55] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/54 places, 19/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 207 ms. Remains : 21/54 places, 19/45 transitions.
Stuttering acceptance computed with spot in 154 ms :[p0, p0]
Running random walk in product with property : AutoFlight-PT-02a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15314 reset in 147 ms.
Product exploration explored 100000 steps with 15511 reset in 233 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 236 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 264 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[p0, p0]
Stuttering acceptance computed with spot in 188 ms :[p0, p0]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2023-03-12 13:08:57] [INFO ] Invariant cache hit.
[2023-03-12 13:08:57] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-12 13:08:57] [INFO ] Invariant cache hit.
[2023-03-12 13:08:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 13:08:57] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-12 13:08:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:08:57] [INFO ] Invariant cache hit.
[2023-03-12 13:08:57] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 21/21 places, 19/19 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[p0, p0]
Stuttering acceptance computed with spot in 124 ms :[p0, p0]
Stuttering acceptance computed with spot in 178 ms :[p0, p0]
Product exploration explored 100000 steps with 15438 reset in 84 ms.
Product exploration explored 100000 steps with 15465 reset in 114 ms.
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 19/19 transitions.
Applied a total of 0 rules in 13 ms. Remains 21 /21 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2023-03-12 13:08:58] [INFO ] Invariant cache hit.
[2023-03-12 13:08:58] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 13:08:58] [INFO ] Invariant cache hit.
[2023-03-12 13:08:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 13:08:58] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-12 13:08:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:08:58] [INFO ] Invariant cache hit.
[2023-03-12 13:08:59] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 21/21 places, 19/19 transitions.
Treatment of property AutoFlight-PT-02a-LTLFireability-11 finished in 3737 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 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 45/45 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 0 with 4 rules applied. Total rules applied 4 place count 54 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 50 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 50 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 45 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 44 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 44 transition count 35
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 40 transition count 31
Applied a total of 28 rules in 4 ms. Remains 40 /54 variables (removed 14) and now considering 31/45 (removed 14) transitions.
// Phase 1: matrix 31 rows 40 cols
[2023-03-12 13:08:59] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 13:08:59] [INFO ] Implicit Places using invariants in 64 ms returned [10, 11, 12, 13, 21, 29, 39]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 70 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/54 places, 31/45 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 0 with 3 rules applied. Total rules applied 3 place count 33 transition count 28
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 30 transition count 28
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 30 transition count 25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 27 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 25 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 25 transition count 23
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 18 place count 24 transition count 22
Applied a total of 18 rules in 3 ms. Remains 24 /33 variables (removed 9) and now considering 22/31 (removed 9) transitions.
// Phase 1: matrix 22 rows 24 cols
[2023-03-12 13:08:59] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 13:08:59] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-12 13:08:59] [INFO ] Invariant cache hit.
[2023-03-12 13:08:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 13:08:59] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/54 places, 22/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 687 ms. Remains : 24/54 places, 22/45 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-02a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s8 0) (EQ s18 0)) (OR (EQ s5 0) (EQ s14 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6567 reset in 207 ms.
Stack based approach found an accepted trace after 34 steps with 1 reset with depth 21 and stack size 21 in 0 ms.
FORMULA AutoFlight-PT-02a-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-02a-LTLFireability-12 finished in 992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p0)||X(G(p1)))))))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 54 cols
[2023-03-12 13:09:00] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 13:09:00] [INFO ] Implicit Places using invariants in 78 ms returned [7, 14, 19, 31, 41]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 79 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/54 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 43
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 46 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 46 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 45 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 45 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 44 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 44 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 43 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 43 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 42 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 42 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 41 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 41 transition count 37
Applied a total of 16 rules in 3 ms. Remains 41 /49 variables (removed 8) and now considering 37/45 (removed 8) transitions.
// Phase 1: matrix 37 rows 41 cols
[2023-03-12 13:09:00] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 13:09:00] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-12 13:09:00] [INFO ] Invariant cache hit.
[2023-03-12 13:09:00] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/54 places, 37/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 41/54 places, 37/45 transitions.
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s12 0), p1:(OR (EQ s30 0) (EQ s40 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 13023 reset in 89 ms.
Product exploration explored 100000 steps with 13078 reset in 124 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 389 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:09:01] [INFO ] Invariant cache hit.
[2023-03-12 13:09:01] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:09:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 13:09:01] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:09:01] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 13:09:01] [INFO ] After 379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 37/37 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 0 with 6 rules applied. Total rules applied 6 place count 41 transition count 31
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 35 transition count 31
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 35 transition count 27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 31 transition count 27
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 2 with 10 rules applied. Total rules applied 30 place count 26 transition count 22
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 26 transition count 19
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 23 transition count 19
Applied a total of 36 rules in 6 ms. Remains 23 /41 variables (removed 18) and now considering 19/37 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 23/41 places, 19/37 transitions.
Finished random walk after 242 steps, including 11 resets, run visited all 1 properties in 1 ms. (steps per millisecond=242 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 237 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2023-03-12 13:09:02] [INFO ] Invariant cache hit.
[2023-03-12 13:09:02] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-12 13:09:02] [INFO ] Invariant cache hit.
[2023-03-12 13:09:02] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-12 13:09:02] [INFO ] Invariant cache hit.
[2023-03-12 13:09:02] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 41/41 places, 37/37 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 395 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:09:03] [INFO ] Invariant cache hit.
[2023-03-12 13:09:03] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:09:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 20 ms returned sat
[2023-03-12 13:09:03] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:09:03] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-12 13:09:03] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 37/37 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 0 with 6 rules applied. Total rules applied 6 place count 41 transition count 31
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 35 transition count 31
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 35 transition count 27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 31 transition count 27
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 2 with 10 rules applied. Total rules applied 30 place count 26 transition count 22
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 26 transition count 19
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 23 transition count 19
Applied a total of 36 rules in 3 ms. Remains 23 /41 variables (removed 18) and now considering 19/37 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 23/41 places, 19/37 transitions.
Finished random walk after 578 steps, including 28 resets, run visited all 1 properties in 1 ms. (steps per millisecond=578 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 336 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 13113 reset in 134 ms.
Product exploration explored 100000 steps with 13238 reset in 89 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 37/37 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 41 transition count 37
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 41 transition count 39
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 41 transition count 39
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 37 transition count 35
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 37 transition count 35
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 37 transition count 35
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 34 transition count 32
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 34 transition count 32
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 29 rules in 17 ms. Remains 34 /41 variables (removed 7) and now considering 32/37 (removed 5) transitions.
[2023-03-12 13:09:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 34 cols
[2023-03-12 13:09:05] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 13:09:05] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/41 places, 32/37 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 34/41 places, 32/37 transitions.
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 37/37 (removed 0) transitions.
// Phase 1: matrix 37 rows 41 cols
[2023-03-12 13:09:05] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 13:09:05] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-12 13:09:05] [INFO ] Invariant cache hit.
[2023-03-12 13:09:05] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-12 13:09:05] [INFO ] Invariant cache hit.
[2023-03-12 13:09:05] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 41/41 places, 37/37 transitions.
Treatment of property AutoFlight-PT-02a-LTLFireability-13 finished in 5875 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(p1)&&p0)))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 54 cols
[2023-03-12 13:09:05] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 13:09:06] [INFO ] Implicit Places using invariants in 76 ms returned [7, 14, 19, 31, 41]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 78 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/54 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 43
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 46 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 46 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 45 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 45 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 44 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 44 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 43 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 43 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 42 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 42 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 41 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 41 transition count 37
Applied a total of 16 rules in 7 ms. Remains 41 /49 variables (removed 8) and now considering 37/45 (removed 8) transitions.
// Phase 1: matrix 37 rows 41 cols
[2023-03-12 13:09:06] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 13:09:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 13:09:06] [INFO ] Invariant cache hit.
[2023-03-12 13:09:06] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/54 places, 37/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 188 ms. Remains : 41/54 places, 37/45 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-02a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s1 1) (EQ s26 1)), p0:(AND (EQ s34 1) (EQ s40 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLFireability-15 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p0)||X(G(p1)))))))'
Found a Lengthening insensitive property : AutoFlight-PT-02a-LTLFireability-13
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 54/54 places, 45/45 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 0 with 4 rules applied. Total rules applied 4 place count 54 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 50 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 50 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 45 transition count 36
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 42 transition count 33
Applied a total of 24 rules in 4 ms. Remains 42 /54 variables (removed 12) and now considering 33/45 (removed 12) transitions.
// Phase 1: matrix 33 rows 42 cols
[2023-03-12 13:09:06] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 13:09:06] [INFO ] Implicit Places using invariants in 73 ms returned [5, 11, 12, 13, 14, 22, 30]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 76 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 35/54 places, 33/45 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 35 transition count 26
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 28 transition count 26
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 14 place count 28 transition count 22
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 24 transition count 22
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 22 transition count 20
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 22 transition count 20
Applied a total of 26 rules in 2 ms. Remains 22 /35 variables (removed 13) and now considering 20/33 (removed 13) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-12 13:09:06] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 13:09:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 13:09:06] [INFO ] Invariant cache hit.
[2023-03-12 13:09:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 13:09:06] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 22/54 places, 20/45 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 147 ms. Remains : 22/54 places, 20/45 transitions.
Running random walk in product with property : AutoFlight-PT-02a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s9 0), p1:(OR (EQ s15 0) (EQ s21 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 15564 reset in 68 ms.
Product exploration explored 100000 steps with 15595 reset in 147 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 4017 steps, including 305 resets, run visited all 2 properties in 10 ms. (steps per millisecond=401 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-12 13:09:08] [INFO ] Invariant cache hit.
[2023-03-12 13:09:08] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-12 13:09:08] [INFO ] Invariant cache hit.
[2023-03-12 13:09:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 13:09:08] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-12 13:09:08] [INFO ] Invariant cache hit.
[2023-03-12 13:09:08] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 22/22 places, 20/20 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 854 steps, including 63 resets, run visited all 2 properties in 3 ms. (steps per millisecond=284 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 220 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 404 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 15665 reset in 79 ms.
Product exploration explored 100000 steps with 15589 reset in 101 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-12 13:09:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:09:10] [INFO ] Invariant cache hit.
[2023-03-12 13:09:11] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-12 13:09:11] [INFO ] Invariant cache hit.
[2023-03-12 13:09:11] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-12 13:09:11] [INFO ] Invariant cache hit.
[2023-03-12 13:09:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 13:09:11] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-12 13:09:11] [INFO ] Invariant cache hit.
[2023-03-12 13:09:11] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 22/22 places, 20/20 transitions.
Treatment of property AutoFlight-PT-02a-LTLFireability-13 finished in 4865 ms.
[2023-03-12 13:09:11] [INFO ] Flatten gal took : 4 ms
[2023-03-12 13:09:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 13:09:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 45 transitions and 151 arcs took 1 ms.
Total runtime 24221 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1465/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1465/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-02a-LTLFireability-11
Could not compute solution for formula : AutoFlight-PT-02a-LTLFireability-13

BK_STOP 1678626552078

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutoFlight-PT-02a-LTLFireability-11
ltl formula formula --ltl=/tmp/1465/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 45 transitions and 151 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1465/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1465/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1465/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1465/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name AutoFlight-PT-02a-LTLFireability-13
ltl formula formula --ltl=/tmp/1465/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 45 transitions and 151 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1465/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1465/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1465/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1465/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-02a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutoFlight-PT-02a, 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 r009-oct2-167813597800388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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