Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689000259.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AirplaneLD-PT-0050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689000259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 46K Apr 29 20:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 222K Apr 29 20:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 29 20:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 192K Apr 29 20:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 32K May 9 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 9 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 9 07:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 9 07:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 9 07:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K May 9 07:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 219K May 10 09:33 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-0050-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-0050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652658527993

Running Version 202205111006
[2022-05-15 23:48:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 23:48:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:48:50] [INFO ] Load time of PNML (sax parser for PT used): 355 ms
[2022-05-15 23:48:50] [INFO ] Transformed 369 places.
[2022-05-15 23:48:50] [INFO ] Transformed 408 transitions.
[2022-05-15 23:48:50] [INFO ] Parsed PT model containing 369 places and 408 transitions in 494 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 152 places and 0 transitions.
FORMULA AirplaneLD-PT-0050-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 213 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 408/408 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 215 transition count 408
Applied a total of 2 rules in 22 ms. Remains 215 /217 variables (removed 2) and now considering 408/408 (removed 0) transitions.
// Phase 1: matrix 408 rows 215 cols
[2022-05-15 23:48:50] [INFO ] Computed 1 place invariants in 27 ms
[2022-05-15 23:48:50] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 408 rows 215 cols
[2022-05-15 23:48:50] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-15 23:48:50] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
// Phase 1: matrix 408 rows 215 cols
[2022-05-15 23:48:50] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-15 23:48:51] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 215/217 places, 408/408 transitions.
Finished structural reductions, in 1 iterations. Remains : 215/217 places, 408/408 transitions.
Support contains 213 out of 215 places after structural reductions.
[2022-05-15 23:48:51] [INFO ] Flatten gal took : 55 ms
[2022-05-15 23:48:51] [INFO ] Flatten gal took : 28 ms
[2022-05-15 23:48:51] [INFO ] Input system was already deterministic with 408 transitions.
Incomplete random walk after 10000 steps, including 1257 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 17) seen :8
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 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 17 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 16 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 12 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 23 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 22 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 408 rows 215 cols
[2022-05-15 23:48:52] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-15 23:48:52] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:48:52] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2022-05-15 23:48:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:48:52] [INFO ] After 197ms 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 0 ms.
Successfully simplified 9 atomic propositions for a total of 10 simplifications.
FORMULA AirplaneLD-PT-0050-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 215 stabilizing places and 408 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 215 transition count 408
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 100 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 408/408 transitions.
Graph (complete) has 391 edges and 215 vertex of which 110 are kept as prefixes of interest. Removing 105 places using SCC suffix rule.3 ms
Discarding 105 places :
Also discarding 200 output transitions
Drop transitions removed 200 transitions
Applied a total of 1 rules in 13 ms. Remains 110 /215 variables (removed 105) and now considering 208/408 (removed 200) transitions.
// Phase 1: matrix 208 rows 110 cols
[2022-05-15 23:48:52] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 23:48:52] [INFO ] Implicit Places using invariants in 32 ms returned [109]
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 : 109/215 places, 208/408 transitions.
Graph (complete) has 107 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 108 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 206
Applied a total of 3 rules in 6 ms. Remains 107 /109 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 107 cols
[2022-05-15 23:48:52] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-15 23:48:52] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 206 rows 107 cols
[2022-05-15 23:48:52] [INFO ] Computed 0 place invariants in 11 ms
[2022-05-15 23:48:52] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/215 places, 206/408 transitions.
Finished structural reductions, in 2 iterations. Remains : 107/215 places, 206/408 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], 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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0050-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLCardinality-00 finished in 320 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 408/408 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 408
Discarding 195 places :
Symmetric choice reduction at 1 with 195 rule applications. Total rules 196 place count 19 transition count 213
Iterating global reduction 1 with 195 rules applied. Total rules applied 391 place count 19 transition count 213
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 586 place count 19 transition count 18
Applied a total of 586 rules in 7 ms. Remains 19 /215 variables (removed 196) and now considering 18/408 (removed 390) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:48:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:52] [INFO ] Implicit Places using invariants in 21 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/215 places, 18/408 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 2 iterations. Remains : 18/215 places, 18/408 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AirplaneLD-PT-0050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s5 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLCardinality-04 finished in 100 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 408/408 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 408
Discarding 194 places :
Symmetric choice reduction at 1 with 194 rule applications. Total rules 195 place count 20 transition count 214
Iterating global reduction 1 with 194 rules applied. Total rules applied 389 place count 20 transition count 214
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 1 with 194 rules applied. Total rules applied 583 place count 20 transition count 20
Applied a total of 583 rules in 5 ms. Remains 20 /215 variables (removed 195) and now considering 20/408 (removed 388) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:48:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:52] [INFO ] Implicit Places using invariants in 19 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/215 places, 20/408 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 19/215 places, 20/408 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLCardinality-08 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 s17 s3)], 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-0050-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLCardinality-08 finished in 93 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G(G((p0 U p1)))))))'
Support contains 4 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 408/408 transitions.
Graph (complete) has 391 edges and 215 vertex of which 214 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 196 place count 19 transition count 213
Iterating global reduction 0 with 195 rules applied. Total rules applied 391 place count 19 transition count 213
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 0 with 195 rules applied. Total rules applied 586 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 586 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 588 place count 18 transition count 17
Applied a total of 588 rules in 11 ms. Remains 18 /215 variables (removed 197) and now considering 17/408 (removed 391) transitions.
// Phase 1: matrix 17 rows 18 cols
[2022-05-15 23:48:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:48:53] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 17 rows 18 cols
[2022-05-15 23:48:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:48:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/215 places, 17/408 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 17/215 places, 17/408 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s3 s6), p0:(LEQ s16 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14582 reset in 243 ms.
Product exploration explored 100000 steps with 14569 reset in 118 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 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 : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR p1 p0)), (X (NOT (OR p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0050-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0050-LTLCardinality-10 finished in 758 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(p0))))'
Support contains 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 408/408 transitions.
Discarding 194 places :
Symmetric choice reduction at 0 with 194 rule applications. Total rules 194 place count 21 transition count 214
Iterating global reduction 0 with 194 rules applied. Total rules applied 388 place count 21 transition count 214
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 582 place count 21 transition count 20
Applied a total of 582 rules in 7 ms. Remains 21 /215 variables (removed 194) and now considering 20/408 (removed 388) transitions.
// Phase 1: matrix 20 rows 21 cols
[2022-05-15 23:48:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:48:53] [INFO ] Implicit Places using invariants in 21 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/215 places, 20/408 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 1 place count 20 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Applied a total of 2 rules in 5 ms. Remains 19 /20 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 19 cols
[2022-05-15 23:48:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:48:53] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 19 rows 19 cols
[2022-05-15 23:48:53] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:48:53] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/215 places, 19/408 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/215 places, 19/408 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s15 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 114 steps with 15 reset in 1 ms.
FORMULA AirplaneLD-PT-0050-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLCardinality-14 finished in 117 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((true U p0)))'
Support contains 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 408/408 transitions.
Discarding 194 places :
Symmetric choice reduction at 0 with 194 rule applications. Total rules 194 place count 21 transition count 214
Iterating global reduction 0 with 194 rules applied. Total rules applied 388 place count 21 transition count 214
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 582 place count 21 transition count 20
Applied a total of 582 rules in 3 ms. Remains 21 /215 variables (removed 194) and now considering 20/408 (removed 388) transitions.
// Phase 1: matrix 20 rows 21 cols
[2022-05-15 23:48:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:48:53] [INFO ] Implicit Places using invariants in 19 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/215 places, 20/408 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 2 iterations. Remains : 20/215 places, 20/408 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLCardinality-15 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 s12 s16)], 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 25032 reset in 87 ms.
Product exploration explored 100000 steps with 24981 reset in 105 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 20
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 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0050-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0050-LTLCardinality-15 finished in 386 ms.
All properties solved by simple procedures.
Total runtime 4546 ms.

BK_STOP 1652658534647

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-0050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AirplaneLD-PT-0050, 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 r006-tajo-165245689000259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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