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-171620128100173.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-0200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620128100173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.8M
-rw-r--r-- 1 mcc users 111K Apr 12 03:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 382K Apr 12 03:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 70K Apr 12 03:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 424K Apr 12 03:39 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 68K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 181K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 250K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 148K Apr 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 553K Apr 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 227K Apr 12 04:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 04:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 31K 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 872K 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-0200-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-0200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716503425800

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-0200
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 22:30:28] [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:30:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 22:30:28] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2024-05-23 22:30:28] [INFO ] Transformed 1419 places.
[2024-05-23 22:30:28] [INFO ] Transformed 1608 transitions.
[2024-05-23 22:30:28] [INFO ] Found NUPN structural information;
[2024-05-23 22:30:28] [INFO ] Parsed PT model containing 1419 places and 1608 transitions and 6128 arcs in 384 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 602 places and 0 transitions.
FORMULA AirplaneLD-PT-0200-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 318 out of 817 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 817/817 places, 1608/1608 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 814 transition count 1608
Discarding 492 places :
Symmetric choice reduction at 1 with 492 rule applications. Total rules 495 place count 322 transition count 1116
Iterating global reduction 1 with 492 rules applied. Total rules applied 987 place count 322 transition count 1116
Ensure Unique test removed 492 transitions
Reduce isomorphic transitions removed 492 transitions.
Iterating post reduction 1 with 492 rules applied. Total rules applied 1479 place count 322 transition count 624
Applied a total of 1479 rules in 77 ms. Remains 322 /817 variables (removed 495) and now considering 624/1608 (removed 984) transitions.
// Phase 1: matrix 624 rows 322 cols
[2024-05-23 22:30:29] [INFO ] Computed 1 invariants in 61 ms
[2024-05-23 22:30:29] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-23 22:30:29] [INFO ] Invariant cache hit.
[2024-05-23 22:30:30] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2024-05-23 22:30:30] [INFO ] Invariant cache hit.
[2024-05-23 22:30:30] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 322/817 places, 624/1608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1406 ms. Remains : 322/817 places, 624/1608 transitions.
Support contains 318 out of 322 places after structural reductions.
[2024-05-23 22:30:31] [INFO ] Flatten gal took : 104 ms
[2024-05-23 22:30:31] [INFO ] Flatten gal took : 87 ms
[2024-05-23 22:30:31] [INFO ] Input system was already deterministic with 624 transitions.
Incomplete random walk after 10000 steps, including 1283 resets, run finished after 844 ms. (steps per millisecond=11 ) properties (out of 26) seen :21
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-23 22:30:32] [INFO ] Invariant cache hit.
[2024-05-23 22:30:32] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:30:32] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 22:30:32] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:30:34] [INFO ] After 1028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 22:30:34] [INFO ] After 1827ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 712 ms.
[2024-05-23 22:30:35] [INFO ] After 2736ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 9 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 5 properties in 5 ms.
Computed a total of 322 stabilizing places and 624 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 322 transition count 624
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(G(!X(p0))) U p1)&&X(p2)))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 303 places :
Symmetric choice reduction at 0 with 303 rule applications. Total rules 303 place count 19 transition count 321
Iterating global reduction 0 with 303 rules applied. Total rules applied 606 place count 19 transition count 321
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Iterating post reduction 0 with 303 rules applied. Total rules applied 909 place count 19 transition count 18
Applied a total of 909 rules in 13 ms. Remains 19 /322 variables (removed 303) and now considering 18/624 (removed 606) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 22:30:36] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:30:36] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-23 22:30:36] [INFO ] Invariant cache hit.
[2024-05-23 22:30:36] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-23 22:30:36] [INFO ] Invariant cache hit.
[2024-05-23 22:30:36] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/322 places, 18/624 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 19/322 places, 18/624 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 382 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) p0), true, p0]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s17 1) (EQ s17 1) (EQ s17 1) (EQ s18 1) (EQ s18 1) (EQ s18 1) (EQ s18 1)), p2:(OR (EQ s0 0) (EQ s2 0)), p0:(AND (EQ s0 1) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 2 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-00 finished in 593 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)))'
Support contains 100 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 204 places :
Symmetric choice reduction at 0 with 204 rule applications. Total rules 204 place count 118 transition count 420
Iterating global reduction 0 with 204 rules applied. Total rules applied 408 place count 118 transition count 420
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 0 with 204 rules applied. Total rules applied 612 place count 118 transition count 216
Applied a total of 612 rules in 24 ms. Remains 118 /322 variables (removed 204) and now considering 216/624 (removed 408) transitions.
// Phase 1: matrix 216 rows 118 cols
[2024-05-23 22:30:36] [INFO ] Computed 1 invariants in 5 ms
[2024-05-23 22:30:36] [INFO ] Implicit Places using invariants in 59 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/322 places, 216/624 transitions.
Graph (complete) has 115 edges and 117 vertex of which 116 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 116 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 115 transition count 214
Applied a total of 3 rules in 7 ms. Remains 115 /117 variables (removed 2) and now considering 214/216 (removed 2) transitions.
// Phase 1: matrix 214 rows 115 cols
[2024-05-23 22:30:36] [INFO ] Computed 0 invariants in 7 ms
[2024-05-23 22:30:36] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-23 22:30:36] [INFO ] Invariant cache hit.
[2024-05-23 22:30:36] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/322 places, 214/624 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 290 ms. Remains : 115/322 places, 214/624 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s9 1) (EQ s32 1)) (AND (EQ s9 1) (EQ s97 1)) (AND (EQ s9 1) (EQ s36 1)) (AND (EQ s9 1) (EQ s101 1)) (AND (EQ s9 1) (EQ s40 1)) (AND (EQ s9...], 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-0200-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-01 finished in 368 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 100 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 205 places :
Symmetric choice reduction at 0 with 205 rule applications. Total rules 205 place count 117 transition count 419
Iterating global reduction 0 with 205 rules applied. Total rules applied 410 place count 117 transition count 419
Ensure Unique test removed 205 transitions
Reduce isomorphic transitions removed 205 transitions.
Iterating post reduction 0 with 205 rules applied. Total rules applied 615 place count 117 transition count 214
Applied a total of 615 rules in 16 ms. Remains 117 /322 variables (removed 205) and now considering 214/624 (removed 410) transitions.
// Phase 1: matrix 214 rows 117 cols
[2024-05-23 22:30:37] [INFO ] Computed 1 invariants in 3 ms
[2024-05-23 22:30:37] [INFO ] Implicit Places using invariants in 60 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/322 places, 214/624 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 116/322 places, 214/624 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-02 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 (AND (EQ s8 1) (EQ s32 1)) (AND (EQ s8 1) (EQ s93 1)) (AND (EQ s8 1) (EQ s28 1)) (AND (EQ s8 1) (EQ s89 1)) (AND (EQ s8 1) (EQ s24 1)) (AND (EQ s8 ...], 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-0200-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-02 finished in 207 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 (G(!p0)||(!p0&&G(!p1)))) U (G(!p0)||(p2&&(!p0 U (G(!p0)||(!p0&&G(!p1)))))))))'
Support contains 5 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 303 places :
Symmetric choice reduction at 0 with 303 rule applications. Total rules 303 place count 19 transition count 321
Iterating global reduction 0 with 303 rules applied. Total rules applied 606 place count 19 transition count 321
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Iterating post reduction 0 with 303 rules applied. Total rules applied 909 place count 19 transition count 18
Applied a total of 909 rules in 8 ms. Remains 19 /322 variables (removed 303) and now considering 18/624 (removed 606) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 22:30:37] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 22:30:37] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-23 22:30:37] [INFO ] Invariant cache hit.
[2024-05-23 22:30:37] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-23 22:30:37] [INFO ] Invariant cache hit.
[2024-05-23 22:30:37] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/322 places, 18/624 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 19/322 places, 18/624 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, p0, p1, (AND p1 p0), p0, p0]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(AND (EQ s0 1) (EQ s2 1)), p0:(AND (EQ s3 1) (EQ s5 1)), p2:(NEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 12597 reset in 334 ms.
Product exploration explored 100000 steps with 12600 reset in 272 ms.
Computed a total of 19 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : [(X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 1253 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 464 ms :[true, (AND p0 p1), p1, p0, p0, p0, p0, p0]
Incomplete random walk after 10000 steps, including 1265 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 22:30:40] [INFO ] Invariant cache hit.
[2024-05-23 22:30:40] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:30:40] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2)), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p1), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0) p2)), (F p0), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p0) p2))]
Knowledge based reduction with 10 factoid took 2536 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter insensitive) to 8 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 415 ms :[true, p1, (AND p1 p0), p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 375 ms :[true, p1, (AND p1 p0), p0, p0, p0, p0, p0]
Support contains 5 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Graph (complete) has 17 edges and 19 vertex of which 8 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Applied a total of 1 rules in 1 ms. Remains 8 /19 variables (removed 11) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-05-23 22:30:43] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:30:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-23 22:30:43] [INFO ] Invariant cache hit.
[2024-05-23 22:30:43] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-23 22:30:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 22:30:43] [INFO ] Invariant cache hit.
[2024-05-23 22:30:43] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/19 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 8/19 places, 8/18 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 10 factoid took 1266 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (AND p1 p0 p2), p0, (AND p0 p1), p1]
Incomplete random walk after 10000 steps, including 2219 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 954 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-23 22:30:45] [INFO ] Invariant cache hit.
[2024-05-23 22:30:45] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:30:45] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2)), (G (NOT (AND p1 p0 p2))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 (NOT p0))), (F p0), (F (AND p1 (NOT p0) p2)), (F p2), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 12 factoid took 3595 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[true, p0, (AND p0 p1 p2), (AND p0 p1), p1]
Stuttering acceptance computed with spot in 172 ms :[true, p0, (AND p0 p1 p2), (AND p0 p1), p1]
Stuttering acceptance computed with spot in 174 ms :[true, p0, (AND p0 p1 p2), (AND p0 p1), p1]
Product exploration explored 100000 steps with 22221 reset in 115 ms.
Product exploration explored 100000 steps with 22228 reset in 164 ms.
Built C files in :
/tmp/ltsmin12685590842771846304
[2024-05-23 22:30:49] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-23 22:30:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:30:49] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-23 22:30:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:30:49] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-23 22:30:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:30:49] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12685590842771846304
Running compilation step : cd /tmp/ltsmin12685590842771846304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 261 ms.
Running link step : cd /tmp/ltsmin12685590842771846304;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12685590842771846304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15860994538786205257.hoa' '--buchi-type=spotba'
LTSmin run took 82 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-PT-0200-LTLFireability-04 finished in 13091 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(p0)||G(F(p1))||G(p2)))'
Support contains 104 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 202 places :
Symmetric choice reduction at 0 with 202 rule applications. Total rules 202 place count 120 transition count 422
Iterating global reduction 0 with 202 rules applied. Total rules applied 404 place count 120 transition count 422
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Iterating post reduction 0 with 202 rules applied. Total rules applied 606 place count 120 transition count 220
Applied a total of 606 rules in 28 ms. Remains 120 /322 variables (removed 202) and now considering 220/624 (removed 404) transitions.
// Phase 1: matrix 220 rows 120 cols
[2024-05-23 22:30:50] [INFO ] Computed 1 invariants in 4 ms
[2024-05-23 22:30:50] [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 SI_LTL mode, iteration 1 : 119/322 places, 220/624 transitions.
Graph (complete) has 117 edges and 119 vertex of which 118 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 118 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 117 transition count 218
Applied a total of 3 rules in 8 ms. Remains 117 /119 variables (removed 2) and now considering 218/220 (removed 2) transitions.
// Phase 1: matrix 218 rows 117 cols
[2024-05-23 22:30:50] [INFO ] Computed 0 invariants in 2 ms
[2024-05-23 22:30:50] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-23 22:30:50] [INFO ] Invariant cache hit.
[2024-05-23 22:30:50] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/322 places, 218/624 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 117/322 places, 218/624 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s114 1), p2:(OR (AND (EQ s9 1) (EQ s70 1)) (AND (EQ s9 1) (EQ s74 1)) (AND (EQ s9 1) (EQ s13 1)) (AND (EQ s9 1) (EQ s78 1)) (AND (EQ s9 1) (EQ s17 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-07 finished in 459 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((F(p2)&&p1))))))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 303 places :
Symmetric choice reduction at 0 with 303 rule applications. Total rules 303 place count 19 transition count 321
Iterating global reduction 0 with 303 rules applied. Total rules applied 606 place count 19 transition count 321
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Iterating post reduction 0 with 303 rules applied. Total rules applied 909 place count 19 transition count 18
Applied a total of 909 rules in 8 ms. Remains 19 /322 variables (removed 303) and now considering 18/624 (removed 606) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 22:30:50] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 22:30:50] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-23 22:30:50] [INFO ] Invariant cache hit.
[2024-05-23 22:30:50] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-23 22:30:50] [INFO ] Invariant cache hit.
[2024-05-23 22:30:50] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/322 places, 18/624 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 19/322 places, 18/624 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (EQ s3 1) (EQ s5 1)), p0:(AND (EQ s3 1) (EQ s5 1)), p2:(AND (EQ s1 1) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-08 finished in 245 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' '!(((p0||X(p1)) U p2))'
Support contains 7 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 301 places :
Symmetric choice reduction at 0 with 301 rule applications. Total rules 301 place count 21 transition count 323
Iterating global reduction 0 with 301 rules applied. Total rules applied 602 place count 21 transition count 323
Ensure Unique test removed 301 transitions
Reduce isomorphic transitions removed 301 transitions.
Iterating post reduction 0 with 301 rules applied. Total rules applied 903 place count 21 transition count 22
Applied a total of 903 rules in 8 ms. Remains 21 /322 variables (removed 301) and now considering 22/624 (removed 602) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-23 22:30:50] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:30:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-23 22:30:51] [INFO ] Invariant cache hit.
[2024-05-23 22:30:51] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-23 22:30:51] [INFO ] Invariant cache hit.
[2024-05-23 22:30:51] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/322 places, 22/624 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 21/322 places, 22/624 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(AND (NOT (AND (EQ s6 1) (EQ s8 1) (EQ s20 1))) (EQ s1 1) (EQ s2 1)), p0:(EQ s20 1), p1:(AND (EQ s13 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-09 finished in 222 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(F(p1))))))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Graph (complete) has 322 edges and 322 vertex of which 17 are kept as prefixes of interest. Removing 305 places using SCC suffix rule.1 ms
Discarding 305 places :
Also discarding 602 output transitions
Drop transitions removed 602 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 12 transition count 17
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 12 transition count 17
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 16 place count 12 transition count 12
Applied a total of 16 rules in 6 ms. Remains 12 /322 variables (removed 310) and now considering 12/624 (removed 612) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-23 22:30:51] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 22:30:51] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-23 22:30:51] [INFO ] Invariant cache hit.
[2024-05-23 22:30:51] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-23 22:30:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 22:30:51] [INFO ] Invariant cache hit.
[2024-05-23 22:30:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/322 places, 12/624 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 12/322 places, 12/624 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-10 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 (EQ s6 1) (EQ s8 1)), p1:(AND (EQ s1 1) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-10 finished in 185 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(p0))||G(p1)))&&F(p2)))'
Support contains 6 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 301 places :
Symmetric choice reduction at 0 with 301 rule applications. Total rules 301 place count 21 transition count 323
Iterating global reduction 0 with 301 rules applied. Total rules applied 602 place count 21 transition count 323
Ensure Unique test removed 301 transitions
Reduce isomorphic transitions removed 301 transitions.
Iterating post reduction 0 with 301 rules applied. Total rules applied 903 place count 21 transition count 22
Applied a total of 903 rules in 7 ms. Remains 21 /322 variables (removed 301) and now considering 22/624 (removed 602) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-23 22:30:51] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 22:30:51] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-23 22:30:51] [INFO ] Invariant cache hit.
[2024-05-23 22:30:51] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-23 22:30:51] [INFO ] Invariant cache hit.
[2024-05-23 22:30:51] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/322 places, 22/624 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 21/322 places, 22/624 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 6}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (EQ s9 1) (EQ s12 1)), p1:(AND (EQ s13 1) (EQ s15 1)), p0:(AND (OR (EQ s13 0) (EQ s15 0) (EQ s0 0) (EQ s2 0)) (OR (EQ s13 0) (EQ s15 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-11 finished in 434 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)&&(X((!p1||F((p2 U (p3||G(p2)))))) U ((!p1&&X((!p1||F((p2 U (p3||G(p2)))))))||X(G((!p1||F((p2 U (p3||G(p2)))))))))))'
Support contains 5 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 302 places :
Symmetric choice reduction at 0 with 302 rule applications. Total rules 302 place count 20 transition count 322
Iterating global reduction 0 with 302 rules applied. Total rules applied 604 place count 20 transition count 322
Ensure Unique test removed 302 transitions
Reduce isomorphic transitions removed 302 transitions.
Iterating post reduction 0 with 302 rules applied. Total rules applied 906 place count 20 transition count 20
Applied a total of 906 rules in 7 ms. Remains 20 /322 variables (removed 302) and now considering 20/624 (removed 604) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-23 22:30:51] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 22:30:51] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-23 22:30:51] [INFO ] Invariant cache hit.
[2024-05-23 22:30:51] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-23 22:30:51] [INFO ] Invariant cache hit.
[2024-05-23 22:30:51] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/322 places, 20/624 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 20/322 places, 20/624 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), (NOT p0), (AND p1 (NOT p3) (NOT p2)), (AND p1 (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND p1 (NOT p3) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s16 0), p1:(AND (EQ s9 1) (EQ s11 1)), p3:(AND (NOT (AND (EQ s1 1) (EQ s2 1))) (NEQ s16 1)), p2:(NEQ s16 1)], 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]]
Product exploration explored 100000 steps with 32742 reset in 190 ms.
Product exploration explored 100000 steps with 32507 reset in 207 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 : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1))), (F (G p3)), (F (G p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p3))), (X (X p3))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 25 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0200-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0200-LTLFireability-12 finished in 854 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((G(p0)&&(p1||G(p2))))))'
Support contains 5 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 301 places :
Symmetric choice reduction at 0 with 301 rule applications. Total rules 301 place count 21 transition count 323
Iterating global reduction 0 with 301 rules applied. Total rules applied 602 place count 21 transition count 323
Ensure Unique test removed 301 transitions
Reduce isomorphic transitions removed 301 transitions.
Iterating post reduction 0 with 301 rules applied. Total rules applied 903 place count 21 transition count 22
Applied a total of 903 rules in 6 ms. Remains 21 /322 variables (removed 301) and now considering 22/624 (removed 602) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-23 22:30:52] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 22:30:52] [INFO ] Implicit Places using invariants in 28 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/322 places, 22/624 transitions.
Applied a total of 0 rules in 1 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 36 ms. Remains : 20/322 places, 22/624 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={1} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s9 1) (OR (EQ s5 0) (EQ s7 0))), p1:(EQ s17 0), p2:(EQ s16 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-13 finished in 277 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 2 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Graph (complete) has 322 edges and 322 vertex of which 17 are kept as prefixes of interest. Removing 305 places using SCC suffix rule.2 ms
Discarding 305 places :
Also discarding 602 output transitions
Drop transitions removed 602 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 12 transition count 17
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 12 transition count 17
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 16 place count 12 transition count 12
Applied a total of 16 rules in 6 ms. Remains 12 /322 variables (removed 310) and now considering 12/624 (removed 612) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-23 22:30:52] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 22:30:52] [INFO ] Implicit Places using invariants in 25 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/322 places, 12/624 transitions.
Graph (complete) has 9 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 10
Applied a total of 3 rules in 1 ms. Remains 9 /11 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 9 cols
[2024-05-23 22:30:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 22:30:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 22:30:53] [INFO ] Invariant cache hit.
[2024-05-23 22:30:53] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/322 places, 10/624 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83 ms. Remains : 9/322 places, 10/624 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s5 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 3 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-14 finished in 190 ms.
All properties solved by simple procedures.
Total runtime 24727 ms.

BK_STOP 1716503455055

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

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