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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 24K Feb 26 11:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 11:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 11:13 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 8.4K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 26 11:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 26 11:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 34K Feb 26 11:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 242K Feb 26 11:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K 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 91K 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-0020-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-0020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678620904588

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-0020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 11:35:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 11:35:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:35:07] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-12 11:35:07] [INFO ] Transformed 159 places.
[2023-03-12 11:35:07] [INFO ] Transformed 168 transitions.
[2023-03-12 11:35:07] [INFO ] Parsed PT model containing 159 places and 168 transitions and 638 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 62 places and 0 transitions.
FORMULA AirplaneLD-PT-0020-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 168/168 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 79 transition count 150
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 79 transition count 150
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 54 place count 79 transition count 132
Applied a total of 54 rules in 52 ms. Remains 79 /97 variables (removed 18) and now considering 132/168 (removed 36) transitions.
// Phase 1: matrix 132 rows 79 cols
[2023-03-12 11:35:07] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-12 11:35:08] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-12 11:35:08] [INFO ] Invariant cache hit.
[2023-03-12 11:35:08] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2023-03-12 11:35:08] [INFO ] Invariant cache hit.
[2023-03-12 11:35:08] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/97 places, 132/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 829 ms. Remains : 79/97 places, 132/168 transitions.
Support contains 75 out of 79 places after structural reductions.
[2023-03-12 11:35:08] [INFO ] Flatten gal took : 88 ms
[2023-03-12 11:35:08] [INFO ] Flatten gal took : 17 ms
[2023-03-12 11:35:08] [INFO ] Input system was already deterministic with 132 transitions.
Incomplete random walk after 10000 steps, including 1252 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 17) seen :9
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-12 11:35:09] [INFO ] Invariant cache hit.
[2023-03-12 11:35:09] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-12 11:35:09] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 11:35:09] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:2
[2023-03-12 11:35:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-12 11:35:09] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 11:35:09] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
FORMULA AirplaneLD-PT-0020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 79 stabilizing places and 132 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 79 transition count 132
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA AirplaneLD-PT-0020-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 132/132 transitions.
Graph (complete) has 189 edges and 79 vertex of which 54 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 15 transition count 53
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 15 transition count 53
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 118 place count 15 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 118 place count 15 transition count 13
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 120 place count 14 transition count 13
Applied a total of 120 rules in 12 ms. Remains 14 /79 variables (removed 65) and now considering 13/132 (removed 119) transitions.
// Phase 1: matrix 13 rows 14 cols
[2023-03-12 11:35:09] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:35:09] [INFO ] Implicit Places using invariants in 26 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/79 places, 13/132 transitions.
Graph (complete) has 11 edges and 13 vertex of which 12 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
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 11
Applied a total of 3 rules in 1 ms. Remains 11 /13 variables (removed 2) and now considering 11/13 (removed 2) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-12 11:35:09] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 11:35:10] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-12 11:35:10] [INFO ] Invariant cache hit.
[2023-03-12 11:35:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/79 places, 11/132 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 118 ms. Remains : 10/79 places, 11/132 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33403 reset in 239 ms.
Product exploration explored 100000 steps with 33367 reset in 133 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 11
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 (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 256 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0020-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0020-LTLCardinality-02 finished in 1027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 40 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 132/132 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 76 transition count 132
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 57 transition count 113
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 57 transition count 113
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 60 place count 57 transition count 94
Applied a total of 60 rules in 4 ms. Remains 57 /79 variables (removed 22) and now considering 94/132 (removed 38) transitions.
// Phase 1: matrix 94 rows 57 cols
[2023-03-12 11:35:10] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-12 11:35:10] [INFO ] Implicit Places using invariants in 93 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/79 places, 94/132 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 56/79 places, 94/132 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 46191 reset in 382 ms.
Product exploration explored 100000 steps with 46086 reset in 288 ms.
Computed a total of 56 stabilizing places and 94 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 94
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 380 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 57 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 364 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 66 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
// Phase 1: matrix 94 rows 56 cols
[2023-03-12 11:35:12] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-12 11:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:35:14] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-12 11:35:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:35:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:35:14] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-12 11:35:14] [INFO ] Computed and/alt/rep : 45/88/45 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-12 11:35:14] [INFO ] Added : 2 causal constraints over 1 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 40 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 94/94 transitions.
Graph (complete) has 74 edges and 56 vertex of which 48 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 47 transition count 86
Applied a total of 3 rules in 3 ms. Remains 47 /56 variables (removed 9) and now considering 86/94 (removed 8) transitions.
// Phase 1: matrix 86 rows 47 cols
[2023-03-12 11:35:14] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-12 11:35:14] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-12 11:35:14] [INFO ] Invariant cache hit.
[2023-03-12 11:35:14] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-12 11:35:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 11:35:14] [INFO ] Invariant cache hit.
[2023-03-12 11:35:14] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/56 places, 86/94 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 418 ms. Remains : 47/56 places, 86/94 transitions.
Computed a total of 47 stabilizing places and 86 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 86
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 306 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 48 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 292 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 91 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0)]
[2023-03-12 11:35:15] [INFO ] Invariant cache hit.
[2023-03-12 11:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:35:15] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-12 11:35:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:35:15] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-12 11:35:16] [INFO ] Computed and/alt/rep : 42/84/42 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-12 11:35:16] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Product exploration explored 100000 steps with 47665 reset in 287 ms.
Product exploration explored 100000 steps with 47770 reset in 290 ms.
Support contains 40 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-12 11:35:16] [INFO ] Invariant cache hit.
[2023-03-12 11:35:16] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 11:35:16] [INFO ] Invariant cache hit.
[2023-03-12 11:35:16] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-12 11:35:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 11:35:16] [INFO ] Invariant cache hit.
[2023-03-12 11:35:16] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 47/47 places, 86/86 transitions.
Treatment of property AirplaneLD-PT-0020-LTLCardinality-03 finished in 6154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0||(p0 U p1)))||X(!p1)))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 132/132 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 76 transition count 132
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 60 place count 19 transition count 75
Iterating global reduction 1 with 57 rules applied. Total rules applied 117 place count 19 transition count 75
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 174 place count 19 transition count 18
Applied a total of 174 rules in 3 ms. Remains 19 /79 variables (removed 60) and now considering 18/132 (removed 114) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-12 11:35:17] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 11:35:17] [INFO ] Implicit Places using invariants in 26 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/79 places, 18/132 transitions.
Applied a total of 0 rules in 0 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 30 ms. Remains : 18/79 places, 18/132 transitions.
Stuttering acceptance computed with spot in 471 ms :[true, p1, false, false, (AND (NOT p1) (NOT p0)), false, false]
Running random walk in product with property : AirplaneLD-PT-0020-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(OR p0 p1), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 3}]], initial=5, aps=[p1:(LEQ s8 s16), p0:(LEQ s17 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 142 steps with 25 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLCardinality-07 finished in 525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 132/132 transitions.
Graph (complete) has 189 edges and 79 vertex of which 76 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 19 transition count 75
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 19 transition count 75
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 172 place count 19 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 172 place count 19 transition count 17
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 174 place count 18 transition count 17
Applied a total of 174 rules in 7 ms. Remains 18 /79 variables (removed 61) and now considering 17/132 (removed 115) transitions.
// Phase 1: matrix 17 rows 18 cols
[2023-03-12 11:35:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:35:17] [INFO ] Implicit Places using invariants in 81 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/79 places, 17/132 transitions.
Graph (complete) has 15 edges and 17 vertex of which 16 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
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 16 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 15 transition count 15
Applied a total of 3 rules in 2 ms. Remains 15 /17 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 15 cols
[2023-03-12 11:35:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 11:35:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-12 11:35:17] [INFO ] Invariant cache hit.
[2023-03-12 11:35:17] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 123 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/79 places, 15/132 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 231 ms. Remains : 14/79 places, 15/132 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLCardinality-11 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:(GT s10 s3)], 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 4 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLCardinality-11 finished in 362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 132/132 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 76 transition count 132
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 60 place count 19 transition count 75
Iterating global reduction 1 with 57 rules applied. Total rules applied 117 place count 19 transition count 75
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 174 place count 19 transition count 18
Applied a total of 174 rules in 2 ms. Remains 19 /79 variables (removed 60) and now considering 18/132 (removed 114) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-12 11:35:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 11:35:17] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 11:35:17] [INFO ] Invariant cache hit.
[2023-03-12 11:35:18] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-12 11:35:18] [INFO ] Invariant cache hit.
[2023-03-12 11:35:18] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/79 places, 18/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 19/79 places, 18/132 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s15 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0020-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0020-LTLCardinality-13 finished in 271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : AirplaneLD-PT-0020-LTLCardinality-03
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0)]
Support contains 40 out of 79 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 79/79 places, 132/132 transitions.
Graph (complete) has 189 edges and 79 vertex of which 50 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 44 output transitions
Drop transitions removed 44 transitions
Applied a total of 1 rules in 5 ms. Remains 50 /79 variables (removed 29) and now considering 88/132 (removed 44) transitions.
// Phase 1: matrix 88 rows 50 cols
[2023-03-12 11:35:18] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-12 11:35:18] [INFO ] Implicit Places using invariants in 64 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 49/79 places, 88/132 transitions.
Graph (complete) has 47 edges and 49 vertex of which 48 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
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 47 transition count 86
Applied a total of 3 rules in 3 ms. Remains 47 /49 variables (removed 2) and now considering 86/88 (removed 2) transitions.
// Phase 1: matrix 86 rows 47 cols
[2023-03-12 11:35:18] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 11:35:18] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-12 11:35:18] [INFO ] Invariant cache hit.
[2023-03-12 11:35:18] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 47/79 places, 86/132 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 293 ms. Remains : 47/79 places, 86/132 transitions.
Running random walk in product with property : AirplaneLD-PT-0020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 47743 reset in 239 ms.
Product exploration explored 100000 steps with 47741 reset in 255 ms.
Computed a total of 47 stabilizing places and 86 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 86
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 274 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 60 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 298 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
[2023-03-12 11:35:20] [INFO ] Invariant cache hit.
[2023-03-12 11:35:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:35:21] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-12 11:35:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:35:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:35:21] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-12 11:35:21] [INFO ] Computed and/alt/rep : 42/84/42 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 11:35:21] [INFO ] Added : 0 causal constraints over 0 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 40 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-12 11:35:21] [INFO ] Invariant cache hit.
[2023-03-12 11:35:21] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-12 11:35:21] [INFO ] Invariant cache hit.
[2023-03-12 11:35:21] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-12 11:35:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 11:35:21] [INFO ] Invariant cache hit.
[2023-03-12 11:35:21] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 47/47 places, 86/86 transitions.
Computed a total of 47 stabilizing places and 86 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 86
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 242 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 55 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 438 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 68 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0)]
[2023-03-12 11:35:22] [INFO ] Invariant cache hit.
[2023-03-12 11:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:35:23] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-12 11:35:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:35:23] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-12 11:35:23] [INFO ] Computed and/alt/rep : 42/84/42 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-12 11:35:23] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Product exploration explored 100000 steps with 47730 reset in 266 ms.
Product exploration explored 100000 steps with 47762 reset in 335 ms.
Support contains 40 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-12 11:35:23] [INFO ] Invariant cache hit.
[2023-03-12 11:35:23] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-12 11:35:23] [INFO ] Invariant cache hit.
[2023-03-12 11:35:24] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-12 11:35:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 11:35:24] [INFO ] Invariant cache hit.
[2023-03-12 11:35:24] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 490 ms. Remains : 47/47 places, 86/86 transitions.
Treatment of property AirplaneLD-PT-0020-LTLCardinality-03 finished in 6188 ms.
[2023-03-12 11:35:24] [INFO ] Flatten gal took : 11 ms
[2023-03-12 11:35:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 11:35:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 132 transitions and 372 arcs took 1 ms.
Total runtime 17359 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/920/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393220 kB
MemFree: 16019244 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16066220 kB
Could not compute solution for formula : AirplaneLD-PT-0020-LTLCardinality-03

BK_STOP 1678624496369

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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-0020-LTLCardinality-03
ltl formula formula --ltl=/tmp/920/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 79 places, 132 transitions and 372 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/920/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/920/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/920/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/920/ltl_0_
Killing (15) : 926 927 928 929 930
Killing (9) : 926 927 928 929 930

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-0020"
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-0020, 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-167813597600251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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