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.r026-smll-171620166900068.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 itstools
Input is AutoFlight-PT-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620166900068
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716243709904

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-20 22:21:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 22:21:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:21:52] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-05-20 22:21:52] [INFO ] Transformed 114 places.
[2024-05-20 22:21:52] [INFO ] Transformed 112 transitions.
[2024-05-20 22:21:52] [INFO ] Found NUPN structural information;
[2024-05-20 22:21:52] [INFO ] Parsed PT model containing 114 places and 112 transitions and 264 arcs in 339 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA AutoFlight-PT-01b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 105 transition count 103
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 105 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 105 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 103 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 103 transition count 100
Applied a total of 23 rules in 52 ms. Remains 103 /114 variables (removed 11) and now considering 100/112 (removed 12) transitions.
// Phase 1: matrix 100 rows 103 cols
[2024-05-20 22:21:52] [INFO ] Computed 10 invariants in 25 ms
[2024-05-20 22:21:53] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-20 22:21:53] [INFO ] Invariant cache hit.
[2024-05-20 22:21:53] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2024-05-20 22:21:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-20 22:21:54] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 13 ms to minimize.
[2024-05-20 22:21:55] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 3 ms to minimize.
[2024-05-20 22:21:55] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-20 22:21:55] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:21:55] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 3 ms to minimize.
[2024-05-20 22:21:55] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 3 ms to minimize.
[2024-05-20 22:21:55] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-20 22:21:55] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-20 22:21:55] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-20 22:21:55] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-20 22:21:55] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:21:55] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 3 ms to minimize.
[2024-05-20 22:21:56] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 4 ms to minimize.
[2024-05-20 22:21:56] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:21:56] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-20 22:21:56] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-20 22:21:56] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
[2024-05-20 22:21:56] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
[2024-05-20 22:21:56] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-05-20 22:21:56] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-20 22:21:57] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-20 22:21:57] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 100/203 variables, 103/135 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-20 22:21:58] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-20 22:21:59] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 137 constraints, problems are : Problem set: 0 solved, 99 unsolved in 7710 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 100/203 variables, 103/137 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 99/236 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-20 22:22:02] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-20 22:22:02] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-20 22:22:02] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 2 ms to minimize.
[2024-05-20 22:22:03] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-20 22:22:03] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-20 22:22:04] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-05-20 22:22:05] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 243 constraints, problems are : Problem set: 0 solved, 99 unsolved in 8450 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 31/31 constraints]
After SMT, in 16291ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 16327ms
Starting structural reductions in LTL mode, iteration 1 : 103/114 places, 100/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16997 ms. Remains : 103/114 places, 100/112 transitions.
Support contains 29 out of 103 places after structural reductions.
[2024-05-20 22:22:10] [INFO ] Flatten gal took : 40 ms
[2024-05-20 22:22:10] [INFO ] Flatten gal took : 15 ms
[2024-05-20 22:22:10] [INFO ] Input system was already deterministic with 100 transitions.
Support contains 28 out of 103 places (down from 29) after GAL structural reductions.
RANDOM walk for 40000 steps (596 resets) in 1151 ms. (34 steps per ms) remains 5/24 properties
BEST_FIRST walk for 40004 steps (110 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (107 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (121 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (111 resets) in 141 ms. (281 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (132 resets) in 92 ms. (430 steps per ms) remains 2/4 properties
[2024-05-20 22:22:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/96 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/103 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 100/203 variables, 103/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/203 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 113 constraints, problems are : Problem set: 0 solved, 2 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/96 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 22:22:11] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/103 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 22:22:11] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
[2024-05-20 22:22:11] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
[2024-05-20 22:22:11] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 7 ms to minimize.
[2024-05-20 22:22:11] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 100/203 variables, 103/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 22:22:11] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 22:22:11] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/203 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 122 constraints, problems are : Problem set: 0 solved, 2 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 620ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 27 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 100/100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 103 transition count 68
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 68 place count 71 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 69 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 70 place count 69 transition count 48
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 102 place count 53 transition count 48
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 105 place count 50 transition count 45
Iterating global reduction 3 with 3 rules applied. Total rules applied 108 place count 50 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 108 place count 50 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 49 transition count 44
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 142 place count 33 transition count 26
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 33 transition count 22
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 150 place count 29 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 28 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 152 place count 27 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 152 place count 27 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 154 place count 26 transition count 20
Applied a total of 154 rules in 56 ms. Remains 26 /103 variables (removed 77) and now considering 20/100 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 26/103 places, 20/100 transitions.
RANDOM walk for 40000 steps (8 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Probably explored full state space saw : 79 states, properties seen :0
Probabilistic random walk after 208 steps, saw 79 distinct states, run finished after 12 ms. (steps per millisecond=17 ) properties seen :0
Explored full state space saw : 79 states, properties seen :0
Exhaustive walk after 208 steps, saw 79 distinct states, run finished after 2 ms. (steps per millisecond=104 ) properties seen :0
FORMULA AutoFlight-PT-01b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA AutoFlight-PT-01b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32 stabilizing places and 32 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G((p1||F((G(p2)||(p2&&F(!p3))))))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 96 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 93 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 93 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 92 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 92 transition count 88
Applied a total of 23 rules in 25 ms. Remains 92 /103 variables (removed 11) and now considering 88/100 (removed 12) transitions.
// Phase 1: matrix 88 rows 92 cols
[2024-05-20 22:22:12] [INFO ] Computed 10 invariants in 3 ms
[2024-05-20 22:22:12] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-20 22:22:12] [INFO ] Invariant cache hit.
[2024-05-20 22:22:12] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-20 22:22:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-20 22:22:12] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-20 22:22:12] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 3 ms to minimize.
[2024-05-20 22:22:12] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:22:12] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:22:13] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-20 22:22:13] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-20 22:22:13] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
[2024-05-20 22:22:13] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:22:13] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 88/180 variables, 92/111 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 111 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3060 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-20 22:22:15] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
[2024-05-20 22:22:15] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-20 22:22:15] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 88/180 variables, 92/114 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 87/201 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-20 22:22:16] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 3 ms to minimize.
[2024-05-20 22:22:16] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-20 22:22:19] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/180 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/180 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 204 constraints, problems are : Problem set: 0 solved, 87 unsolved in 7872 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 15/15 constraints]
After SMT, in 10951ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 10954ms
Starting structural reductions in LTL mode, iteration 1 : 92/103 places, 88/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11121 ms. Remains : 92/103 places, 88/100 transitions.
Stuttering acceptance computed with spot in 687 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) p3), (NOT p2), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 483 ms.
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/92 stabilizing places and 24/88 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p3) p0), (X p2), (X (NOT p3)), (X (NOT (OR (AND p1 p3 (NOT p0)) (AND (NOT p2) p3 (NOT p0))))), (X (NOT (AND p1 p2 p3 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 34 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-01b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-01b-LTLFireability-00 finished in 12730 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(((p1||F(p2)||X(F((p1&&F(p3)))))&&p0)))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 98 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 96 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 96 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 95 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 95 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 94 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 94 transition count 90
Applied a total of 19 rules in 23 ms. Remains 94 /103 variables (removed 9) and now considering 90/100 (removed 10) transitions.
// Phase 1: matrix 90 rows 94 cols
[2024-05-20 22:22:24] [INFO ] Computed 10 invariants in 3 ms
[2024-05-20 22:22:24] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-20 22:22:24] [INFO ] Invariant cache hit.
[2024-05-20 22:22:24] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-20 22:22:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:22:25] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-20 22:22:25] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-05-20 22:22:25] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 3 ms to minimize.
[2024-05-20 22:22:25] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:22:25] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:22:25] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:22:26] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-20 22:22:26] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:22:26] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-20 22:22:26] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:22:26] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:22:27] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-20 22:22:27] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:22:27] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/184 variables, 94/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 118 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4715 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/184 variables, 94/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 89/207 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:22:31] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:22:31] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:22:31] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:22:32] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
[2024-05-20 22:22:32] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-20 22:22:32] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-20 22:22:32] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:22:33] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:22:36] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/184 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (OVERLAPS) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 216 constraints, problems are : Problem set: 0 solved, 89 unsolved in 11065 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 23/23 constraints]
After SMT, in 15807ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 15811ms
Starting structural reductions in LTL mode, iteration 1 : 94/103 places, 90/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16058 ms. Remains : 94/103 places, 90/100 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-03 finished in 16278 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)))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 102 transition count 68
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 66 place count 71 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 69 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 68 place count 69 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 100 place count 53 transition count 48
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 50 transition count 45
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 50 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 106 place count 50 transition count 44
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 49 transition count 44
Performed 18 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 144 place count 31 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 30 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 29 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 146 place count 29 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 28 transition count 22
Applied a total of 148 rules in 17 ms. Remains 28 /103 variables (removed 75) and now considering 22/100 (removed 78) transitions.
// Phase 1: matrix 22 rows 28 cols
[2024-05-20 22:22:40] [INFO ] Computed 9 invariants in 1 ms
[2024-05-20 22:22:40] [INFO ] Implicit Places using invariants in 42 ms returned [11, 16, 21, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/103 places, 22/100 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 22 transition count 20
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 21 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 20 transition count 18
Applied a total of 8 rules in 4 ms. Remains 20 /24 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-20 22:22:40] [INFO ] Computed 5 invariants in 1 ms
[2024-05-20 22:22:41] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-20 22:22:41] [INFO ] Invariant cache hit.
[2024-05-20 22:22:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 22:22:41] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/103 places, 18/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 134 ms. Remains : 20/103 places, 18/100 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-04
Product exploration explored 100000 steps with 12243 reset in 390 ms.
Product exploration explored 100000 steps with 12225 reset in 234 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 112 steps (12 resets) in 6 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-20 22:22:42] [INFO ] Invariant cache hit.
[2024-05-20 22:22:42] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-20 22:22:42] [INFO ] Invariant cache hit.
[2024-05-20 22:22:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 22:22:42] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-20 22:22:42] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-20 22:22:42] [INFO ] Invariant cache hit.
[2024-05-20 22:22:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-20 22:22:42] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 18/38 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 27 constraints, problems are : Problem set: 0 solved, 11 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 18/38 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 38 constraints, problems are : Problem set: 0 solved, 11 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 471ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 471ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 593 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 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 150 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 85 steps (8 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12155 reset in 138 ms.
Product exploration explored 100000 steps with 12240 reset in 156 ms.
Built C files in :
/tmp/ltsmin6543138017062378711
[2024-05-20 22:22:43] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-20 22:22:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:22:43] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-20 22:22:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:22:43] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-20 22:22:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:22:43] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6543138017062378711
Running compilation step : cd /tmp/ltsmin6543138017062378711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 526 ms.
Running link step : cd /tmp/ltsmin6543138017062378711;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin6543138017062378711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4758319190734356117.hoa' '--buchi-type=spotba'
LTSmin run took 144 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-01b-LTLFireability-04 finished in 3666 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((p0&&F(p1))))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 96 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 93 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 93 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 92 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 92 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 91 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 91 transition count 87
Applied a total of 25 rules in 19 ms. Remains 91 /103 variables (removed 12) and now considering 87/100 (removed 13) transitions.
// Phase 1: matrix 87 rows 91 cols
[2024-05-20 22:22:44] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 22:22:44] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-20 22:22:44] [INFO ] Invariant cache hit.
[2024-05-20 22:22:44] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-20 22:22:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:22:45] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 22:22:45] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-05-20 22:22:45] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:22:45] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-20 22:22:45] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-20 22:22:45] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-20 22:22:45] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-20 22:22:46] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/178 variables, 91/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 109 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3173 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:22:48] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:22:49] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 87/178 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 86/197 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:22:50] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-20 22:22:50] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-05-20 22:22:50] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:22:52] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/178 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/178 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 201 constraints, problems are : Problem set: 0 solved, 86 unsolved in 8168 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 14/14 constraints]
After SMT, in 11358ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 11360ms
Starting structural reductions in LTL mode, iteration 1 : 91/103 places, 87/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11623 ms. Remains : 91/103 places, 87/100 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-07
Product exploration explored 100000 steps with 2727 reset in 177 ms.
Product exploration explored 100000 steps with 2714 reset in 248 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
RANDOM walk for 1525 steps (21 resets) in 13 ms. (108 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
[2024-05-20 22:22:58] [INFO ] Invariant cache hit.
[2024-05-20 22:22:58] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-20 22:22:58] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 22:22:58] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-20 22:22:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:22:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-20 22:22:58] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 22:22:58] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-20 22:22:58] [INFO ] Computed and/alt/rep : 86/125/86 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-20 22:22:58] [INFO ] Added : 86 causal constraints over 18 iterations in 324 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-20 22:22:58] [INFO ] Invariant cache hit.
[2024-05-20 22:22:58] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-20 22:22:58] [INFO ] Invariant cache hit.
[2024-05-20 22:22:58] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-20 22:22:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:22:59] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-20 22:22:59] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2024-05-20 22:22:59] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2024-05-20 22:22:59] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-20 22:22:59] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-20 22:22:59] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-20 22:22:59] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-20 22:23:00] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/178 variables, 91/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 109 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3384 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:23:03] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:23:03] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 87/178 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 86/197 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:23:04] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 6 ms to minimize.
[2024-05-20 22:23:04] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:23:04] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:23:07] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/178 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/178 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 201 constraints, problems are : Problem set: 0 solved, 86 unsolved in 8364 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 14/14 constraints]
After SMT, in 11767ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 11770ms
Finished structural reductions in LTL mode , in 1 iterations and 11992 ms. Remains : 91/91 places, 87/87 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
RANDOM walk for 796 steps (10 resets) in 8 ms. (88 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 232 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
[2024-05-20 22:23:11] [INFO ] Invariant cache hit.
[2024-05-20 22:23:11] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-20 22:23:11] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 22:23:12] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-20 22:23:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:23:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-20 22:23:12] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 22:23:12] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-20 22:23:12] [INFO ] Computed and/alt/rep : 86/125/86 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-20 22:23:12] [INFO ] Added : 86 causal constraints over 18 iterations in 289 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 2744 reset in 154 ms.
Product exploration explored 100000 steps with 2737 reset in 185 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 87/87 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 91 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 91 transition count 86
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 26 place count 91 transition count 86
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 40 place count 91 transition count 86
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 59 place count 72 transition count 67
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 78 place count 72 transition count 67
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 97 place count 72 transition count 65
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 107 place count 62 transition count 55
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 117 place count 62 transition count 55
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 117 rules in 35 ms. Remains 62 /91 variables (removed 29) and now considering 55/87 (removed 32) transitions.
[2024-05-20 22:23:13] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
// Phase 1: matrix 55 rows 62 cols
[2024-05-20 22:23:13] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 22:23:13] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-20 22:23:14] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 2 ms to minimize.
[2024-05-20 22:23:14] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 2 ms to minimize.
[2024-05-20 22:23:14] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-20 22:23:14] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
[2024-05-20 22:23:14] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-05-20 22:23:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-20 22:23:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-20 22:23:14] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-20 22:23:14] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 9/19 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/19 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 55/117 variables, 62/81 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 5/86 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/86 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/86 constraints. Problems are: Problem set: 29 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 86 constraints, problems are : Problem set: 29 solved, 25 unsolved in 1717 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 29 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 27/59 variables, 8/8 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 9/17 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 3/62 variables, 2/19 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/19 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 55/117 variables, 62/81 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 5/86 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 25/111 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/111 constraints. Problems are: Problem set: 29 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 0/117 variables, 0/111 constraints. Problems are: Problem set: 29 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 111 constraints, problems are : Problem set: 29 solved, 25 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 25/54 constraints, Known Traps: 9/9 constraints]
After SMT, in 2668ms problems are : Problem set: 29 solved, 25 unsolved
Search for dead transitions found 29 dead transitions in 2670ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/91 places, 26/87 transitions.
Graph (complete) has 77 edges and 62 vertex of which 33 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 33 /62 variables (removed 29) and now considering 26/26 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/91 places, 26/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2720 ms. Remains : 33/91 places, 26/87 transitions.
Built C files in :
/tmp/ltsmin5525794342392101969
[2024-05-20 22:23:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5525794342392101969
Running compilation step : cd /tmp/ltsmin5525794342392101969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 433 ms.
Running link step : cd /tmp/ltsmin5525794342392101969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin5525794342392101969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2929333587872727081.hoa' '--buchi-type=spotba'
LTSmin run took 12728 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-01b-LTLFireability-07 finished in 45074 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)||F(p1)))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (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 30 rules applied. Total rules applied 30 place count 102 transition count 69
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 64 place count 72 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 70 transition count 65
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 66 place count 70 transition count 49
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 98 place count 54 transition count 49
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 50 transition count 45
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 50 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 106 place count 50 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 48 transition count 43
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 144 place count 31 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 31 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 146 place count 30 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 147 place count 29 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 147 place count 29 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 149 place count 28 transition count 22
Applied a total of 149 rules in 13 ms. Remains 28 /103 variables (removed 75) and now considering 22/100 (removed 78) transitions.
// Phase 1: matrix 22 rows 28 cols
[2024-05-20 22:23:29] [INFO ] Computed 9 invariants in 0 ms
[2024-05-20 22:23:29] [INFO ] Implicit Places using invariants in 39 ms returned [11, 16, 21, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 40 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/103 places, 22/100 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 22 transition count 20
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 21 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 20 transition count 18
Applied a total of 8 rules in 3 ms. Remains 20 /24 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-20 22:23:29] [INFO ] Computed 5 invariants in 0 ms
[2024-05-20 22:23:29] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-20 22:23:29] [INFO ] Invariant cache hit.
[2024-05-20 22:23:29] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/103 places, 18/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 20/103 places, 18/100 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-09
Stuttering criterion allowed to conclude after 46 steps with 3 reset in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-09 finished in 198 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((p0&&G(p1))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 95
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 95 transition count 92
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 95 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 94 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 94 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 93 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 93 transition count 90
Applied a total of 20 rules in 7 ms. Remains 93 /103 variables (removed 10) and now considering 90/100 (removed 10) transitions.
// Phase 1: matrix 90 rows 93 cols
[2024-05-20 22:23:29] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:23:29] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-20 22:23:29] [INFO ] Invariant cache hit.
[2024-05-20 22:23:30] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-20 22:23:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:23:30] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-05-20 22:23:30] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
[2024-05-20 22:23:30] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:23:31] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-20 22:23:31] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:23:31] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:23:31] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-20 22:23:31] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
[2024-05-20 22:23:31] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-20 22:23:31] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:23:32] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:23:32] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:23:32] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-20 22:23:32] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-20 22:23:32] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/183 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:23:33] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:23:34] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 2 ms to minimize.
[2024-05-20 22:23:34] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
[2024-05-20 22:23:34] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 122 constraints, problems are : Problem set: 0 solved, 89 unsolved in 6540 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/183 variables, 93/122 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 89/211 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:23:38] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-20 22:23:38] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:23:40] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/183 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 214 constraints, problems are : Problem set: 0 solved, 89 unsolved in 7500 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 22/22 constraints]
After SMT, in 14053ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 14054ms
Starting structural reductions in LTL mode, iteration 1 : 93/103 places, 90/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14201 ms. Remains : 93/103 places, 90/100 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-12 finished in 14365 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(((G(p0)||(p1&&F(p0))) U p2))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 102 transition count 71
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 60 place count 74 transition count 67
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 72 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 71 transition count 66
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 64 place count 71 transition count 49
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 98 place count 54 transition count 49
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 52 transition count 47
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 52 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 102 place count 52 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 51 transition count 46
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 138 place count 34 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 33 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 32 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 140 place count 32 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 31 transition count 25
Applied a total of 142 rules in 25 ms. Remains 31 /103 variables (removed 72) and now considering 25/100 (removed 75) transitions.
// Phase 1: matrix 25 rows 31 cols
[2024-05-20 22:23:44] [INFO ] Computed 9 invariants in 1 ms
[2024-05-20 22:23:44] [INFO ] Implicit Places using invariants in 57 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/103 places, 25/100 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 22
Applied a total of 6 rules in 3 ms. Remains 27 /30 variables (removed 3) and now considering 22/25 (removed 3) transitions.
// Phase 1: matrix 22 rows 27 cols
[2024-05-20 22:23:44] [INFO ] Computed 8 invariants in 0 ms
[2024-05-20 22:23:44] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-20 22:23:44] [INFO ] Invariant cache hit.
[2024-05-20 22:23:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-20 22:23:44] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/103 places, 22/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 215 ms. Remains : 27/103 places, 22/100 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-13
Stuttering criterion allowed to conclude after 21 steps with 2 reset in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-13 finished in 519 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(p0)&&(X(p1) U ((p2&&X(p1))||X(G(p1))))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 97 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 95 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 95 transition count 91
Applied a total of 17 rules in 13 ms. Remains 95 /103 variables (removed 8) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 95 cols
[2024-05-20 22:23:44] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:23:44] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-20 22:23:44] [INFO ] Invariant cache hit.
[2024-05-20 22:23:45] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-05-20 22:23:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:23:45] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:23:46] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-20 22:23:46] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:23:46] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:23:46] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-20 22:23:46] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:23:46] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/186 variables, 95/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:23:48] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:23:48] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:23:49] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 115 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5939 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:23:51] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-20 22:23:51] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:23:51] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-20 22:23:51] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/186 variables, 95/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 90/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:23:53] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-05-20 22:23:53] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:23:54] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 7053 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 17/17 constraints]
After SMT, in 13009ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 13011ms
Starting structural reductions in LTL mode, iteration 1 : 95/103 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13254 ms. Remains : 95/103 places, 91/100 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-14
Product exploration explored 100000 steps with 11963 reset in 129 ms.
Product exploration explored 100000 steps with 12068 reset in 154 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Computed a total of 27 stabilizing places and 27 stable transitions
Detected a total of 27/95 stabilizing places and 27/91 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 1568 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 49 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 14 factoid took 2006 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2024-05-20 22:24:02] [INFO ] Invariant cache hit.
[2024-05-20 22:24:02] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-20 22:24:02] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 22:24:02] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-20 22:24:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:24:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-20 22:24:02] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 22:24:02] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-20 22:24:02] [INFO ] Computed and/alt/rep : 90/129/90 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-20 22:24:02] [INFO ] Added : 82 causal constraints over 17 iterations in 268 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 95 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 94 transition count 66
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 70 transition count 63
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 68 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 67 transition count 62
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 55 place count 67 transition count 45
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 89 place count 50 transition count 45
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 121 place count 34 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 33 transition count 26
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 125 place count 31 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 126 place count 30 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 126 place count 30 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 128 place count 29 transition count 24
Applied a total of 128 rules in 19 ms. Remains 29 /95 variables (removed 66) and now considering 24/91 (removed 67) transitions.
// Phase 1: matrix 24 rows 29 cols
[2024-05-20 22:24:02] [INFO ] Computed 8 invariants in 1 ms
[2024-05-20 22:24:02] [INFO ] Implicit Places using invariants in 53 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/95 places, 24/91 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 25 transition count 21
Applied a total of 6 rules in 1 ms. Remains 25 /28 variables (removed 3) and now considering 21/24 (removed 3) transitions.
// Phase 1: matrix 21 rows 25 cols
[2024-05-20 22:24:02] [INFO ] Computed 7 invariants in 1 ms
[2024-05-20 22:24:02] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-20 22:24:02] [INFO ] Invariant cache hit.
[2024-05-20 22:24:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-20 22:24:03] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/95 places, 21/91 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 25/95 places, 21/91 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/25 stabilizing places and 6/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 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 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 266 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
[2024-05-20 22:24:03] [INFO ] Invariant cache hit.
[2024-05-20 22:24:03] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-20 22:24:03] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-20 22:24:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:24:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-20 22:24:03] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-20 22:24:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-20 22:24:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-20 22:24:03] [INFO ] Computed and/alt/rep : 16/33/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-20 22:24:03] [INFO ] Added : 11 causal constraints over 3 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20792 reset in 121 ms.
Stack based approach found an accepted trace after 1438 steps with 284 reset with depth 5 and stack size 5 in 2 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-14 finished in 19477 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(p0))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (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 30 rules applied. Total rules applied 30 place count 102 transition count 69
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 72 transition count 68
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 61 place count 72 transition count 51
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 95 place count 55 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 50 transition count 46
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 50 transition count 46
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 105 place count 50 transition count 43
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 111 place count 47 transition count 43
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 145 place count 30 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 29 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 147 place count 28 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 147 place count 28 transition count 22
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 27 transition count 22
Applied a total of 149 rules in 17 ms. Remains 27 /103 variables (removed 76) and now considering 22/100 (removed 78) transitions.
// Phase 1: matrix 22 rows 27 cols
[2024-05-20 22:24:04] [INFO ] Computed 9 invariants in 1 ms
[2024-05-20 22:24:04] [INFO ] Implicit Places using invariants in 59 ms returned [10, 15, 20, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 61 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/103 places, 22/100 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 21 transition count 20
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 21 transition count 20
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 20 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 20 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 19 transition count 18
Applied a total of 8 rules in 4 ms. Remains 19 /23 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-20 22:24:04] [INFO ] Computed 5 invariants in 0 ms
[2024-05-20 22:24:04] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-20 22:24:04] [INFO ] Invariant cache hit.
[2024-05-20 22:24:04] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/103 places, 18/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 19/103 places, 18/100 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-15
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-15 finished in 243 ms.
All properties solved by simple procedures.
Total runtime 132185 ms.

BK_STOP 1716243844547

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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