Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 22:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 22:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 12 22:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 36K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717187056237

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-05a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:24:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:24:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:24:19] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-31 20:24:19] [INFO ] Transformed 132 places.
[2024-05-31 20:24:19] [INFO ] Transformed 130 transitions.
[2024-05-31 20:24:19] [INFO ] Found NUPN structural information;
[2024-05-31 20:24:19] [INFO ] Parsed PT model containing 132 places and 130 transitions and 420 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA AutoFlight-PT-05a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 105/105 transitions.
Applied a total of 0 rules in 35 ms. Remains 132 /132 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 132 cols
[2024-05-31 20:24:19] [INFO ] Computed 34 invariants in 15 ms
[2024-05-31 20:24:20] [INFO ] Implicit Places using invariants in 627 ms returned [7, 21, 28, 38, 41, 44, 47, 50, 77, 111, 123, 129]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 694 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/132 places, 105/105 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 103
Applied a total of 4 rules in 33 ms. Remains 118 /120 variables (removed 2) and now considering 103/105 (removed 2) transitions.
// Phase 1: matrix 103 rows 118 cols
[2024-05-31 20:24:20] [INFO ] Computed 22 invariants in 5 ms
[2024-05-31 20:24:20] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-31 20:24:20] [INFO ] Invariant cache hit.
[2024-05-31 20:24:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:24:20] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 118/132 places, 103/105 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1276 ms. Remains : 118/132 places, 103/105 transitions.
Support contains 29 out of 118 places after structural reductions.
[2024-05-31 20:24:20] [INFO ] Flatten gal took : 64 ms
[2024-05-31 20:24:21] [INFO ] Flatten gal took : 28 ms
[2024-05-31 20:24:21] [INFO ] Input system was already deterministic with 103 transitions.
Support contains 28 out of 118 places (down from 29) after GAL structural reductions.
RANDOM walk for 40000 steps (1219 resets) in 1602 ms. (24 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40003 steps (176 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
[2024-05-31 20:24:21] [INFO ] Invariant cache hit.
[2024-05-31 20:24:21] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 76/221 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 3/22 constraints, State Equation: 0/118 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA AutoFlight-PT-05a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 103/103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 118 transition count 84
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 99 transition count 84
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 38 place count 99 transition count 67
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 82 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 81 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 81 transition count 66
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 92 place count 72 transition count 57
Applied a total of 92 rules in 58 ms. Remains 72 /118 variables (removed 46) and now considering 57/103 (removed 46) transitions.
// Phase 1: matrix 57 rows 72 cols
[2024-05-31 20:24:22] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 20:24:22] [INFO ] Implicit Places using invariants in 141 ms returned [10, 24, 25, 26, 27, 28, 29, 50, 55, 71]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 142 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/118 places, 57/103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 62 transition count 51
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 11 rules applied. Total rules applied 17 place count 56 transition count 46
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 22 place count 51 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 51 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 50 transition count 45
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 48 transition count 43
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 48 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 47 transition count 42
Applied a total of 30 rules in 23 ms. Remains 47 /62 variables (removed 15) and now considering 42/57 (removed 15) transitions.
// Phase 1: matrix 42 rows 47 cols
[2024-05-31 20:24:22] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 20:24:22] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 20:24:22] [INFO ] Invariant cache hit.
[2024-05-31 20:24:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:24:22] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/118 places, 42/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 415 ms. Remains : 47/118 places, 42/103 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-00
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-00 finished in 858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(!p1 U (!p2||G(!p1))))))'
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 103/103 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 102
Applied a total of 2 rules in 17 ms. Remains 117 /118 variables (removed 1) and now considering 102/103 (removed 1) transitions.
// Phase 1: matrix 102 rows 117 cols
[2024-05-31 20:24:23] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 20:24:23] [INFO ] Implicit Places using invariants in 119 ms returned [13, 32, 90, 96, 106, 116]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 120 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/118 places, 102/103 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 108 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 108 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 107 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 107 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 106 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 106 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 105 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 105 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 104 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 104 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 103 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 103 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 102 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 101 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 101 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 100 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 100 transition count 91
Applied a total of 22 rules in 32 ms. Remains 100 /111 variables (removed 11) and now considering 91/102 (removed 11) transitions.
// Phase 1: matrix 91 rows 100 cols
[2024-05-31 20:24:23] [INFO ] Computed 16 invariants in 1 ms
[2024-05-31 20:24:23] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-31 20:24:23] [INFO ] Invariant cache hit.
[2024-05-31 20:24:23] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/118 places, 91/103 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 420 ms. Remains : 100/118 places, 91/103 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 743 ms.
Product exploration explored 100000 steps with 50000 reset in 325 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 (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 81 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05a-LTLFireability-02 finished in 1786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 103/103 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 115 transition count 69
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 82 transition count 69
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 82 transition count 58
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 95 place count 66 transition count 58
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 95 place count 66 transition count 53
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 105 place count 61 transition count 53
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 127 place count 50 transition count 42
Applied a total of 127 rules in 20 ms. Remains 50 /118 variables (removed 68) and now considering 42/103 (removed 61) transitions.
// Phase 1: matrix 42 rows 50 cols
[2024-05-31 20:24:24] [INFO ] Computed 15 invariants in 1 ms
[2024-05-31 20:24:24] [INFO ] Implicit Places using invariants in 83 ms returned [32, 36, 42]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 85 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/118 places, 42/103 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 39
Applied a total of 6 rules in 6 ms. Remains 44 /47 variables (removed 3) and now considering 39/42 (removed 3) transitions.
// Phase 1: matrix 39 rows 44 cols
[2024-05-31 20:24:24] [INFO ] Computed 12 invariants in 3 ms
[2024-05-31 20:24:24] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 20:24:24] [INFO ] Invariant cache hit.
[2024-05-31 20:24:25] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/118 places, 39/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 279 ms. Remains : 44/118 places, 39/103 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-04
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-04 finished in 352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 103/103 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 102
Applied a total of 2 rules in 7 ms. Remains 117 /118 variables (removed 1) and now considering 102/103 (removed 1) transitions.
// Phase 1: matrix 102 rows 117 cols
[2024-05-31 20:24:25] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 20:24:25] [INFO ] Implicit Places using invariants in 245 ms returned [13, 32, 90, 96, 106, 116]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 246 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/118 places, 102/103 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 108 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 108 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 107 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 107 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 106 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 106 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 105 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 105 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 104 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 104 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 103 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 103 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 102 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 101 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 101 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 100 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 100 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 99 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 99 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 98 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 98 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 97 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 93 transition count 84
Applied a total of 36 rules in 47 ms. Remains 93 /111 variables (removed 18) and now considering 84/102 (removed 18) transitions.
// Phase 1: matrix 84 rows 93 cols
[2024-05-31 20:24:25] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 20:24:25] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-31 20:24:25] [INFO ] Invariant cache hit.
[2024-05-31 20:24:25] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/118 places, 84/103 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 504 ms. Remains : 93/118 places, 84/103 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Product exploration explored 100000 steps with 50000 reset in 343 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 (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05a-LTLFireability-05 finished in 1163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 103/103 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 102
Applied a total of 2 rules in 5 ms. Remains 117 /118 variables (removed 1) and now considering 102/103 (removed 1) transitions.
// Phase 1: matrix 102 rows 117 cols
[2024-05-31 20:24:26] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 20:24:26] [INFO ] Implicit Places using invariants in 111 ms returned [13, 32, 90, 96, 106, 116]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 113 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/118 places, 102/103 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 108 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 108 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 107 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 107 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 106 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 106 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 105 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 105 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 104 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 104 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 103 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 103 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 102 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 101 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 101 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 100 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 100 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 99 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 99 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 98 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 98 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 97 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 93 transition count 84
Applied a total of 36 rules in 26 ms. Remains 93 /111 variables (removed 18) and now considering 84/102 (removed 18) transitions.
// Phase 1: matrix 84 rows 93 cols
[2024-05-31 20:24:26] [INFO ] Computed 16 invariants in 1 ms
[2024-05-31 20:24:26] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-31 20:24:26] [INFO ] Invariant cache hit.
[2024-05-31 20:24:26] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/118 places, 84/103 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 393 ms. Remains : 93/118 places, 84/103 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-07 finished in 520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)||G(p2)))'
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 103/103 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 115 transition count 72
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 85 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 84 transition count 71
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 64 place count 84 transition count 59
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 93 place count 67 transition count 59
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 93 place count 67 transition count 54
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 103 place count 62 transition count 54
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 61 transition count 53
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 61 transition count 53
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 123 place count 52 transition count 44
Applied a total of 123 rules in 17 ms. Remains 52 /118 variables (removed 66) and now considering 44/103 (removed 59) transitions.
// Phase 1: matrix 44 rows 52 cols
[2024-05-31 20:24:26] [INFO ] Computed 15 invariants in 1 ms
[2024-05-31 20:24:26] [INFO ] Implicit Places using invariants in 103 ms returned [35, 39, 45, 51]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 105 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/118 places, 44/103 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 45 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 45 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 44 transition count 40
Applied a total of 8 rules in 5 ms. Remains 44 /48 variables (removed 4) and now considering 40/44 (removed 4) transitions.
// Phase 1: matrix 40 rows 44 cols
[2024-05-31 20:24:26] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 20:24:27] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 20:24:27] [INFO ] Invariant cache hit.
[2024-05-31 20:24:27] [INFO ] Implicit Places using invariants and state equation in 102 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 : 44/118 places, 40/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 305 ms. Remains : 44/118 places, 40/103 transitions.
Stuttering acceptance computed with spot in 361 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3476 steps with 194 reset in 20 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-10 finished in 705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 103/103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 118 transition count 84
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 99 transition count 84
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 38 place count 99 transition count 67
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 82 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 81 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 81 transition count 66
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 92 place count 72 transition count 57
Applied a total of 92 rules in 15 ms. Remains 72 /118 variables (removed 46) and now considering 57/103 (removed 46) transitions.
// Phase 1: matrix 57 rows 72 cols
[2024-05-31 20:24:27] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 20:24:27] [INFO ] Implicit Places using invariants in 142 ms returned [10, 24, 25, 26, 27, 28, 29, 50, 55, 63, 71]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 143 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/118 places, 57/103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 61 transition count 45
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 49 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 46 transition count 42
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 46 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 44 transition count 40
Applied a total of 34 rules in 18 ms. Remains 44 /61 variables (removed 17) and now considering 40/57 (removed 17) transitions.
// Phase 1: matrix 40 rows 44 cols
[2024-05-31 20:24:27] [INFO ] Computed 11 invariants in 0 ms
[2024-05-31 20:24:27] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 20:24:27] [INFO ] Invariant cache hit.
[2024-05-31 20:24:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:24:27] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/118 places, 40/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 369 ms. Remains : 44/118 places, 40/103 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-13
Product exploration explored 100000 steps with 5379 reset in 359 ms.
Product exploration explored 100000 steps with 5411 reset in 451 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 (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 184 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2157 resets) in 149 ms. (266 steps per ms) remains 1/6 properties
BEST_FIRST walk for 37517 steps (300 resets) in 75 ms. (493 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 408 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 40/40 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-05-31 20:24:29] [INFO ] Invariant cache hit.
[2024-05-31 20:24:29] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 20:24:29] [INFO ] Invariant cache hit.
[2024-05-31 20:24:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:24:29] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-31 20:24:29] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-31 20:24:29] [INFO ] Invariant cache hit.
[2024-05-31 20:24:29] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-31 20:24:30] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/84 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 64 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1436 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 44/44 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/84 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 39/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 103 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 44/44 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
After SMT, in 2620ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2622ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2846 ms. Remains : 44/44 places, 40/40 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 (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 190 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2167 resets) in 177 ms. (224 steps per ms) remains 1/6 properties
BEST_FIRST walk for 33154 steps (263 resets) in 80 ms. (409 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 567 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5436 reset in 263 ms.
Stack based approach found an accepted trace after 14669 steps with 774 reset with depth 13 and stack size 13 in 42 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-13 finished in 6359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 103/103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 118 transition count 84
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 99 transition count 84
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 38 place count 99 transition count 67
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 82 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 81 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 81 transition count 66
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 96 place count 70 transition count 55
Applied a total of 96 rules in 18 ms. Remains 70 /118 variables (removed 48) and now considering 55/103 (removed 48) transitions.
// Phase 1: matrix 55 rows 70 cols
[2024-05-31 20:24:33] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 20:24:34] [INFO ] Implicit Places using invariants in 163 ms returned [9, 22, 23, 24, 25, 26, 27, 48, 61, 69]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 165 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/118 places, 55/103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 60 transition count 49
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 11 rules applied. Total rules applied 17 place count 54 transition count 44
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 22 place count 49 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 49 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 48 transition count 43
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 46 transition count 41
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 46 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 45 transition count 40
Applied a total of 30 rules in 11 ms. Remains 45 /60 variables (removed 15) and now considering 40/55 (removed 15) transitions.
// Phase 1: matrix 40 rows 45 cols
[2024-05-31 20:24:34] [INFO ] Computed 12 invariants in 0 ms
[2024-05-31 20:24:34] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 20:24:34] [INFO ] Invariant cache hit.
[2024-05-31 20:24:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 20:24:34] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/118 places, 40/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 383 ms. Remains : 45/118 places, 40/103 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-14
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-14 finished in 575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0)) U p1))))'
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 103/103 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 102
Applied a total of 2 rules in 4 ms. Remains 117 /118 variables (removed 1) and now considering 102/103 (removed 1) transitions.
// Phase 1: matrix 102 rows 117 cols
[2024-05-31 20:24:34] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 20:24:34] [INFO ] Implicit Places using invariants in 164 ms returned [32, 96, 106, 116]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 170 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/118 places, 102/103 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 100
Applied a total of 4 rules in 4 ms. Remains 111 /113 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 111 cols
[2024-05-31 20:24:34] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 20:24:34] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-31 20:24:34] [INFO ] Invariant cache hit.
[2024-05-31 20:24:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 20:24:34] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/118 places, 100/103 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 520 ms. Remains : 111/118 places, 100/103 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-15
Product exploration explored 100000 steps with 8682 reset in 335 ms.
Product exploration explored 100000 steps with 8507 reset in 419 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
RANDOM walk for 888 steps (30 resets) in 24 ms. (35 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR p1 (NOT p0)))), (F p0), (F p1)]
Knowledge based reduction with 3 factoid took 272 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
[2024-05-31 20:24:37] [INFO ] Invariant cache hit.
[2024-05-31 20:24:37] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-05-31 20:24:37] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-31 20:24:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:24:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-31 20:24:37] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-31 20:24:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 20:24:37] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:24:37] [INFO ] Computed and/alt/rep : 99/194/99 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-31 20:24:38] [INFO ] Added : 68 causal constraints over 15 iterations in 331 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-31 20:24:38] [INFO ] Invariant cache hit.
[2024-05-31 20:24:38] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-31 20:24:38] [INFO ] Invariant cache hit.
[2024-05-31 20:24:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 20:24:38] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2024-05-31 20:24:38] [INFO ] Invariant cache hit.
[2024-05-31 20:24:38] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/211 variables, 111/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4395 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 111/111 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/211 variables, 111/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 99/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 232 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3356 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 111/111 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 7790ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 7794ms
Finished structural reductions in LTL mode , in 1 iterations and 8163 ms. Remains : 111/111 places, 100/100 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
RANDOM walk for 768 steps (28 resets) in 7 ms. (96 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR p1 (NOT p0)))), (F p0), (F p1)]
Knowledge based reduction with 3 factoid took 286 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
[2024-05-31 20:24:47] [INFO ] Invariant cache hit.
[2024-05-31 20:24:47] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-31 20:24:47] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2024-05-31 20:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:24:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-31 20:24:48] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-31 20:24:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 20:24:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:24:48] [INFO ] Computed and/alt/rep : 99/194/99 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-31 20:24:48] [INFO ] Added : 68 causal constraints over 15 iterations in 306 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Product exploration explored 100000 steps with 8446 reset in 249 ms.
Product exploration explored 100000 steps with 8790 reset in 295 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 100/100 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 111 transition count 100
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 29 place count 111 transition count 100
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 39 place count 111 transition count 100
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 63 place count 87 transition count 76
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 87 place count 87 transition count 76
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 98 place count 87 transition count 76
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 98 rules in 24 ms. Remains 87 /111 variables (removed 24) and now considering 76/100 (removed 24) transitions.
[2024-05-31 20:24:49] [INFO ] Redundant transitions in 1 ms returned []
Running 75 sub problems to find dead transitions.
// Phase 1: matrix 76 rows 87 cols
[2024-05-31 20:24:49] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 20:24:49] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-31 20:24:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-31 20:24:50] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-31 20:24:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 20:24:50] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-31 20:24:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-31 20:24:50] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-31 20:24:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-31 20:24:50] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-31 20:24:50] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-31 20:24:51] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-31 20:24:51] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-31 20:24:51] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-05-31 20:24:51] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
[2024-05-31 20:24:51] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-31 20:24:51] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-31 20:24:51] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD74 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 16/34 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/34 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 76/163 variables, 87/121 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 22/143 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/143 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/143 constraints. Problems are: Problem set: 26 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 143 constraints, problems are : Problem set: 26 solved, 49 unsolved in 2912 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 87/87 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 26 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 27/87 variables, 18/18 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 16/34 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/34 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 76/163 variables, 87/121 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 22/143 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 49/192 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/192 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/192 constraints. Problems are: Problem set: 26 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 192 constraints, problems are : Problem set: 26 solved, 49 unsolved in 1375 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 87/87 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 49/75 constraints, Known Traps: 16/16 constraints]
After SMT, in 4307ms problems are : Problem set: 26 solved, 49 unsolved
Search for dead transitions found 26 dead transitions in 4309ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 87/111 places, 50/100 transitions.
Graph (complete) has 153 edges and 87 vertex of which 61 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 61 /87 variables (removed 26) and now considering 50/50 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/111 places, 50/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4354 ms. Remains : 61/111 places, 50/100 transitions.
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 111 cols
[2024-05-31 20:24:54] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 20:24:54] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-31 20:24:54] [INFO ] Invariant cache hit.
[2024-05-31 20:24:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 20:24:54] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2024-05-31 20:24:54] [INFO ] Invariant cache hit.
[2024-05-31 20:24:54] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/211 variables, 111/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3730 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 111/111 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/211 variables, 111/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 99/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 232 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4211 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 111/111 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 7967ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 7971ms
Finished structural reductions in LTL mode , in 1 iterations and 8238 ms. Remains : 111/111 places, 100/100 transitions.
Treatment of property AutoFlight-PT-05a-LTLFireability-15 finished in 27981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0)) U p1))))'
[2024-05-31 20:25:02] [INFO ] Flatten gal took : 17 ms
[2024-05-31 20:25:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-31 20:25:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 118 places, 103 transitions and 310 arcs took 5 ms.
Total runtime 43980 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutoFlight-PT-05a-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717187248232

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutoFlight-PT-05a-LTLFireability-15
ltl formula formula --ltl=/tmp/1207/ltl_0_
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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 118 places, 103 transitions and 310 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1207/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1207/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1207/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1207/ltl_0_
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): There are 120 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 119, there are 120 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~567 levels ~10000 states ~44664 transitions
pnml2lts-mc( 3/ 4): ~1899 levels ~20000 states ~85716 transitions
pnml2lts-mc( 3/ 4): ~3673 levels ~40000 states ~169264 transitions
pnml2lts-mc( 3/ 4): ~8183 levels ~80000 states ~350620 transitions
pnml2lts-mc( 3/ 4): ~15833 levels ~160000 states ~738640 transitions
pnml2lts-mc( 3/ 4): ~30258 levels ~320000 states ~1579352 transitions
pnml2lts-mc( 3/ 4): ~56328 levels ~640000 states ~3387652 transitions
pnml2lts-mc( 3/ 4): ~105134 levels ~1280000 states ~7274292 transitions
pnml2lts-mc( 3/ 4): ~197976 levels ~2560000 states ~15760344 transitions
pnml2lts-mc( 3/ 4): ~350938 levels ~5120000 states ~34219800 transitions
pnml2lts-mc( 3/ 4): ~623967 levels ~10240000 states ~74711300 transitions
pnml2lts-mc( 1/ 4): ~1057835 levels ~20480000 states ~160990280 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11639764
pnml2lts-mc( 0/ 4): unique states count: 32869806
pnml2lts-mc( 0/ 4): unique transitions count: 281187059
pnml2lts-mc( 0/ 4): - self-loop count: 10
pnml2lts-mc( 0/ 4): - claim dead count: 89450753
pnml2lts-mc( 0/ 4): - claim found count: 137479311
pnml2lts-mc( 0/ 4): - claim success count: 32869865
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5947572
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32869875 states 281187531 transitions, fanout: 8.555
pnml2lts-mc( 0/ 4): Total exploration time 144.710 sec (144.690 sec minimum, 144.700 sec on average)
pnml2lts-mc( 0/ 4): States per second: 227143, Transitions per second: 1943110
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 269.7MB, 8.4 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/21.0%
pnml2lts-mc( 0/ 4): Stored 103 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 269.7MB (~256.0MB paged-in)

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-05a"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-05a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167000124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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