Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 18:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 18:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 85K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678630789860

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:19:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 14:19:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:19:52] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-12 14:19:52] [INFO ] Transformed 307 places.
[2023-03-12 14:19:52] [INFO ] Transformed 305 transitions.
[2023-03-12 14:19:52] [INFO ] Found NUPN structural information;
[2023-03-12 14:19:52] [INFO ] Parsed PT model containing 307 places and 305 transitions and 980 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
FORMULA AutoFlight-PT-12a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 245/245 transitions.
Applied a total of 0 rules in 42 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2023-03-12 14:19:53] [INFO ] Computed 76 place invariants in 24 ms
[2023-03-12 14:19:53] [INFO ] Implicit Places using invariants in 818 ms returned [7, 14, 21, 35, 56, 63, 70, 77, 84, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 238, 244, 250, 256, 262, 268, 274, 280, 286, 292, 298, 304, 306]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 861 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 275/307 places, 245/245 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 265 transition count 235
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 265 transition count 235
Applied a total of 20 rules in 22 ms. Remains 265 /275 variables (removed 10) and now considering 235/245 (removed 10) transitions.
// Phase 1: matrix 235 rows 265 cols
[2023-03-12 14:19:53] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-12 14:19:53] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-12 14:19:54] [INFO ] Invariant cache hit.
[2023-03-12 14:19:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 14:19:54] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 265/307 places, 235/245 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1249 ms. Remains : 265/307 places, 235/245 transitions.
Support contains 38 out of 265 places after structural reductions.
[2023-03-12 14:19:54] [INFO ] Flatten gal took : 67 ms
[2023-03-12 14:19:54] [INFO ] Flatten gal took : 17 ms
[2023-03-12 14:19:54] [INFO ] Input system was already deterministic with 235 transitions.
Support contains 35 out of 265 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 26) seen :19
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 14:19:55] [INFO ] Invariant cache hit.
[2023-03-12 14:19:55] [INFO ] [Real]Absence check using 44 positive place invariants in 41 ms returned sat
[2023-03-12 14:19:55] [INFO ] After 110ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:3
[2023-03-12 14:19:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 14:19:55] [INFO ] After 24ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-12 14:19:55] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-12 14:19:55] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2023-03-12 14:19:55] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2023-03-12 14:19:55] [INFO ] After 10ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :4 sat :1
[2023-03-12 14:19:55] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-12 14:19:55] [INFO ] After 263ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 235/235 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 265 transition count 161
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 191 transition count 161
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 148 place count 191 transition count 141
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 188 place count 171 transition count 141
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 240 place count 145 transition count 115
Free-agglomeration rule applied 36 times.
Iterating global reduction 2 with 36 rules applied. Total rules applied 276 place count 145 transition count 79
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 312 place count 109 transition count 79
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 314 place count 109 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 316 place count 107 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 317 place count 106 transition count 76
Reduce places removed 40 places and 0 transitions.
Graph (trivial) has 68 edges and 66 vertex of which 22 / 66 are part of one of the 1 SCC in 2 ms
Free SCC test removed 21 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 4 with 77 rules applied. Total rules applied 394 place count 45 transition count 40
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 5 with 69 rules applied. Total rules applied 463 place count 8 transition count 8
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 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 466 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 467 place count 6 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 469 place count 6 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 471 place count 4 transition count 4
Applied a total of 471 rules in 33 ms. Remains 4 /265 variables (removed 261) and now considering 4/235 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 4/265 places, 4/235 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA AutoFlight-PT-12a-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-12a-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA AutoFlight-PT-12a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p1)||p0))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 6 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-12 14:19:56] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-12 14:19:56] [INFO ] Implicit Places using invariants in 242 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 256 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Applied a total of 4 rules in 6 ms. Remains 255 /257 variables (removed 2) and now considering 232/234 (removed 2) transitions.
// Phase 1: matrix 232 rows 255 cols
[2023-03-12 14:19:56] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-12 14:19:56] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-12 14:19:56] [INFO ] Invariant cache hit.
[2023-03-12 14:19:56] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 255/265 places, 232/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 622 ms. Remains : 255/265 places, 232/235 transitions.
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s52 0) (EQ s5 0) (EQ s158 1)), p1:(EQ s52 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1843 reset in 481 ms.
Product exploration explored 100000 steps with 1849 reset in 293 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND 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))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 9 factoid took 668 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 193 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:19:59] [INFO ] Invariant cache hit.
[2023-03-12 14:19:59] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND 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)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 10 factoid took 1196 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 232/232 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2023-03-12 14:20:00] [INFO ] Invariant cache hit.
[2023-03-12 14:20:01] [INFO ] Implicit Places using invariants in 614 ms returned []
[2023-03-12 14:20:01] [INFO ] Invariant cache hit.
[2023-03-12 14:20:01] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
[2023-03-12 14:20:01] [INFO ] Invariant cache hit.
[2023-03-12 14:20:02] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1275 ms. Remains : 255/255 places, 232/232 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 371 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 188 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:20:02] [INFO ] Invariant cache hit.
[2023-03-12 14:20:02] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:20:02] [INFO ] [Nat]Absence check using 37 positive place invariants in 73 ms returned sat
[2023-03-12 14:20:03] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:20:03] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 14:20:03] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=81 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 5 factoid took 491 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1832 reset in 275 ms.
Product exploration explored 100000 steps with 1849 reset in 355 ms.
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 232/232 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2023-03-12 14:20:04] [INFO ] Invariant cache hit.
[2023-03-12 14:20:04] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-12 14:20:04] [INFO ] Invariant cache hit.
[2023-03-12 14:20:05] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-12 14:20:05] [INFO ] Invariant cache hit.
[2023-03-12 14:20:05] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 434 ms. Remains : 255/255 places, 232/232 transitions.
Treatment of property AutoFlight-PT-12a-LTLCardinality-00 finished in 9175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 265 transition count 163
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 193 transition count 163
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 144 place count 193 transition count 143
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 184 place count 173 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 172 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 172 transition count 142
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 238 place count 146 transition count 116
Applied a total of 238 rules in 37 ms. Remains 146 /265 variables (removed 119) and now considering 116/235 (removed 119) transitions.
// Phase 1: matrix 116 rows 146 cols
[2023-03-12 14:20:05] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-12 14:20:05] [INFO ] Implicit Places using invariants in 183 ms returned [17, 26, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 85, 106]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 196 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/265 places, 116/235 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 128 transition count 98
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 110 transition count 98
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 36 place count 110 transition count 96
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 108 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 107 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 107 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 106 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 106 transition count 94
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 46 place count 105 transition count 93
Applied a total of 46 rules in 10 ms. Remains 105 /128 variables (removed 23) and now considering 93/116 (removed 23) transitions.
// Phase 1: matrix 93 rows 105 cols
[2023-03-12 14:20:05] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-12 14:20:06] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-12 14:20:06] [INFO ] Invariant cache hit.
[2023-03-12 14:20:06] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-12 14:20:06] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 105/265 places, 93/235 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1092 ms. Remains : 105/265 places, 93/235 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s44 1), p1:(AND (EQ s44 1) (OR (EQ s29 0) (EQ s65 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-01 finished in 1287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 6 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-12 14:20:06] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-12 14:20:07] [INFO ] Implicit Places using invariants in 691 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 709 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Applied a total of 46 rules in 69 ms. Remains 234 /257 variables (removed 23) and now considering 211/234 (removed 23) transitions.
// Phase 1: matrix 211 rows 234 cols
[2023-03-12 14:20:07] [INFO ] Computed 37 place invariants in 20 ms
[2023-03-12 14:20:07] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-12 14:20:07] [INFO ] Invariant cache hit.
[2023-03-12 14:20:07] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 234/265 places, 211/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1173 ms. Remains : 234/265 places, 211/235 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s158 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 451 ms.
Product exploration explored 100000 steps with 50000 reset in 432 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLCardinality-04 finished in 2282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 259 transition count 141
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 192 place count 166 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 165 transition count 140
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 193 place count 165 transition count 127
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 231 place count 140 transition count 127
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 12 rules applied. Total rules applied 243 place count 140 transition count 115
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 255 place count 128 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 256 place count 127 transition count 114
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 127 transition count 114
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 309 place count 101 transition count 88
Applied a total of 309 rules in 22 ms. Remains 101 /265 variables (removed 164) and now considering 88/235 (removed 147) transitions.
// Phase 1: matrix 88 rows 101 cols
[2023-03-12 14:20:08] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 14:20:09] [INFO ] Implicit Places using invariants in 211 ms returned [62, 75]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 226 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/265 places, 88/235 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 251 ms. Remains : 99/265 places, 88/235 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s48 0) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 65 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-05 finished in 431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((F(p1)&&F(G(p2)))))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 5 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-12 14:20:09] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-12 14:20:09] [INFO ] Implicit Places using invariants in 221 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 227 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 219 transition count 196
Applied a total of 76 rules in 116 ms. Remains 219 /257 variables (removed 38) and now considering 196/234 (removed 38) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-12 14:20:09] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-12 14:20:11] [INFO ] Implicit Places using invariants in 1764 ms returned []
[2023-03-12 14:20:11] [INFO ] Invariant cache hit.
[2023-03-12 14:20:11] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 1934 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/265 places, 196/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2282 ms. Remains : 219/265 places, 196/235 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (NEQ s63 0) (NEQ s136 1)), p1:(OR (EQ s189 0) (EQ s154 1)), p2:(AND (EQ s154 0) (EQ s189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 413 ms.
Product exploration explored 100000 steps with 50000 reset in 392 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), true]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 396 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLCardinality-06 finished in 3751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 12 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-12 14:20:13] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-12 14:20:13] [INFO ] Implicit Places using invariants in 267 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 282 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 219 transition count 196
Applied a total of 76 rules in 109 ms. Remains 219 /257 variables (removed 38) and now considering 196/234 (removed 38) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-12 14:20:13] [INFO ] Computed 37 place invariants in 5 ms
[2023-03-12 14:20:13] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-12 14:20:13] [INFO ] Invariant cache hit.
[2023-03-12 14:20:13] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/265 places, 196/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 681 ms. Remains : 219/265 places, 196/235 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s84 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-07 finished in 872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(p1))||p0)))))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 5 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-12 14:20:14] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-12 14:20:14] [INFO ] Implicit Places using invariants in 211 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 224 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Applied a total of 28 rules in 25 ms. Remains 243 /257 variables (removed 14) and now considering 220/234 (removed 14) transitions.
// Phase 1: matrix 220 rows 243 cols
[2023-03-12 14:20:14] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-12 14:20:14] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-12 14:20:14] [INFO ] Invariant cache hit.
[2023-03-12 14:20:14] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 243/265 places, 220/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 691 ms. Remains : 243/265 places, 220/235 transitions.
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s81 0) (EQ s110 1)), p1:(AND (EQ s110 0) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5270 steps with 203 reset in 16 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-08 finished in 1031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 6 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-12 14:20:15] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-12 14:20:15] [INFO ] Implicit Places using invariants in 321 ms returned [25, 45, 78, 101, 163, 213]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 338 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 256 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 256 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 255 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 255 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 254 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 254 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 253 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 253 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 252 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 252 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 251 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 251 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 250 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 250 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 249 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 249 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 248 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 248 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 247 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 247 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 246 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 246 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 245 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 245 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 244 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 243 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 243 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 242 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 242 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 241 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 241 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 240 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 240 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 239 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 239 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 238 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 238 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 237 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 237 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 236 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 236 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 235 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 235 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 234 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 234 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 233 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 233 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 232 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 232 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 231 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 231 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 230 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 230 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 229 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 229 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 228 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 228 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 227 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 227 transition count 203
Applied a total of 62 rules in 80 ms. Remains 227 /258 variables (removed 31) and now considering 203/234 (removed 31) transitions.
// Phase 1: matrix 203 rows 227 cols
[2023-03-12 14:20:15] [INFO ] Computed 38 place invariants in 14 ms
[2023-03-12 14:20:15] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-12 14:20:15] [INFO ] Invariant cache hit.
[2023-03-12 14:20:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 14:20:15] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 227/265 places, 203/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 912 ms. Remains : 227/265 places, 203/235 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s85 1), p0:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1868 reset in 316 ms.
Product exploration explored 100000 steps with 1858 reset in 267 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/227 stabilizing places and 1/203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT 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 : []
Knowledge based reduction with 5 factoid took 289 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 184 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:20:17] [INFO ] Invariant cache hit.
[2023-03-12 14:20:17] [INFO ] [Real]Absence check using 38 positive place invariants in 30 ms returned sat
[2023-03-12 14:20:17] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT 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)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 441 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 14:20:18] [INFO ] Invariant cache hit.
[2023-03-12 14:20:18] [INFO ] [Real]Absence check using 38 positive place invariants in 30 ms returned sat
[2023-03-12 14:20:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:20:18] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-12 14:20:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 14:20:18] [INFO ] [Real]Added 3 Read/Feed constraints in 14 ms returned sat
[2023-03-12 14:20:18] [INFO ] Computed and/alt/rep : 201/387/201 causal constraints (skipped 1 transitions) in 13 ms.
[2023-03-12 14:20:18] [INFO ] Added : 0 causal constraints over 0 iterations in 67 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 227 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-12 14:20:18] [INFO ] Invariant cache hit.
[2023-03-12 14:20:18] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-12 14:20:18] [INFO ] Invariant cache hit.
[2023-03-12 14:20:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 14:20:19] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-12 14:20:19] [INFO ] Invariant cache hit.
[2023-03-12 14:20:19] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 540 ms. Remains : 227/227 places, 203/203 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/227 stabilizing places and 1/203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 237 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 14:20:20] [INFO ] Invariant cache hit.
[2023-03-12 14:20:20] [INFO ] [Real]Absence check using 38 positive place invariants in 48 ms returned sat
[2023-03-12 14:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:20:20] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-03-12 14:20:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 14:20:20] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-12 14:20:20] [INFO ] Computed and/alt/rep : 201/387/201 causal constraints (skipped 1 transitions) in 19 ms.
[2023-03-12 14:20:20] [INFO ] Added : 0 causal constraints over 0 iterations in 62 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1862 reset in 256 ms.
Product exploration explored 100000 steps with 1853 reset in 223 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 203/203 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 227 transition count 203
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 59 place count 227 transition count 203
Deduced a syphon composed of 74 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 227 transition count 203
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 119 place count 182 transition count 158
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 164 place count 182 transition count 158
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 191 place count 182 transition count 158
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 196 place count 177 transition count 153
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 201 place count 177 transition count 153
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 201 rules in 20 ms. Remains 177 /227 variables (removed 50) and now considering 153/203 (removed 50) transitions.
[2023-03-12 14:20:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 153 rows 177 cols
[2023-03-12 14:20:21] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-12 14:20:22] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/227 places, 153/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 177/227 places, 153/203 transitions.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 203/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 227 cols
[2023-03-12 14:20:22] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-12 14:20:22] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-12 14:20:22] [INFO ] Invariant cache hit.
[2023-03-12 14:20:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 14:20:22] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2023-03-12 14:20:22] [INFO ] Invariant cache hit.
[2023-03-12 14:20:22] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 670 ms. Remains : 227/227 places, 203/203 transitions.
Treatment of property AutoFlight-PT-12a-LTLCardinality-10 finished in 7712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 10 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-12 14:20:22] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-12 14:20:22] [INFO ] Implicit Places using invariants in 140 ms returned [45, 78, 101, 163, 213]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 142 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 259/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 257 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 257 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 256 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 256 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 255 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 255 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 254 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 254 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 253 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 253 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 252 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 252 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 251 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 251 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 250 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 250 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 249 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 249 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 248 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 248 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 247 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 247 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 246 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 246 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 245 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 245 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 244 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 244 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 243 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 243 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 242 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 242 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 241 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 241 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 240 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 240 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 239 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 239 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 238 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 238 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 237 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 237 transition count 212
Applied a total of 44 rules in 83 ms. Remains 237 /259 variables (removed 22) and now considering 212/234 (removed 22) transitions.
// Phase 1: matrix 212 rows 237 cols
[2023-03-12 14:20:22] [INFO ] Computed 39 place invariants in 14 ms
[2023-03-12 14:20:23] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-12 14:20:23] [INFO ] Invariant cache hit.
[2023-03-12 14:20:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 14:20:23] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 237/265 places, 212/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 735 ms. Remains : 237/265 places, 212/235 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s152 0) (EQ s25 1)), p0:(OR (EQ s38 0) (EQ s160 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-12 finished in 895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 36 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-12 14:20:23] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-12 14:20:23] [INFO ] Implicit Places using invariants in 326 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 329 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 207
Applied a total of 54 rules in 140 ms. Remains 230 /257 variables (removed 27) and now considering 207/234 (removed 27) transitions.
// Phase 1: matrix 207 rows 230 cols
[2023-03-12 14:20:24] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-12 14:20:24] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-12 14:20:24] [INFO ] Invariant cache hit.
[2023-03-12 14:20:24] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 230/265 places, 207/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 789 ms. Remains : 230/265 places, 207/235 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s123 0) (EQ s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 378 ms.
Product exploration explored 100000 steps with 50000 reset in 429 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLCardinality-13 finished in 1849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 12 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-12 14:20:25] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-12 14:20:25] [INFO ] Implicit Places using invariants in 327 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 328 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 219 transition count 196
Applied a total of 76 rules in 65 ms. Remains 219 /257 variables (removed 38) and now considering 196/234 (removed 38) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-12 14:20:25] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-12 14:20:26] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-12 14:20:26] [INFO ] Invariant cache hit.
[2023-03-12 14:20:26] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/265 places, 196/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 731 ms. Remains : 219/265 places, 196/235 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s147 0) (EQ s172 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 117 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-15 finished in 915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p1)||p0))))'
Found a Lengthening insensitive property : AutoFlight-PT-12a-LTLCardinality-00
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 259 transition count 141
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 192 place count 166 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 165 transition count 140
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 193 place count 165 transition count 127
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 231 place count 140 transition count 127
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 12 rules applied. Total rules applied 243 place count 140 transition count 115
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 255 place count 128 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 256 place count 127 transition count 114
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 127 transition count 114
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 307 place count 102 transition count 89
Applied a total of 307 rules in 31 ms. Remains 102 /265 variables (removed 163) and now considering 89/235 (removed 146) transitions.
// Phase 1: matrix 89 rows 102 cols
[2023-03-12 14:20:26] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 14:20:26] [INFO ] Implicit Places using invariants in 129 ms returned [61, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 130 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 100/265 places, 89/235 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 164 ms. Remains : 100/265 places, 89/235 transitions.
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s35 0) (EQ s3 0) (EQ s61 1)), p1:(EQ s35 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3179 reset in 159 ms.
Product exploration explored 100000 steps with 3184 reset in 240 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
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))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 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))))]
Knowledge based reduction with 7 factoid took 761 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 313 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 89 rows 100 cols
[2023-03-12 14:20:28] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-12 14:20:28] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
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)), (G (NOT (AND p1 (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 (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 8 factoid took 876 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-12 14:20:29] [INFO ] Invariant cache hit.
[2023-03-12 14:20:29] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-12 14:20:29] [INFO ] Invariant cache hit.
[2023-03-12 14:20:29] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-12 14:20:30] [INFO ] Invariant cache hit.
[2023-03-12 14:20:30] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 100/100 places, 89/89 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X 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 (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 444 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3164 steps, including 98 resets, run visited all 3 properties in 15 ms. (steps per millisecond=210 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X 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 (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 3 factoid took 541 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3162 reset in 218 ms.
Product exploration explored 100000 steps with 3144 reset in 187 ms.
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-12 14:20:32] [INFO ] Invariant cache hit.
[2023-03-12 14:20:32] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-12 14:20:32] [INFO ] Invariant cache hit.
[2023-03-12 14:20:32] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-12 14:20:32] [INFO ] Invariant cache hit.
[2023-03-12 14:20:32] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 100/100 places, 89/89 transitions.
Treatment of property AutoFlight-PT-12a-LTLCardinality-00 finished in 6240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Found a Lengthening insensitive property : AutoFlight-PT-12a-LTLCardinality-10
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 265 transition count 161
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 191 transition count 161
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 148 place count 191 transition count 142
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 186 place count 172 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 171 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 171 transition count 141
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 242 place count 144 transition count 114
Applied a total of 242 rules in 35 ms. Remains 144 /265 variables (removed 121) and now considering 114/235 (removed 121) transitions.
// Phase 1: matrix 114 rows 144 cols
[2023-03-12 14:20:33] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-12 14:20:33] [INFO ] Implicit Places using invariants in 813 ms returned [17, 31, 52, 53, 54, 55, 56, 57, 60, 61, 62, 63, 64, 65, 66, 85, 104]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 815 ms to find 17 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 127/265 places, 114/235 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 127 transition count 99
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 112 transition count 99
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 30 place count 112 transition count 95
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 38 place count 108 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 107 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 107 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 106 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 106 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 105 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 105 transition count 92
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 46 place count 104 transition count 91
Applied a total of 46 rules in 7 ms. Remains 104 /127 variables (removed 23) and now considering 91/114 (removed 23) transitions.
// Phase 1: matrix 91 rows 104 cols
[2023-03-12 14:20:33] [INFO ] Computed 27 place invariants in 0 ms
[2023-03-12 14:20:33] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-12 14:20:33] [INFO ] Invariant cache hit.
[2023-03-12 14:20:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-12 14:20:34] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 104/265 places, 91/235 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1094 ms. Remains : 104/265 places, 91/235 transitions.
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s51 1), p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2963 reset in 177 ms.
Product exploration explored 100000 steps with 2979 reset in 191 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/104 stabilizing places and 1/91 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT 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 : []
Knowledge based reduction with 5 factoid took 400 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 301 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:20:35] [INFO ] Invariant cache hit.
[2023-03-12 14:20:35] [INFO ] [Real]Absence check using 27 positive place invariants in 42 ms returned sat
[2023-03-12 14:20:35] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT 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)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 388 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 14:20:36] [INFO ] Invariant cache hit.
[2023-03-12 14:20:36] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-12 14:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:20:36] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2023-03-12 14:20:36] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-12 14:20:36] [INFO ] [Real]Added 26 Read/Feed constraints in 7 ms returned sat
[2023-03-12 14:20:36] [INFO ] Computed and/alt/rep : 76/177/76 causal constraints (skipped 14 transitions) in 9 ms.
[2023-03-12 14:20:36] [INFO ] Added : 0 causal constraints over 0 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-12 14:20:36] [INFO ] Invariant cache hit.
[2023-03-12 14:20:36] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-12 14:20:36] [INFO ] Invariant cache hit.
[2023-03-12 14:20:36] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-12 14:20:36] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-12 14:20:36] [INFO ] Invariant cache hit.
[2023-03-12 14:20:36] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 104/104 places, 91/91 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/104 stabilizing places and 1/91 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 260 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 14:20:38] [INFO ] Invariant cache hit.
[2023-03-12 14:20:38] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned sat
[2023-03-12 14:20:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:20:38] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-12 14:20:38] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-12 14:20:38] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2023-03-12 14:20:38] [INFO ] Computed and/alt/rep : 76/177/76 causal constraints (skipped 14 transitions) in 13 ms.
[2023-03-12 14:20:38] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2943 reset in 194 ms.
Product exploration explored 100000 steps with 2969 reset in 179 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 91/91 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 104 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-12 14:20:39] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 91 rows 104 cols
[2023-03-12 14:20:39] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 14:20:39] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 91/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 104/104 places, 91/91 transitions.
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 104 cols
[2023-03-12 14:20:39] [INFO ] Computed 27 place invariants in 0 ms
[2023-03-12 14:20:39] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-12 14:20:39] [INFO ] Invariant cache hit.
[2023-03-12 14:20:39] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-12 14:20:39] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-12 14:20:39] [INFO ] Invariant cache hit.
[2023-03-12 14:20:40] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 104/104 places, 91/91 transitions.
Treatment of property AutoFlight-PT-12a-LTLCardinality-10 finished in 7426 ms.
[2023-03-12 14:20:40] [INFO ] Flatten gal took : 14 ms
[2023-03-12 14:20:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 14:20:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 265 places, 235 transitions and 665 arcs took 3 ms.
Total runtime 47603 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1758/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1758/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-12a-LTLCardinality-00
Could not compute solution for formula : AutoFlight-PT-12a-LTLCardinality-10

BK_STOP 1678630840818

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-12a"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-12a, 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 r009-oct2-167813597900467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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