Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 22:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 48K 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-02b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717183066179

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:17:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:17:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:17:49] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2024-05-31 19:17:49] [INFO ] Transformed 206 places.
[2024-05-31 19:17:49] [INFO ] Transformed 204 transitions.
[2024-05-31 19:17:49] [INFO ] Found NUPN structural information;
[2024-05-31 19:17:49] [INFO ] Parsed PT model containing 206 places and 204 transitions and 478 arcs in 395 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-02b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 204/204 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 184 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 184 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 184 transition count 179
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 174 transition count 169
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 174 transition count 169
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 173 transition count 168
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 173 transition count 168
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 172 transition count 167
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 172 transition count 167
Applied a total of 71 rules in 163 ms. Remains 172 /206 variables (removed 34) and now considering 167/204 (removed 37) transitions.
// Phase 1: matrix 167 rows 172 cols
[2024-05-31 19:17:49] [INFO ] Computed 16 invariants in 34 ms
[2024-05-31 19:17:50] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-31 19:17:50] [INFO ] Invariant cache hit.
[2024-05-31 19:17:50] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-31 19:17:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:17:53] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 45 ms to minimize.
[2024-05-31 19:17:53] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 4 ms to minimize.
[2024-05-31 19:17:54] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 4 ms to minimize.
[2024-05-31 19:17:54] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 4 ms to minimize.
[2024-05-31 19:17:54] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:17:54] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:17:54] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:17:54] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 3 ms to minimize.
[2024-05-31 19:17:54] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:17:55] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:17:55] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-31 19:17:55] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:17:55] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:17:55] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:17:55] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-05-31 19:17:55] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:17:55] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:17:56] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:17:56] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:17:56] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:17:57] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:17:57] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 3 ms to minimize.
[2024-05-31 19:17:57] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
[2024-05-31 19:17:57] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:17:59] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:17:59] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-31 19:17:59] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:18:00] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 3 ms to minimize.
[2024-05-31 19:18:01] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 3 ms to minimize.
[2024-05-31 19:18:01] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:18:01] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:18:01] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:18:01] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:18:01] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 3 ms to minimize.
[2024-05-31 19:18:01] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:18:01] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 3 ms to minimize.
[2024-05-31 19:18:01] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:18:01] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:18:04] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:18:04] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:18:05] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:18:06] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:18:06] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 3 ms to minimize.
[2024-05-31 19:18:07] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-31 19:18:07] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:18:07] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:18:09] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:18:09] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-31 19:18:10] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:18:10] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:18:11] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:18:12] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:18:12] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:18:14] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 15 (OVERLAPS) 167/339 variables, 172/242 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:18:19] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/339 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 339/339 variables, and 243 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/339 variables, 172/243 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 166/409 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:18:24] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:18:24] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 4 ms to minimize.
[2024-05-31 19:18:24] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 3 ms to minimize.
[2024-05-31 19:18:25] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 3 ms to minimize.
[2024-05-31 19:18:25] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 5/414 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:18:28] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:18:32] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-31 19:18:32] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (OVERLAPS) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 417 constraints, problems are : Problem set: 0 solved, 166 unsolved in 25368 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 63/63 constraints]
After SMT, in 55530ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 55569ms
Starting structural reductions in LTL mode, iteration 1 : 172/206 places, 167/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56717 ms. Remains : 172/206 places, 167/204 transitions.
Support contains 22 out of 172 places after structural reductions.
[2024-05-31 19:18:46] [INFO ] Flatten gal took : 54 ms
[2024-05-31 19:18:46] [INFO ] Flatten gal took : 34 ms
[2024-05-31 19:18:46] [INFO ] Input system was already deterministic with 167 transitions.
Support contains 20 out of 172 places (down from 22) after GAL structural reductions.
RANDOM walk for 39484 steps (345 resets) in 1031 ms. (38 steps per ms) remains 0/11 properties
FORMULA AutoFlight-PT-02b-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 43 stabilizing places and 43 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(F((G(F((G(F(p0))||(!p1&&F(p0)))))||((!p0||G(!p1))&&F((G(F(p0))||(!p1&&F(p0)))))))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 167/167 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 165 transition count 160
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 165 transition count 160
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 165 transition count 159
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 163 transition count 157
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 163 transition count 157
Applied a total of 19 rules in 20 ms. Remains 163 /172 variables (removed 9) and now considering 157/167 (removed 10) transitions.
// Phase 1: matrix 157 rows 163 cols
[2024-05-31 19:18:47] [INFO ] Computed 16 invariants in 4 ms
[2024-05-31 19:18:47] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-31 19:18:47] [INFO ] Invariant cache hit.
[2024-05-31 19:18:47] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-05-31 19:18:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-31 19:18:49] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 4 ms to minimize.
[2024-05-31 19:18:49] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
[2024-05-31 19:18:49] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:18:49] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:18:49] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2024-05-31 19:18:50] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 2 ms to minimize.
[2024-05-31 19:18:50] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-31 19:18:50] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:18:50] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-31 19:18:50] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 2 ms to minimize.
[2024-05-31 19:18:50] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
[2024-05-31 19:18:50] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-31 19:18:50] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-31 19:18:50] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-31 19:18:50] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-05-31 19:18:51] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-31 19:18:52] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 157/320 variables, 163/196 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 196 constraints, problems are : Problem set: 0 solved, 156 unsolved in 11494 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-31 19:19:00] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:19:01] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:19:01] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 157/320 variables, 163/199 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 156/355 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-31 19:19:03] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-31 19:19:03] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-31 19:19:03] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:19:03] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-05-31 19:19:03] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
[2024-05-31 19:19:04] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:19:04] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:19:04] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 3 ms to minimize.
[2024-05-31 19:19:05] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 9/364 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-31 19:19:07] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-31 19:19:11] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 12 (OVERLAPS) 0/320 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 366 constraints, problems are : Problem set: 0 solved, 156 unsolved in 22887 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 31/31 constraints]
After SMT, in 34412ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 34416ms
Starting structural reductions in LTL mode, iteration 1 : 163/172 places, 157/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34759 ms. Remains : 163/172 places, 157/167 transitions.
Stuttering acceptance computed with spot in 546 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-00
Product exploration explored 100000 steps with 1082 reset in 728 ms.
Product exploration explored 100000 steps with 1094 reset in 478 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Computed a total of 41 stabilizing places and 41 stable transitions
Detected a total of 41/163 stabilizing places and 41/157 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 241 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 25 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 550 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1), false]
RANDOM walk for 32440 steps (284 resets) in 509 ms. (63 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 822 ms. Reduced automaton from 9 states, 25 edges and 2 AP (stutter insensitive) to 9 states, 25 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 475 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 495 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1), false]
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 157/157 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 162 transition count 105
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 57 rules applied. Total rules applied 108 place count 111 transition count 99
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 112 place count 107 transition count 99
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 112 place count 107 transition count 77
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 156 place count 85 transition count 77
Performed 28 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 212 place count 57 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 56 transition count 44
Applied a total of 213 rules in 57 ms. Remains 56 /163 variables (removed 107) and now considering 44/157 (removed 113) transitions.
// Phase 1: matrix 44 rows 56 cols
[2024-05-31 19:19:26] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:19:26] [INFO ] Implicit Places using invariants in 99 ms returned [26, 34, 42, 48, 55]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 104 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/163 places, 44/157 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 48 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 48 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 47 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 47 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 46 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 46 transition count 39
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 12 place count 45 transition count 38
Applied a total of 12 rules in 14 ms. Remains 45 /51 variables (removed 6) and now considering 38/44 (removed 6) transitions.
// Phase 1: matrix 38 rows 45 cols
[2024-05-31 19:19:26] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 19:19:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 19:19:26] [INFO ] Invariant cache hit.
[2024-05-31 19:19:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 19:19:26] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 195 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/163 places, 38/157 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 44 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 37
Applied a total of 2 rules in 6 ms. Remains 43 /44 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 43 cols
[2024-05-31 19:19:26] [INFO ] Computed 10 invariants in 3 ms
[2024-05-31 19:19:27] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 19:19:27] [INFO ] Invariant cache hit.
[2024-05-31 19:19:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:19:27] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 43/163 places, 37/157 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 568 ms. Remains : 43/163 places, 37/157 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/43 stabilizing places and 4/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 841 ms. Reduced automaton from 9 states, 25 edges and 2 AP (stutter insensitive) to 9 states, 25 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 456 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
RANDOM walk for 593 steps (28 resets) in 13 ms. (42 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 1227 ms. Reduced automaton from 9 states, 25 edges and 2 AP (stutter insensitive) to 9 states, 25 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 442 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 459 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 467 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 5978 reset in 242 ms.
Product exploration explored 100000 steps with 5956 reset in 407 ms.
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 37/37 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2024-05-31 19:19:31] [INFO ] Invariant cache hit.
[2024-05-31 19:19:31] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-31 19:19:31] [INFO ] Invariant cache hit.
[2024-05-31 19:19:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:19:32] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-31 19:19:32] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-31 19:19:32] [INFO ] Invariant cache hit.
[2024-05-31 19:19:32] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/43 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-31 19:19:32] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 37/80 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/80 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 61 constraints, problems are : Problem set: 0 solved, 32 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/43 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-31 19:19:33] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 37/80 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 32/94 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/80 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 94 constraints, problems are : Problem set: 0 solved, 32 unsolved in 954 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 2/2 constraints]
After SMT, in 1931ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1933ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2157 ms. Remains : 43/43 places, 37/37 transitions.
Treatment of property AutoFlight-PT-02b-LTLCardinality-00 finished in 46915 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)||G(p1)))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 167/167 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 166 transition count 161
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 166 transition count 161
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 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 164 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 164 transition count 158
Applied a total of 17 rules in 10 ms. Remains 164 /172 variables (removed 8) and now considering 158/167 (removed 9) transitions.
// Phase 1: matrix 158 rows 164 cols
[2024-05-31 19:19:34] [INFO ] Computed 16 invariants in 5 ms
[2024-05-31 19:19:34] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 19:19:34] [INFO ] Invariant cache hit.
[2024-05-31 19:19:34] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-31 19:19:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:19:36] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 3 ms to minimize.
[2024-05-31 19:19:36] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:19:36] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:19:36] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:19:36] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:19:36] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:19:37] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:19:37] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:19:37] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:19:37] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:19:37] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:19:37] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:19:37] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:19:37] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-31 19:19:37] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
[2024-05-31 19:19:37] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:19:38] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:19:38] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:19:38] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 158/322 variables, 164/199 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:19:41] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 3 ms to minimize.
[2024-05-31 19:19:41] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
[2024-05-31 19:19:41] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 0/322 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 202 constraints, problems are : Problem set: 0 solved, 157 unsolved in 12793 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:19:48] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/322 variables, 164/203 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 157/360 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:19:51] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-05-31 19:19:51] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:19:51] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-31 19:19:52] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-05-31 19:19:52] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 3 ms to minimize.
[2024-05-31 19:19:53] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:19:55] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/322 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 367 constraints, problems are : Problem set: 0 solved, 157 unsolved in 16355 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 30/30 constraints]
After SMT, in 29183ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 29188ms
Starting structural reductions in LTL mode, iteration 1 : 164/172 places, 158/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29603 ms. Remains : 164/172 places, 158/167 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 72 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-02b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLCardinality-02 finished in 29883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 171 transition count 111
Reduce places removed 55 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 58 rules applied. Total rules applied 113 place count 116 transition count 108
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 116 place count 114 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 113 transition count 107
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 117 place count 113 transition count 83
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 165 place count 89 transition count 83
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 170 place count 84 transition count 78
Iterating global reduction 4 with 5 rules applied. Total rules applied 175 place count 84 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 175 place count 84 transition count 77
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 177 place count 83 transition count 77
Performed 30 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 237 place count 53 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 52 transition count 43
Applied a total of 239 rules in 49 ms. Remains 52 /172 variables (removed 120) and now considering 43/167 (removed 124) transitions.
// Phase 1: matrix 43 rows 52 cols
[2024-05-31 19:20:03] [INFO ] Computed 16 invariants in 1 ms
[2024-05-31 19:20:04] [INFO ] Implicit Places using invariants in 87 ms returned [16, 17, 21, 22, 30, 38, 44, 51]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 89 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/172 places, 43/167 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 44 transition count 40
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 41 transition count 40
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 9 place count 38 transition count 37
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 38 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 37 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 37 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 36 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 36 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 35 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 34 transition count 45
Applied a total of 20 rules in 12 ms. Remains 34 /44 variables (removed 10) and now considering 45/43 (removed -2) transitions.
// Phase 1: matrix 45 rows 34 cols
[2024-05-31 19:20:04] [INFO ] Computed 8 invariants in 0 ms
[2024-05-31 19:20:04] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 19:20:04] [INFO ] Invariant cache hit.
[2024-05-31 19:20:04] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-31 19:20:04] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/172 places, 45/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 304 ms. Remains : 34/172 places, 45/167 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-05
Product exploration explored 100000 steps with 7472 reset in 337 ms.
Stack based approach found an accepted trace after 11679 steps with 867 reset with depth 10 and stack size 10 in 67 ms.
FORMULA AutoFlight-PT-02b-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-02b-LTLCardinality-05 finished in 783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 171 transition count 107
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 66 rules applied. Total rules applied 125 place count 112 transition count 100
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 129 place count 108 transition count 100
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 129 place count 108 transition count 78
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 173 place count 86 transition count 78
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 178 place count 81 transition count 73
Iterating global reduction 3 with 5 rules applied. Total rules applied 183 place count 81 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 183 place count 81 transition count 72
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 185 place count 80 transition count 72
Performed 30 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 245 place count 50 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 49 transition count 37
Reduce places removed 4 places and 0 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 3 with 6 rules applied. Total rules applied 252 place count 45 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 254 place count 43 transition count 35
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 254 place count 43 transition count 33
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 258 place count 41 transition count 33
Applied a total of 258 rules in 27 ms. Remains 41 /172 variables (removed 131) and now considering 33/167 (removed 134) transitions.
// Phase 1: matrix 33 rows 41 cols
[2024-05-31 19:20:04] [INFO ] Computed 12 invariants in 0 ms
[2024-05-31 19:20:04] [INFO ] Implicit Places using invariants in 71 ms returned [14, 31, 35, 40]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 72 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/172 places, 33/167 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 35 transition count 31
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 35 transition count 31
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 29
Applied a total of 8 rules in 5 ms. Remains 33 /37 variables (removed 4) and now considering 29/33 (removed 4) transitions.
// Phase 1: matrix 29 rows 33 cols
[2024-05-31 19:20:04] [INFO ] Computed 8 invariants in 0 ms
[2024-05-31 19:20:04] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 19:20:04] [INFO ] Invariant cache hit.
[2024-05-31 19:20:04] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/172 places, 29/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 245 ms. Remains : 33/172 places, 29/167 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-08
Stuttering criterion allowed to conclude after 206 steps with 18 reset in 1 ms.
FORMULA AutoFlight-PT-02b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLCardinality-08 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 167/167 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 167 transition count 162
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 167 transition count 162
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 167 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 164 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 164 transition count 158
Applied a total of 17 rules in 20 ms. Remains 164 /172 variables (removed 8) and now considering 158/167 (removed 9) transitions.
// Phase 1: matrix 158 rows 164 cols
[2024-05-31 19:20:05] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:20:05] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-31 19:20:05] [INFO ] Invariant cache hit.
[2024-05-31 19:20:05] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-31 19:20:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:07] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:20:07] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:20:08] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
[2024-05-31 19:20:08] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 6 ms to minimize.
[2024-05-31 19:20:08] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-31 19:20:08] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-31 19:20:08] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-31 19:20:08] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:20:08] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:20:08] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:20:09] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-31 19:20:09] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:20:09] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-31 19:20:09] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:20:09] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-31 19:20:09] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:20:09] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 4 ms to minimize.
[2024-05-31 19:20:10] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 3 ms to minimize.
[2024-05-31 19:20:10] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 3 ms to minimize.
[2024-05-31 19:20:10] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:11] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 3 ms to minimize.
[2024-05-31 19:20:12] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:20:12] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:13] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 158/322 variables, 164/204 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:16] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:20:16] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:20:16] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:20:16] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 208 constraints, problems are : Problem set: 0 solved, 157 unsolved in 17178 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:24] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/322 variables, 164/209 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 157/366 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:27] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:20:27] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:20:27] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 3/369 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:29] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-31 19:20:30] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/322 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 371 constraints, problems are : Problem set: 0 solved, 157 unsolved in 16196 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 34/34 constraints]
After SMT, in 33405ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 33412ms
Starting structural reductions in LTL mode, iteration 1 : 164/172 places, 158/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33790 ms. Remains : 164/172 places, 158/167 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-02b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-02b-LTLCardinality-10 finished in 34506 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 U G(p0))))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 167/167 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 166 transition count 161
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 166 transition count 161
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 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 164 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 164 transition count 158
Applied a total of 17 rules in 13 ms. Remains 164 /172 variables (removed 8) and now considering 158/167 (removed 9) transitions.
// Phase 1: matrix 158 rows 164 cols
[2024-05-31 19:20:39] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:20:39] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 19:20:39] [INFO ] Invariant cache hit.
[2024-05-31 19:20:39] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-31 19:20:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:41] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:20:41] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:20:41] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-05-31 19:20:42] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:20:42] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:20:42] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:20:42] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:20:42] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:20:42] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:20:42] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:20:43] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:20:43] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:45] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-05-31 19:20:45] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 3 ms to minimize.
[2024-05-31 19:20:45] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:20:45] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:20:46] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:20:46] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:20:46] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:20:46] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:47] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-05-31 19:20:47] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 3 ms to minimize.
[2024-05-31 19:20:47] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-31 19:20:47] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:49] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:20:49] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 158/322 variables, 164/206 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:52] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:20:52] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/322 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 208 constraints, problems are : Problem set: 0 solved, 157 unsolved in 18173 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:59] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:20:59] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/322 variables, 164/210 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 157/367 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:02] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:21:02] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 3 ms to minimize.
[2024-05-31 19:21:03] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:06] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:21:07] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:10] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-31 19:21:10] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:14] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:17] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/322 variables, and 376 constraints, problems are : Problem set: 0 solved, 157 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 39/39 constraints]
After SMT, in 48208ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 48211ms
Starting structural reductions in LTL mode, iteration 1 : 164/172 places, 158/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48460 ms. Remains : 164/172 places, 158/167 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLCardinality-12 finished in 48659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F((G(F(p0))||(!p1&&F(p0)))))||((!p0||G(!p1))&&F((G(F(p0))||(!p1&&F(p0)))))))))'
Found a Shortening insensitive property : AutoFlight-PT-02b-LTLCardinality-00
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 172/172 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 171 transition count 110
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 63 rules applied. Total rules applied 119 place count 115 transition count 103
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 124 place count 111 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 110 transition count 102
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 125 place count 110 transition count 80
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 169 place count 88 transition count 80
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 173 place count 84 transition count 76
Iterating global reduction 4 with 4 rules applied. Total rules applied 177 place count 84 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 177 place count 84 transition count 75
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 179 place count 83 transition count 75
Performed 26 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 231 place count 57 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 56 transition count 44
Applied a total of 232 rules in 37 ms. Remains 56 /172 variables (removed 116) and now considering 44/167 (removed 123) transitions.
// Phase 1: matrix 44 rows 56 cols
[2024-05-31 19:21:28] [INFO ] Computed 16 invariants in 1 ms
[2024-05-31 19:21:29] [INFO ] Implicit Places using invariants in 121 ms returned [26, 34, 42, 48, 55]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 123 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 51/172 places, 44/167 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 48 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 48 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 47 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 47 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 46 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 46 transition count 39
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 12 place count 45 transition count 38
Applied a total of 12 rules in 10 ms. Remains 45 /51 variables (removed 6) and now considering 38/44 (removed 6) transitions.
// Phase 1: matrix 38 rows 45 cols
[2024-05-31 19:21:29] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 19:21:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 19:21:29] [INFO ] Invariant cache hit.
[2024-05-31 19:21:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 19:21:29] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 199 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 44/172 places, 38/167 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 44 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 37
Applied a total of 2 rules in 3 ms. Remains 43 /44 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 43 cols
[2024-05-31 19:21:29] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 19:21:29] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 19:21:29] [INFO ] Invariant cache hit.
[2024-05-31 19:21:29] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:21:29] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 43/172 places, 37/167 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 545 ms. Remains : 43/172 places, 37/167 transitions.
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-00
Product exploration explored 100000 steps with 5964 reset in 186 ms.
Product exploration explored 100000 steps with 6020 reset in 180 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/43 stabilizing places and 4/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 689 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 25 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 379 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
RANDOM walk for 438 steps (20 resets) in 6 ms. (62 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 879 ms. Reduced automaton from 9 states, 25 edges and 2 AP (stutter insensitive) to 9 states, 25 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 394 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 462 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 37/37 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2024-05-31 19:21:32] [INFO ] Invariant cache hit.
[2024-05-31 19:21:32] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 19:21:32] [INFO ] Invariant cache hit.
[2024-05-31 19:21:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:21:32] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-31 19:21:32] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-31 19:21:32] [INFO ] Invariant cache hit.
[2024-05-31 19:21:32] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/43 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-31 19:21:33] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 37/80 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/80 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 61 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1002 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/43 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 37/80 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 32/93 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-31 19:21:34] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/80 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 94 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1060 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 2/2 constraints]
After SMT, in 2071ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2073ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2261 ms. Remains : 43/43 places, 37/37 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/43 stabilizing places and 4/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 849 ms. Reduced automaton from 9 states, 25 edges and 2 AP (stutter insensitive) to 9 states, 25 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 548 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
RANDOM walk for 273 steps (12 resets) in 6 ms. (39 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 1187 ms. Reduced automaton from 9 states, 25 edges and 2 AP (stutter insensitive) to 9 states, 25 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 471 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 490 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 474 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 5987 reset in 264 ms.
Product exploration explored 100000 steps with 5955 reset in 283 ms.
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 37/37 transitions.
Applied a total of 0 rules in 8 ms. Remains 43 /43 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2024-05-31 19:21:39] [INFO ] Invariant cache hit.
[2024-05-31 19:21:39] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 19:21:39] [INFO ] Invariant cache hit.
[2024-05-31 19:21:39] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:21:39] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-31 19:21:39] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-31 19:21:39] [INFO ] Invariant cache hit.
[2024-05-31 19:21:39] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/43 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-31 19:21:39] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 37/80 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/80 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 61 constraints, problems are : Problem set: 0 solved, 32 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/43 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 37/80 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 32/93 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-31 19:21:41] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/80 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 94 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1090 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 2/2 constraints]
After SMT, in 1968ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1969ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2150 ms. Remains : 43/43 places, 37/37 transitions.
Treatment of property AutoFlight-PT-02b-LTLCardinality-00 finished in 13535 ms.
[2024-05-31 19:21:41] [INFO ] Flatten gal took : 21 ms
[2024-05-31 19:21:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-05-31 19:21:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 172 places, 167 transitions and 404 arcs took 5 ms.
Total runtime 233244 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutoFlight-PT-02b-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717183458382

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutoFlight-PT-02b-LTLCardinality-00
ltl formula formula --ltl=/tmp/2199/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 172 places, 167 transitions and 404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2199/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2199/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2199/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2199/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 174 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 173, there are 270 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~93 levels ~10000 states ~23532 transitions
pnml2lts-mc( 0/ 4): ~93 levels ~20000 states ~48228 transitions
pnml2lts-mc( 0/ 4): ~93 levels ~40000 states ~103588 transitions
pnml2lts-mc( 0/ 4): ~93 levels ~80000 states ~218308 transitions
pnml2lts-mc( 0/ 4): ~93 levels ~160000 states ~470172 transitions
pnml2lts-mc( 0/ 4): ~93 levels ~320000 states ~988100 transitions
pnml2lts-mc( 0/ 4): ~93 levels ~640000 states ~2114420 transitions
pnml2lts-mc( 0/ 4): ~93 levels ~1280000 states ~4430352 transitions
pnml2lts-mc( 0/ 4): ~93 levels ~2560000 states ~9081448 transitions
pnml2lts-mc( 0/ 4): ~106 levels ~5120000 states ~18514200 transitions
pnml2lts-mc( 0/ 4): ~106 levels ~10240000 states ~37764256 transitions
pnml2lts-mc( 0/ 4): ~106 levels ~20480000 states ~79265688 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33307160
pnml2lts-mc( 0/ 4): unique states count: 33525453
pnml2lts-mc( 0/ 4): unique transitions count: 213901732
pnml2lts-mc( 0/ 4): - self-loop count: 52
pnml2lts-mc( 0/ 4): - claim dead count: 179549341
pnml2lts-mc( 0/ 4): - claim found count: 770011
pnml2lts-mc( 0/ 4): - claim success count: 33525473
pnml2lts-mc( 0/ 4): - cum. max stack depth: 32790
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33525473 states 213901771 transitions, fanout: 6.380
pnml2lts-mc( 0/ 4): Total exploration time 155.810 sec (155.770 sec minimum, 155.790 sec on average)
pnml2lts-mc( 0/ 4): States per second: 215169, Transitions per second: 1372837
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.6MB, 8.1 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 167 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.6MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-02b.tgz
mv AutoFlight-PT-02b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;