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-167813597700291.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 AirplaneLD-PT-1000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597700291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 589K Feb 26 12:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Feb 26 12:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 235K Feb 26 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 425K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 103K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 450K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6M Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.3M Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 554K Feb 26 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.0M Feb 26 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 168K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.3M 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 AirplaneLD-PT-1000-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678621443828

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=AirplaneLD-PT-1000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 11:44:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 11:44:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:44:07] [INFO ] Load time of PNML (sax parser for PT used): 448 ms
[2023-03-12 11:44:07] [INFO ] Transformed 7019 places.
[2023-03-12 11:44:07] [INFO ] Transformed 8008 transitions.
[2023-03-12 11:44:07] [INFO ] Parsed PT model containing 7019 places and 8008 transitions and 30528 arcs in 660 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 372 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 3002 places and 0 transitions.
FORMULA AirplaneLD-PT-1000-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3016 out of 4017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4017/4017 places, 8008/8008 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4016 transition count 8008
Discarding 997 places :
Symmetric choice reduction at 1 with 997 rule applications. Total rules 998 place count 3019 transition count 7011
Iterating global reduction 1 with 997 rules applied. Total rules applied 1995 place count 3019 transition count 7011
Ensure Unique test removed 997 transitions
Reduce isomorphic transitions removed 997 transitions.
Iterating post reduction 1 with 997 rules applied. Total rules applied 2992 place count 3019 transition count 6014
Applied a total of 2992 rules in 182 ms. Remains 3019 /4017 variables (removed 998) and now considering 6014/8008 (removed 1994) transitions.
// Phase 1: matrix 6014 rows 3019 cols
[2023-03-12 11:44:09] [INFO ] Computed 2 place invariants in 1004 ms
[2023-03-12 11:44:10] [INFO ] Implicit Places using invariants in 2028 ms returned []
[2023-03-12 11:44:10] [INFO ] Invariant cache hit.
[2023-03-12 11:44:11] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
[2023-03-12 11:44:11] [INFO ] Invariant cache hit.
[2023-03-12 11:44:16] [INFO ] Dead Transitions using invariants and state equation in 5430 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3019/4017 places, 6014/8008 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8140 ms. Remains : 3019/4017 places, 6014/8008 transitions.
Support contains 3016 out of 3019 places after structural reductions.
[2023-03-12 11:44:17] [INFO ] Flatten gal took : 390 ms
[2023-03-12 11:44:17] [INFO ] Flatten gal took : 253 ms
[2023-03-12 11:44:18] [INFO ] Input system was already deterministic with 6014 transitions.
Support contains 3015 out of 3019 places (down from 3016) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1262 resets, run finished after 2515 ms. (steps per millisecond=3 ) properties (out of 29) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-12 11:44:21] [INFO ] Invariant cache hit.
[2023-03-12 11:44:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-12 11:44:24] [INFO ] After 3400ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:2
[2023-03-12 11:44:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-12 11:44:25] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA AirplaneLD-PT-1000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3019 stabilizing places and 6014 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3019 transition count 6014
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(p0)))'
Support contains 1 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3017 transition count 6014
Discarding 2998 places :
Symmetric choice reduction at 1 with 2998 rule applications. Total rules 3000 place count 19 transition count 3016
Iterating global reduction 1 with 2998 rules applied. Total rules applied 5998 place count 19 transition count 3016
Ensure Unique test removed 2998 transitions
Reduce isomorphic transitions removed 2998 transitions.
Iterating post reduction 1 with 2998 rules applied. Total rules applied 8996 place count 19 transition count 18
Applied a total of 8996 rules in 84 ms. Remains 19 /3019 variables (removed 3000) and now considering 18/6014 (removed 5996) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-12 11:44:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:44:25] [INFO ] Implicit Places using invariants in 59 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/3019 places, 18/6014 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 18/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-05 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}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(GT 1 s17)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 8 reset in 1 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-05 finished in 543 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(G(p0)) U p1)))'
Support contains 6 out of 3019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Graph (complete) has 7530 edges and 3019 vertex of which 2011 are kept as prefixes of interest. Removing 1008 places using SCC suffix rule.18 ms
Discarding 1008 places :
Also discarding 1006 output transitions
Drop transitions removed 1006 transitions
Ensure Unique test removed 999 transitions
Reduce isomorphic transitions removed 999 transitions.
Iterating post reduction 0 with 999 rules applied. Total rules applied 1000 place count 2011 transition count 4009
Discarding 1999 places :
Symmetric choice reduction at 1 with 1999 rule applications. Total rules 2999 place count 12 transition count 2010
Iterating global reduction 1 with 1999 rules applied. Total rules applied 4998 place count 12 transition count 2010
Ensure Unique test removed 1999 transitions
Reduce isomorphic transitions removed 1999 transitions.
Iterating post reduction 1 with 1999 rules applied. Total rules applied 6997 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6997 place count 12 transition count 10
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 6999 place count 11 transition count 10
Applied a total of 6999 rules in 125 ms. Remains 11 /3019 variables (removed 3008) and now considering 10/6014 (removed 6004) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-12 11:44:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:44:26] [INFO ] Implicit Places using invariants in 59 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/3019 places, 10/6014 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 10/3019 places, 10/6014 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ (ADD s6 s7) (ADD s3 s4)), p0:(LEQ s0 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 18618 reset in 207 ms.
Product exploration explored 100000 steps with 18630 reset in 126 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 10
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 413 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-1000-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-1000-LTLCardinality-06 finished in 1217 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||(p1 U !p2)))))'
Support contains 3003 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3018 transition count 6014
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 3016 transition count 6012
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 3016 transition count 6012
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 3016 transition count 6010
Applied a total of 7 rules in 67 ms. Remains 3016 /3019 variables (removed 3) and now considering 6010/6014 (removed 4) transitions.
// Phase 1: matrix 6010 rows 3016 cols
[2023-03-12 11:44:27] [INFO ] Computed 2 place invariants in 416 ms
[2023-03-12 11:44:28] [INFO ] Implicit Places using invariants in 1046 ms returned [3015]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1070 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3015/3019 places, 6010/6014 transitions.
Applied a total of 0 rules in 17 ms. Remains 3015 /3015 variables (removed 0) and now considering 6010/6010 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1154 ms. Remains : 3015/3019 places, 6010/6014 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s3014 s3011), p2:(GT 1 (ADD s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s102...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 63500 steps with 8006 reset in 10002 ms.
Product exploration timeout after 64670 steps with 8137 reset in 10001 ms.
Computed a total of 3015 stabilizing places and 6010 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3015 transition count 6010
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (OR p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 446 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10000 steps, including 1258 resets, run finished after 5324 ms. (steps per millisecond=1 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 6010 rows 3015 cols
[2023-03-12 11:44:58] [INFO ] Computed 1 place invariants in 413 ms
[2023-03-12 11:44:58] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 11:44:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-12 11:45:02] [INFO ] After 3074ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:45:02] [INFO ] After 3408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-12 11:45:03] [INFO ] After 4189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (OR p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1 p0))), (F (AND p2 p1 (NOT p0))), (F (AND p2 (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 527 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Support contains 3003 out of 3015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3015/3015 places, 6010/6010 transitions.
Applied a total of 0 rules in 10 ms. Remains 3015 /3015 variables (removed 0) and now considering 6010/6010 (removed 0) transitions.
[2023-03-12 11:45:04] [INFO ] Invariant cache hit.
[2023-03-12 11:45:04] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-12 11:45:04] [INFO ] Invariant cache hit.
[2023-03-12 11:45:05] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
[2023-03-12 11:45:05] [INFO ] Invariant cache hit.
[2023-03-12 11:45:09] [INFO ] Dead Transitions using invariants and state equation in 3255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5142 ms. Remains : 3015/3015 places, 6010/6010 transitions.
Computed a total of 3015 stabilizing places and 6010 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3015 transition count 6010
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR (NOT p2) p1 p0)), (X (NOT (AND p2 p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 460 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10000 steps, including 1262 resets, run finished after 3813 ms. (steps per millisecond=2 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 11:45:16] [INFO ] Invariant cache hit.
[2023-03-12 11:45:18] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 11:45:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 25 ms returned sat
[2023-03-12 11:45:22] [INFO ] After 3144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 11:45:23] [INFO ] After 4200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 538 ms.
[2023-03-12 11:45:23] [INFO ] After 5589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR (NOT p2) p1 p0)), (X (NOT (AND p2 p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p0 (NOT p2)))), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) p2))]
Knowledge based reduction with 7 factoid took 550 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Product exploration timeout after 57140 steps with 7193 reset in 10001 ms.
Product exploration timeout after 57520 steps with 7262 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Support contains 3003 out of 3015 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3015/3015 places, 6010/6010 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 3015 transition count 6010
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3015 transition count 6010
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 264 ms. Remains 3015 /3015 variables (removed 0) and now considering 6010/6010 (removed 0) transitions.
[2023-03-12 11:45:46] [INFO ] Redundant transitions in 461 ms returned []
// Phase 1: matrix 6010 rows 3015 cols
[2023-03-12 11:45:46] [INFO ] Computed 1 place invariants in 369 ms
[2023-03-12 11:45:49] [INFO ] Dead Transitions using invariants and state equation in 3466 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3015/3015 places, 6010/6010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4253 ms. Remains : 3015/3015 places, 6010/6010 transitions.
Support contains 3003 out of 3015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3015/3015 places, 6010/6010 transitions.
Applied a total of 0 rules in 24 ms. Remains 3015 /3015 variables (removed 0) and now considering 6010/6010 (removed 0) transitions.
// Phase 1: matrix 6010 rows 3015 cols
[2023-03-12 11:45:50] [INFO ] Computed 1 place invariants in 384 ms
[2023-03-12 11:45:50] [INFO ] Implicit Places using invariants in 798 ms returned []
[2023-03-12 11:45:50] [INFO ] Invariant cache hit.
[2023-03-12 11:45:51] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
[2023-03-12 11:45:51] [INFO ] Invariant cache hit.
[2023-03-12 11:45:54] [INFO ] Dead Transitions using invariants and state equation in 3199 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5229 ms. Remains : 3015/3015 places, 6010/6010 transitions.
Treatment of property AirplaneLD-PT-1000-LTLCardinality-07 finished in 87899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 3 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3017 transition count 6014
Discarding 2998 places :
Symmetric choice reduction at 1 with 2998 rule applications. Total rules 3000 place count 19 transition count 3016
Iterating global reduction 1 with 2998 rules applied. Total rules applied 5998 place count 19 transition count 3016
Ensure Unique test removed 2998 transitions
Reduce isomorphic transitions removed 2998 transitions.
Iterating post reduction 1 with 2998 rules applied. Total rules applied 8996 place count 19 transition count 18
Applied a total of 8996 rules in 40 ms. Remains 19 /3019 variables (removed 3000) and now considering 18/6014 (removed 5996) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-12 11:45:55] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:45:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-12 11:45:55] [INFO ] Invariant cache hit.
[2023-03-12 11:45:55] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-12 11:45:55] [INFO ] Invariant cache hit.
[2023-03-12 11:45:55] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/3019 places, 18/6014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 19/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s18 s11), p1:(LEQ s8 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 18263 reset in 109 ms.
Product exploration explored 100000 steps with 18257 reset in 81 ms.
Computed a total of 19 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 550 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0)]
Knowledge based reduction with 3 factoid took 414 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
[2023-03-12 11:45:56] [INFO ] Invariant cache hit.
[2023-03-12 11:45:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 11:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:45:57] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 11:45:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:45:57] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:45:57] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-12 11:45:57] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 11:45:57] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 19 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Graph (complete) has 17 edges and 19 vertex of which 5 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 4 transition count 4
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 4 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 4 transition count 3
Applied a total of 5 rules in 2 ms. Remains 4 /19 variables (removed 15) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-12 11:45:57] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:45:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-12 11:45:57] [INFO ] Invariant cache hit.
[2023-03-12 11:45:57] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-12 11:45:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 11:45:57] [INFO ] Invariant cache hit.
[2023-03-12 11:45:57] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/19 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 4/19 places, 3/18 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 335 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 270 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0)]
[2023-03-12 11:45:58] [INFO ] Invariant cache hit.
[2023-03-12 11:45:58] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:45:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-12 11:45:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:45:58] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:45:58] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-12 11:45:58] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 11:45:58] [INFO ] Added : 0 causal constraints over 0 iterations in 54 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40055 reset in 41 ms.
Product exploration explored 100000 steps with 40066 reset in 45 ms.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 1 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 3 cols
[2023-03-12 11:45:58] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:45:58] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-12 11:45:58] [INFO ] Invariant cache hit.
[2023-03-12 11:45:58] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-12 11:45:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 11:45:58] [INFO ] Invariant cache hit.
[2023-03-12 11:45:58] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 3/4 places, 2/3 transitions.
Treatment of property AirplaneLD-PT-1000-LTLCardinality-08 finished in 3654 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 1 out of 3019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Graph (complete) has 7530 edges and 3019 vertex of which 1 are kept as prefixes of interest. Removing 3018 places using SCC suffix rule.8 ms
Discarding 3018 places :
Also discarding 5014 output transitions
Drop transitions removed 5014 transitions
Ensure Unique test removed 999 transitions
Reduce isomorphic transitions removed 999 transitions.
Iterating post reduction 0 with 999 rules applied. Total rules applied 1000 place count 1 transition count 1
Applied a total of 1000 rules in 19 ms. Remains 1 /3019 variables (removed 3018) and now considering 1/6014 (removed 6013) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-12 11:45:58] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 11:45:58] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 11:45:58] [INFO ] Invariant cache hit.
[2023-03-12 11:45:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-12 11:45:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 11:45:58] [INFO ] Invariant cache hit.
[2023-03-12 11:45:59] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/3019 places, 1/6014 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 1/3019 places, 1/6014 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-09 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:(LEQ 1 s0)], 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 1 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-09 finished in 300 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(F((p0||G(p1))))))'
Support contains 3 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3017 transition count 6014
Discarding 2996 places :
Symmetric choice reduction at 1 with 2996 rule applications. Total rules 2998 place count 21 transition count 3018
Iterating global reduction 1 with 2996 rules applied. Total rules applied 5994 place count 21 transition count 3018
Ensure Unique test removed 2996 transitions
Reduce isomorphic transitions removed 2996 transitions.
Iterating post reduction 1 with 2996 rules applied. Total rules applied 8990 place count 21 transition count 22
Applied a total of 8990 rules in 67 ms. Remains 21 /3019 variables (removed 2998) and now considering 22/6014 (removed 5992) transitions.
// Phase 1: matrix 22 rows 21 cols
[2023-03-12 11:45:59] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:45:59] [INFO ] Implicit Places using invariants in 53 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/3019 places, 22/6014 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 20/3019 places, 22/6014 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(LEQ 1 s6), p0:(GT s3 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-10 finished in 332 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&&(G(p1)||F(!p0))&&(F(!p0)||X(p2))))))'
Support contains 5 out of 3019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Graph (complete) has 7530 edges and 3019 vertex of which 3017 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.33 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 2997 places :
Symmetric choice reduction at 0 with 2997 rule applications. Total rules 2998 place count 20 transition count 3017
Iterating global reduction 0 with 2997 rules applied. Total rules applied 5995 place count 20 transition count 3017
Ensure Unique test removed 2997 transitions
Reduce isomorphic transitions removed 2997 transitions.
Iterating post reduction 0 with 2997 rules applied. Total rules applied 8992 place count 20 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8992 place count 20 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8994 place count 19 transition count 19
Applied a total of 8994 rules in 112 ms. Remains 19 /3019 variables (removed 3000) and now considering 19/6014 (removed 5995) transitions.
// Phase 1: matrix 19 rows 19 cols
[2023-03-12 11:45:59] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:45:59] [INFO ] Implicit Places using invariants in 33 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/3019 places, 19/6014 transitions.
Graph (complete) has 17 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-03-12 11:45:59] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 11:45:59] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-12 11:45:59] [INFO ] Invariant cache hit.
[2023-03-12 11:45:59] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 189 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/3019 places, 18/6014 transitions.
Applied a total of 0 rules in 12 ms. Remains 16 /16 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 350 ms. Remains : 16/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s14 s12), p0:(LEQ s2 s12), p2:(LEQ s15 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-11 finished in 515 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 U p1)))'
Support contains 3 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3018 transition count 6014
Discarding 2997 places :
Symmetric choice reduction at 1 with 2997 rule applications. Total rules 2998 place count 21 transition count 3017
Iterating global reduction 1 with 2997 rules applied. Total rules applied 5995 place count 21 transition count 3017
Ensure Unique test removed 2997 transitions
Reduce isomorphic transitions removed 2997 transitions.
Iterating post reduction 1 with 2997 rules applied. Total rules applied 8992 place count 21 transition count 20
Applied a total of 8992 rules in 95 ms. Remains 21 /3019 variables (removed 2998) and now considering 20/6014 (removed 5994) transitions.
// Phase 1: matrix 20 rows 21 cols
[2023-03-12 11:46:00] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:46:00] [INFO ] Implicit Places using invariants in 80 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/3019 places, 20/6014 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 20/3019 places, 20/6014 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 1 s16), p0:(LEQ s19 s9)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-12 finished in 361 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)||F(p1))))'
Support contains 2 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3018 transition count 6014
Discarding 2998 places :
Symmetric choice reduction at 1 with 2998 rule applications. Total rules 2999 place count 20 transition count 3016
Iterating global reduction 1 with 2998 rules applied. Total rules applied 5997 place count 20 transition count 3016
Ensure Unique test removed 2998 transitions
Reduce isomorphic transitions removed 2998 transitions.
Iterating post reduction 1 with 2998 rules applied. Total rules applied 8995 place count 20 transition count 18
Applied a total of 8995 rules in 65 ms. Remains 20 /3019 variables (removed 2999) and now considering 18/6014 (removed 5996) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-12 11:46:00] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 11:46:00] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-12 11:46:00] [INFO ] Invariant cache hit.
[2023-03-12 11:46:00] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-12 11:46:00] [INFO ] Invariant cache hit.
[2023-03-12 11:46:00] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/3019 places, 18/6014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 20/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s19 s15), p0:(GT 1 s19)], 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][false, false, false]]
Product exploration explored 100000 steps with 16222 reset in 108 ms.
Product exploration explored 100000 steps with 16201 reset in 81 ms.
Computed a total of 20 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 627 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1)]
Knowledge based reduction with 6 factoid took 414 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
[2023-03-12 11:46:02] [INFO ] Invariant cache hit.
[2023-03-12 11:46:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 11:46:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:46:02] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-12 11:46:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:46:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-12 11:46:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:46:02] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-12 11:46:02] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 11:46:02] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /20 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 19 cols
[2023-03-12 11:46:02] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 11:46:02] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-12 11:46:02] [INFO ] Invariant cache hit.
[2023-03-12 11:46:02] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 124 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/20 places, 17/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 126 ms. Remains : 18/20 places, 17/18 transitions.
Computed a total of 18 stabilizing places and 17 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 17
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 268 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 407 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
// Phase 1: matrix 17 rows 18 cols
[2023-03-12 11:46:03] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 11:46:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 11:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:46:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 11:46:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:46:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 25 ms returned sat
[2023-03-12 11:46:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:46:03] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-12 11:46:03] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 11:46:03] [INFO ] Added : 0 causal constraints over 0 iterations in 57 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 59 ms :[(NOT p1)]
Product exploration explored 100000 steps with 18182 reset in 116 ms.
Product exploration explored 100000 steps with 18180 reset in 69 ms.
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 17/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-12 11:46:04] [INFO ] Invariant cache hit.
[2023-03-12 11:46:04] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-12 11:46:04] [INFO ] Invariant cache hit.
[2023-03-12 11:46:04] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-12 11:46:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 11:46:04] [INFO ] Invariant cache hit.
[2023-03-12 11:46:04] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 18/18 places, 17/17 transitions.
Treatment of property AirplaneLD-PT-1000-LTLCardinality-15 finished in 4169 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||(p1 U !p2)))))'
Found a Lengthening insensitive property : AirplaneLD-PT-1000-LTLCardinality-07
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Support contains 3003 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Graph (complete) has 7530 edges and 3019 vertex of which 3018 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 3016 transition count 6012
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 3016 transition count 6012
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 7 place count 3016 transition count 6010
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 7 place count 3016 transition count 6009
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 3015 transition count 6009
Applied a total of 9 rules in 119 ms. Remains 3015 /3019 variables (removed 4) and now considering 6009/6014 (removed 5) transitions.
// Phase 1: matrix 6009 rows 3015 cols
[2023-03-12 11:46:05] [INFO ] Computed 2 place invariants in 436 ms
[2023-03-12 11:46:06] [INFO ] Implicit Places using invariants in 1118 ms returned [3014]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1121 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3014/3019 places, 6009/6014 transitions.
Applied a total of 0 rules in 56 ms. Remains 3014 /3014 variables (removed 0) and now considering 6009/6009 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1308 ms. Remains : 3014/3019 places, 6009/6014 transitions.
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s3013 s3010), p2:(GT 1 (ADD s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s102...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 57030 steps with 8188 reset in 10001 ms.
Product exploration timeout after 56610 steps with 8155 reset in 10003 ms.
Computed a total of 3014 stabilizing places and 6009 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3014 transition count 6009
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (OR p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 488 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 3613 ms. (steps per millisecond=2 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6009 rows 3014 cols
[2023-03-12 11:46:35] [INFO ] Computed 1 place invariants in 438 ms
[2023-03-12 11:46:35] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 11:46:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 11:46:38] [INFO ] After 2156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:46:38] [INFO ] After 2471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-12 11:46:39] [INFO ] After 3194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (OR p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1 p0))), (F (AND p2 p1 (NOT p0))), (F (AND p2 (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 688 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Support contains 3003 out of 3014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3014/3014 places, 6009/6009 transitions.
Applied a total of 0 rules in 32 ms. Remains 3014 /3014 variables (removed 0) and now considering 6009/6009 (removed 0) transitions.
[2023-03-12 11:46:40] [INFO ] Invariant cache hit.
[2023-03-12 11:46:40] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-12 11:46:40] [INFO ] Invariant cache hit.
[2023-03-12 11:46:42] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
[2023-03-12 11:46:42] [INFO ] Invariant cache hit.
[2023-03-12 11:46:46] [INFO ] Dead Transitions using invariants and state equation in 4092 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5882 ms. Remains : 3014/3014 places, 6009/6009 transitions.
Computed a total of 3014 stabilizing places and 6009 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3014 transition count 6009
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR (NOT p2) p1 p0)), (X (NOT (AND p2 p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 499 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 4473 ms. (steps per millisecond=2 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 11:46:54] [INFO ] Invariant cache hit.
[2023-03-12 11:46:56] [INFO ] After 656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 11:46:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 11:47:00] [INFO ] After 3762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 11:47:01] [INFO ] After 4716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 545 ms.
[2023-03-12 11:47:02] [INFO ] After 5966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR (NOT p2) p1 p0)), (X (NOT (AND p2 p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p0 (NOT p2)))), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) p2))]
Knowledge based reduction with 7 factoid took 702 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Product exploration timeout after 51750 steps with 7456 reset in 10001 ms.
Product exploration timeout after 51780 steps with 7456 reset in 10002 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Support contains 3003 out of 3014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3014/3014 places, 6009/6009 transitions.
Applied a total of 0 rules in 154 ms. Remains 3014 /3014 variables (removed 0) and now considering 6009/6009 (removed 0) transitions.
[2023-03-12 11:47:24] [INFO ] Redundant transitions in 549 ms returned []
[2023-03-12 11:47:25] [INFO ] Invariant cache hit.
[2023-03-12 11:47:28] [INFO ] Dead Transitions using invariants and state equation in 3984 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4721 ms. Remains : 3014/3014 places, 6009/6009 transitions.
Support contains 3003 out of 3014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3014/3014 places, 6009/6009 transitions.
Applied a total of 0 rules in 10 ms. Remains 3014 /3014 variables (removed 0) and now considering 6009/6009 (removed 0) transitions.
[2023-03-12 11:47:29] [INFO ] Invariant cache hit.
[2023-03-12 11:47:29] [INFO ] Implicit Places using invariants in 722 ms returned []
[2023-03-12 11:47:29] [INFO ] Invariant cache hit.
[2023-03-12 11:47:31] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
[2023-03-12 11:47:31] [INFO ] Invariant cache hit.
[2023-03-12 11:47:34] [INFO ] Dead Transitions using invariants and state equation in 3825 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5848 ms. Remains : 3014/3014 places, 6009/6009 transitions.
Treatment of property AirplaneLD-PT-1000-LTLCardinality-07 finished in 90465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Found a Shortening insensitive property : AirplaneLD-PT-1000-LTLCardinality-08
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Graph (complete) has 7530 edges and 3019 vertex of which 5 are kept as prefixes of interest. Removing 3014 places using SCC suffix rule.6 ms
Discarding 3014 places :
Also discarding 6008 output transitions
Drop transitions removed 6008 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 4 transition count 4
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 4 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 4 transition count 3
Applied a total of 5 rules in 19 ms. Remains 4 /3019 variables (removed 3015) and now considering 3/6014 (removed 6011) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-12 11:47:35] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:47:35] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-12 11:47:35] [INFO ] Invariant cache hit.
[2023-03-12 11:47:35] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-12 11:47:35] [INFO ] Invariant cache hit.
[2023-03-12 11:47:35] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4/3019 places, 3/6014 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 157 ms. Remains : 4/3019 places, 3/6014 transitions.
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s3 s1), p1:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 26651 reset in 40 ms.
Product exploration explored 100000 steps with 26672 reset in 95 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 443 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(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 : [(AND (NOT p0) p1), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0)]
Knowledge based reduction with 3 factoid took 543 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
[2023-03-12 11:47:36] [INFO ] Invariant cache hit.
[2023-03-12 11:47:36] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 11:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:47:36] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-12 11:47:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:47:36] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 11:47:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:47:36] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-12 11:47:36] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 11:47:36] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 4 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-12 11:47:36] [INFO ] Invariant cache hit.
[2023-03-12 11:47:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 11:47:37] [INFO ] Invariant cache hit.
[2023-03-12 11:47:37] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-12 11:47:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 11:47:37] [INFO ] Invariant cache hit.
[2023-03-12 11:47:37] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 4/4 places, 3/3 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 300 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 332 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
[2023-03-12 11:47:37] [INFO ] Invariant cache hit.
[2023-03-12 11:47:38] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 13 ms returned sat
[2023-03-12 11:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:47:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 11:47:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:47:38] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:47:38] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-12 11:47:38] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 11:47:38] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40005 reset in 66 ms.
Product exploration explored 100000 steps with 40005 reset in 46 ms.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 1 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 3 cols
[2023-03-12 11:47:38] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:47:38] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-12 11:47:38] [INFO ] Invariant cache hit.
[2023-03-12 11:47:38] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-12 11:47:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 11:47:38] [INFO ] Invariant cache hit.
[2023-03-12 11:47:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 3/4 places, 2/3 transitions.
Treatment of property AirplaneLD-PT-1000-LTLCardinality-08 finished in 3605 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)||F(p1))))'
[2023-03-12 11:47:39] [INFO ] Flatten gal took : 274 ms
[2023-03-12 11:47:39] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-12 11:47:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3019 places, 6014 transitions and 16537 arcs took 30 ms.
Total runtime 212188 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1800/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393220 kB
MemFree: 15893784 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16059084 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1800/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1800/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AirplaneLD-PT-1000-LTLCardinality-07
Could not compute solution for formula : AirplaneLD-PT-1000-LTLCardinality-08
Could not compute solution for formula : AirplaneLD-PT-1000-LTLCardinality-15

BK_STOP 1678622856340

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name AirplaneLD-PT-1000-LTLCardinality-07
ltl formula formula --ltl=/tmp/1800/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 3019 places, 6014 transitions and 16537 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1800/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1800/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.360 real 0.520 user 0.700 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1800/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1800/ltl_0_
Killing (15) : 1806 1807 1808 1809 1810
Killing (9) : 1806 1807 1808 1809 1810
ltl formula name AirplaneLD-PT-1000-LTLCardinality-08
ltl formula formula --ltl=/tmp/1800/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: =============================================================================
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 3019 places, 6014 transitions and 16537 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.990 real 0.290 user 0.460 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1800/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1800/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1800/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1800/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name AirplaneLD-PT-1000-LTLCardinality-15
ltl formula formula --ltl=/tmp/1800/ltl_2_
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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3019 places, 6014 transitions and 16537 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 1.050 real 0.310 user 0.420 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1800/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1800/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1800/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1800/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 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="AirplaneLD-PT-1000"
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 AirplaneLD-PT-1000, 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-167813597700291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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