Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 76K Apr 12 03:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 286K Apr 12 03:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 12 03:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 127K Apr 12 03:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 31K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 181K Apr 12 03:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 704K Apr 12 03:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108K Apr 12 03:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 646K Apr 12 03:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 433K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716503099969

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 22:25:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 22:25:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 22:25:03] [INFO ] Load time of PNML (sax parser for PT used): 404 ms
[2024-05-23 22:25:03] [INFO ] Transformed 719 places.
[2024-05-23 22:25:03] [INFO ] Transformed 808 transitions.
[2024-05-23 22:25:03] [INFO ] Found NUPN structural information;
[2024-05-23 22:25:03] [INFO ] Parsed PT model containing 719 places and 808 transitions and 3078 arcs in 589 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 302 places and 0 transitions.
Support contains 313 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 808/808 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 414 transition count 808
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 102 place count 315 transition count 709
Iterating global reduction 1 with 99 rules applied. Total rules applied 201 place count 315 transition count 709
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 300 place count 315 transition count 610
Applied a total of 300 rules in 68 ms. Remains 315 /417 variables (removed 102) and now considering 610/808 (removed 198) transitions.
// Phase 1: matrix 610 rows 315 cols
[2024-05-23 22:25:04] [INFO ] Computed 1 invariants in 61 ms
[2024-05-23 22:25:04] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-23 22:25:04] [INFO ] Invariant cache hit.
[2024-05-23 22:25:05] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
[2024-05-23 22:25:05] [INFO ] Invariant cache hit.
[2024-05-23 22:25:05] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 315/417 places, 610/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1660 ms. Remains : 315/417 places, 610/808 transitions.
Support contains 313 out of 315 places after structural reductions.
[2024-05-23 22:25:06] [INFO ] Flatten gal took : 156 ms
[2024-05-23 22:25:06] [INFO ] Flatten gal took : 134 ms
[2024-05-23 22:25:06] [INFO ] Input system was already deterministic with 610 transitions.
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 27) seen :24
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-23 22:25:07] [INFO ] Invariant cache hit.
[2024-05-23 22:25:08] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:25:08] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 22:25:08] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:25:08] [INFO ] After 719ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-23 22:25:09] [INFO ] After 818ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-23 22:25:09] [INFO ] After 1030ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 8 ms.
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 610/610 transitions.
Graph (complete) has 364 edges and 315 vertex of which 165 are kept as prefixes of interest. Removing 150 places using SCC suffix rule.5 ms
Discarding 150 places :
Also discarding 0 output transitions
Drop transitions removed 300 transitions
Reduce isomorphic transitions removed 300 transitions.
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 165 transition count 310
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 301 place count 165 transition count 306
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 311 place count 159 transition count 306
Discarding 149 places :
Symmetric choice reduction at 1 with 149 rule applications. Total rules 460 place count 10 transition count 157
Iterating global reduction 1 with 149 rules applied. Total rules applied 609 place count 10 transition count 157
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Iterating post reduction 1 with 149 rules applied. Total rules applied 758 place count 10 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 758 place count 10 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 766 place count 5 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 767 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 768 place count 4 transition count 4
Applied a total of 768 rules in 43 ms. Remains 4 /315 variables (removed 311) and now considering 4/610 (removed 606) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 4/315 places, 4/610 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 315 stabilizing places and 610 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 315 transition count 610
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(X(p1) U !p2)))))'
Support contains 106 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 197 places :
Symmetric choice reduction at 0 with 197 rule applications. Total rules 197 place count 118 transition count 413
Iterating global reduction 0 with 197 rules applied. Total rules applied 394 place count 118 transition count 413
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 0 with 197 rules applied. Total rules applied 591 place count 118 transition count 216
Applied a total of 591 rules in 10 ms. Remains 118 /315 variables (removed 197) and now considering 216/610 (removed 394) transitions.
// Phase 1: matrix 216 rows 118 cols
[2024-05-23 22:25:09] [INFO ] Computed 1 invariants in 4 ms
[2024-05-23 22:25:09] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-23 22:25:09] [INFO ] Invariant cache hit.
[2024-05-23 22:25:09] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-23 22:25:09] [INFO ] Invariant cache hit.
[2024-05-23 22:25:10] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/315 places, 216/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 118/315 places, 216/610 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 566 ms :[true, (OR (NOT p1) p2), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p1:(AND (EQ s0 1) (EQ s2 1)), p2:(AND (EQ s3 1) (EQ s4 1)), p0:(AND (OR (AND (EQ s62 1) (EQ s87 1)) (AND (EQ s62 1) (EQ s89 1)) (AND (EQ s62 1) (EQ s91 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 915 ms.
Product exploration explored 100000 steps with 33333 reset in 728 ms.
Computed a total of 118 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 216
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 p2) (NOT p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 27 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-00 finished in 2888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(p1)))))'
Support contains 53 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 245 places :
Symmetric choice reduction at 0 with 245 rule applications. Total rules 245 place count 70 transition count 365
Iterating global reduction 0 with 245 rules applied. Total rules applied 490 place count 70 transition count 365
Ensure Unique test removed 245 transitions
Reduce isomorphic transitions removed 245 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 735 place count 70 transition count 120
Applied a total of 735 rules in 11 ms. Remains 70 /315 variables (removed 245) and now considering 120/610 (removed 490) transitions.
// Phase 1: matrix 120 rows 70 cols
[2024-05-23 22:25:12] [INFO ] Computed 1 invariants in 3 ms
[2024-05-23 22:25:12] [INFO ] Implicit Places using invariants in 50 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/315 places, 120/610 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 69/315 places, 120/610 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(EQ s65 1), p0:(AND (OR (EQ s11 0) (EQ s22 0)) (OR (EQ s11 0) (EQ s24 0)) (OR (EQ s11 0) (EQ s26 0)) (OR (EQ s11 0) (EQ s28 0)) (OR (EQ s11 0) (EQ s14 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 167 steps with 20 reset in 14 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-01 finished in 369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 102 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Graph (complete) has 364 edges and 315 vertex of which 111 are kept as prefixes of interest. Removing 204 places using SCC suffix rule.2 ms
Discarding 204 places :
Also discarding 400 output transitions
Drop transitions removed 400 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 110 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 110 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 110 transition count 208
Applied a total of 4 rules in 11 ms. Remains 110 /315 variables (removed 205) and now considering 208/610 (removed 402) transitions.
// Phase 1: matrix 208 rows 110 cols
[2024-05-23 22:25:12] [INFO ] Computed 1 invariants in 4 ms
[2024-05-23 22:25:12] [INFO ] Implicit Places using invariants in 42 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/315 places, 208/610 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
Applied a total of 1 rules in 8 ms. Remains 108 /109 variables (removed 1) and now considering 207/208 (removed 1) transitions.
// Phase 1: matrix 207 rows 108 cols
[2024-05-23 22:25:12] [INFO ] Computed 0 invariants in 4 ms
[2024-05-23 22:25:12] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 22:25:12] [INFO ] Invariant cache hit.
[2024-05-23 22:25:12] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/315 places, 207/610 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 108/315 places, 207/610 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s4 0) (EQ s8 0)) (OR (EQ s4 0) (EQ s73 0)) (OR (EQ s4 0) (EQ s69 0)) (OR (EQ s4 0) (EQ s16 0)) (OR (EQ s4 0) (EQ s81 0)) (OR (EQ s4 0) (EQ...], 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 19038 reset in 1198 ms.
Product exploration explored 100000 steps with 19047 reset in 957 ms.
Computed a total of 108 stabilizing places and 207 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 207
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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 23 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-02 finished in 2593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 53 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 245 places :
Symmetric choice reduction at 0 with 245 rule applications. Total rules 245 place count 70 transition count 365
Iterating global reduction 0 with 245 rules applied. Total rules applied 490 place count 70 transition count 365
Ensure Unique test removed 245 transitions
Reduce isomorphic transitions removed 245 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 735 place count 70 transition count 120
Applied a total of 735 rules in 15 ms. Remains 70 /315 variables (removed 245) and now considering 120/610 (removed 490) transitions.
// Phase 1: matrix 120 rows 70 cols
[2024-05-23 22:25:15] [INFO ] Computed 1 invariants in 3 ms
[2024-05-23 22:25:15] [INFO ] Implicit Places using invariants in 82 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/315 places, 120/610 transitions.
Graph (complete) has 67 edges and 69 vertex of which 68 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 67 transition count 118
Applied a total of 3 rules in 6 ms. Remains 67 /69 variables (removed 2) and now considering 118/120 (removed 2) transitions.
// Phase 1: matrix 118 rows 67 cols
[2024-05-23 22:25:15] [INFO ] Computed 0 invariants in 2 ms
[2024-05-23 22:25:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-23 22:25:15] [INFO ] Invariant cache hit.
[2024-05-23 22:25:15] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/315 places, 118/610 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 67/315 places, 118/610 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-03 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:(OR (EQ s62 1) (AND (OR (EQ s9 0) (EQ s20 0)) (OR (EQ s9 0) (EQ s22 0)) (OR (EQ s9 0) (EQ s24 0)) (OR (EQ s9 0) (EQ s26 0)) (OR (EQ s9 0) (EQ s12 0)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14375 reset in 334 ms.
Product exploration explored 100000 steps with 14427 reset in 344 ms.
Computed a total of 67 stabilizing places and 118 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 118
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-03 finished in 1069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(X(G(p1))))))'
Support contains 54 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Graph (complete) has 364 edges and 315 vertex of which 213 are kept as prefixes of interest. Removing 102 places using SCC suffix rule.2 ms
Discarding 102 places :
Also discarding 200 output transitions
Drop transitions removed 200 transitions
Discarding 147 places :
Symmetric choice reduction at 0 with 147 rule applications. Total rules 148 place count 66 transition count 263
Iterating global reduction 0 with 147 rules applied. Total rules applied 295 place count 66 transition count 263
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Iterating post reduction 0 with 147 rules applied. Total rules applied 442 place count 66 transition count 116
Applied a total of 442 rules in 19 ms. Remains 66 /315 variables (removed 249) and now considering 116/610 (removed 494) transitions.
// Phase 1: matrix 116 rows 66 cols
[2024-05-23 22:25:16] [INFO ] Computed 1 invariants in 2 ms
[2024-05-23 22:25:16] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-23 22:25:16] [INFO ] Invariant cache hit.
[2024-05-23 22:25:16] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-23 22:25:16] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 22:25:16] [INFO ] Invariant cache hit.
[2024-05-23 22:25:16] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/315 places, 116/610 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 405 ms. Remains : 66/315 places, 116/610 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 3}, { cond=p0, acceptance={1} source=2 dest: 4}, { cond=p0, acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s2 0)), p1:(AND (OR (EQ s9 0) (EQ s12 0)) (OR (EQ s9 0) (EQ s10 0)) (OR (EQ s9 0) (EQ s20 0)) (OR (EQ s9 0) (EQ s18 0)) (OR (EQ s9 0)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 18321 reset in 368 ms.
Product exploration explored 100000 steps with 18346 reset in 495 ms.
Computed a total of 66 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 116
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 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 6 states, 22 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-04 finished in 1861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G((p1&&X(p1))))))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 296 places :
Symmetric choice reduction at 0 with 296 rule applications. Total rules 296 place count 19 transition count 314
Iterating global reduction 0 with 296 rules applied. Total rules applied 592 place count 19 transition count 314
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 888 place count 19 transition count 18
Applied a total of 888 rules in 6 ms. Remains 19 /315 variables (removed 296) and now considering 18/610 (removed 592) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 22:25:18] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:25:18] [INFO ] Implicit Places using invariants in 32 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/315 places, 18/610 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 41 ms. Remains : 18/315 places, 18/610 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), 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 (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s2 0) (EQ s4 0)), p1:(EQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 16 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-05 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 296 places :
Symmetric choice reduction at 0 with 296 rule applications. Total rules 296 place count 19 transition count 314
Iterating global reduction 0 with 296 rules applied. Total rules applied 592 place count 19 transition count 314
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 888 place count 19 transition count 18
Applied a total of 888 rules in 7 ms. Remains 19 /315 variables (removed 296) and now considering 18/610 (removed 592) transitions.
[2024-05-23 22:25:18] [INFO ] Invariant cache hit.
[2024-05-23 22:25:18] [INFO ] Implicit Places using invariants in 41 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/315 places, 18/610 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 51 ms. Remains : 18/315 places, 18/610 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s16 1) (NEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-06 finished in 171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p0)&&G(p1)))))))'
Support contains 51 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 248 places :
Symmetric choice reduction at 0 with 248 rule applications. Total rules 248 place count 67 transition count 362
Iterating global reduction 0 with 248 rules applied. Total rules applied 496 place count 67 transition count 362
Ensure Unique test removed 248 transitions
Reduce isomorphic transitions removed 248 transitions.
Iterating post reduction 0 with 248 rules applied. Total rules applied 744 place count 67 transition count 114
Applied a total of 744 rules in 8 ms. Remains 67 /315 variables (removed 248) and now considering 114/610 (removed 496) transitions.
// Phase 1: matrix 114 rows 67 cols
[2024-05-23 22:25:18] [INFO ] Computed 1 invariants in 2 ms
[2024-05-23 22:25:18] [INFO ] Implicit Places using invariants in 45 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/315 places, 114/610 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 66/315 places, 114/610 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (EQ s8 1) (EQ s27 1)) (AND (EQ s8 1) (EQ s29 1)) (AND (EQ s8 1) (EQ s31 1)) (AND (EQ s8 1) (EQ s33 1)) (AND (EQ s8 1) (EQ s19 1)) (AND (EQ s8 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-07 finished in 381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(p1)))))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 296 places :
Symmetric choice reduction at 0 with 296 rule applications. Total rules 296 place count 19 transition count 314
Iterating global reduction 0 with 296 rules applied. Total rules applied 592 place count 19 transition count 314
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 888 place count 19 transition count 18
Applied a total of 888 rules in 14 ms. Remains 19 /315 variables (removed 296) and now considering 18/610 (removed 592) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 22:25:19] [INFO ] Computed 1 invariants in 3 ms
[2024-05-23 22:25:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 22:25:19] [INFO ] Invariant cache hit.
[2024-05-23 22:25:19] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-23 22:25:19] [INFO ] Invariant cache hit.
[2024-05-23 22:25:19] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/315 places, 18/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 19/315 places, 18/610 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s2 0)), p1:(EQ s17 0)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 42987 reset in 136 ms.
Product exploration explored 100000 steps with 42896 reset in 173 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 p0 (NOT p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-08 finished in 761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(p1)))'
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 294 places :
Symmetric choice reduction at 0 with 294 rule applications. Total rules 294 place count 21 transition count 316
Iterating global reduction 0 with 294 rules applied. Total rules applied 588 place count 21 transition count 316
Ensure Unique test removed 294 transitions
Reduce isomorphic transitions removed 294 transitions.
Iterating post reduction 0 with 294 rules applied. Total rules applied 882 place count 21 transition count 22
Applied a total of 882 rules in 11 ms. Remains 21 /315 variables (removed 294) and now considering 22/610 (removed 588) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-23 22:25:20] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:25:20] [INFO ] Implicit Places using invariants in 44 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/315 places, 22/610 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 60 ms. Remains : 20/315 places, 22/610 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s12 1)), p0:(OR (NEQ s5 1) (NEQ s7 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-09 finished in 227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Graph (complete) has 364 edges and 315 vertex of which 1 are kept as prefixes of interest. Removing 314 places using SCC suffix rule.1 ms
Discarding 314 places :
Also discarding 510 output transitions
Drop transitions removed 510 transitions
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 1 transition count 1
Applied a total of 100 rules in 5 ms. Remains 1 /315 variables (removed 314) and now considering 1/610 (removed 609) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-23 22:25:20] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 22:25:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 22:25:20] [INFO ] Invariant cache hit.
[2024-05-23 22:25:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-23 22:25:20] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 22:25:20] [INFO ] Invariant cache hit.
[2024-05-23 22:25:20] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/315 places, 1/610 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 1/315 places, 1/610 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-10 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:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-10 finished in 178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Graph (complete) has 364 edges and 315 vertex of which 8 are kept as prefixes of interest. Removing 307 places using SCC suffix rule.1 ms
Discarding 307 places :
Also discarding 602 output transitions
Drop transitions removed 602 transitions
Applied a total of 1 rules in 4 ms. Remains 8 /315 variables (removed 307) and now considering 8/610 (removed 602) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-05-23 22:25:20] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:25:20] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-23 22:25:20] [INFO ] Invariant cache hit.
[2024-05-23 22:25:20] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-23 22:25:20] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 22:25:20] [INFO ] Invariant cache hit.
[2024-05-23 22:25:20] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/315 places, 8/610 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 8/315 places, 8/610 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s1 1) (EQ s2 1)) (AND (EQ s3 1) (EQ s4 1)))], 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]]
Stuttering criterion allowed to conclude after 14 steps with 4 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-11 finished in 152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X(F(p1))))||(!p0 U (p2||G(!p0)))))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 296 places :
Symmetric choice reduction at 0 with 296 rule applications. Total rules 296 place count 19 transition count 314
Iterating global reduction 0 with 296 rules applied. Total rules applied 592 place count 19 transition count 314
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 888 place count 19 transition count 18
Applied a total of 888 rules in 13 ms. Remains 19 /315 variables (removed 296) and now considering 18/610 (removed 592) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 22:25:20] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:25:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 22:25:20] [INFO ] Invariant cache hit.
[2024-05-23 22:25:20] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-23 22:25:20] [INFO ] Invariant cache hit.
[2024-05-23 22:25:20] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/315 places, 18/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 19/315 places, 18/610 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), false, false, (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s14 1), p1:(EQ s14 0), p2:(AND (NOT (AND (EQ s0 1) (EQ s2 1))) (NEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 45028 reset in 188 ms.
Product exploration explored 100000 steps with 45082 reset in 210 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 p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 23 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-12 finished in 812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 295 places :
Symmetric choice reduction at 0 with 295 rule applications. Total rules 295 place count 20 transition count 315
Iterating global reduction 0 with 295 rules applied. Total rules applied 590 place count 20 transition count 315
Ensure Unique test removed 295 transitions
Reduce isomorphic transitions removed 295 transitions.
Iterating post reduction 0 with 295 rules applied. Total rules applied 885 place count 20 transition count 20
Applied a total of 885 rules in 12 ms. Remains 20 /315 variables (removed 295) and now considering 20/610 (removed 590) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-23 22:25:21] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 22:25:21] [INFO ] Implicit Places using invariants in 38 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/315 places, 20/610 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 19/315 places, 20/610 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-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:(OR (EQ s5 0) (EQ s7 0))], 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 128 steps with 16 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-13 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Graph (complete) has 364 edges and 315 vertex of which 4 are kept as prefixes of interest. Removing 311 places using SCC suffix rule.1 ms
Discarding 311 places :
Also discarding 606 output transitions
Drop transitions removed 606 transitions
Applied a total of 1 rules in 4 ms. Remains 4 /315 variables (removed 311) and now considering 4/610 (removed 606) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-23 22:25:21] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 22:25:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 22:25:21] [INFO ] Invariant cache hit.
[2024-05-23 22:25:21] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-23 22:25:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 22:25:21] [INFO ] Invariant cache hit.
[2024-05-23 22:25:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/315 places, 4/610 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 4/315 places, 4/610 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s3 0), p1:(OR (EQ s1 0) (EQ s2 0))], 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 40039 reset in 109 ms.
Product exploration explored 100000 steps with 40011 reset in 133 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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), (X p0), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X p1), (X (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 51 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLFireability-14 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1 U (F(p2)||X(G(p3)))))))'
Support contains 8 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 610/610 transitions.
Discarding 293 places :
Symmetric choice reduction at 0 with 293 rule applications. Total rules 293 place count 22 transition count 317
Iterating global reduction 0 with 293 rules applied. Total rules applied 586 place count 22 transition count 317
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Iterating post reduction 0 with 293 rules applied. Total rules applied 879 place count 22 transition count 24
Applied a total of 879 rules in 21 ms. Remains 22 /315 variables (removed 293) and now considering 24/610 (removed 586) transitions.
// Phase 1: matrix 24 rows 22 cols
[2024-05-23 22:25:22] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 22:25:22] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-23 22:25:22] [INFO ] Invariant cache hit.
[2024-05-23 22:25:22] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-23 22:25:22] [INFO ] Invariant cache hit.
[2024-05-23 22:25:22] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/315 places, 24/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 22/315 places, 24/610 transitions.
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (EQ s0 1) (EQ s2 1)) (AND (EQ s10 1) (EQ s13 1))), p3:(AND (EQ s14 1) (EQ s16 1)), p1:(AND (EQ s0 1) (EQ s2 1)), p0:(AND (EQ s6 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 27 steps with 5 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLFireability-15 finished in 606 ms.
All properties solved by simple procedures.
Total runtime 19719 ms.

BK_STOP 1716503124363

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AirplaneLD-PT-0100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-smll-171620128100168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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