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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 48M
-rw-r--r-- 1 mcc users 2.0M Apr 12 06:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.7M Apr 12 06:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 729K Apr 12 04:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.9M Apr 12 04:45 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 382K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 962K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 382K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8M Apr 12 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13M Apr 12 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 994K Apr 12 08:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.1M Apr 12 08:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 107K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 191K 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 8.7M 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-2000-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716508243779

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-2000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 23:50:46] [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 23:50:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 23:50:47] [INFO ] Load time of PNML (sax parser for PT used): 953 ms
[2024-05-23 23:50:48] [INFO ] Transformed 14019 places.
[2024-05-23 23:50:48] [INFO ] Transformed 16008 transitions.
[2024-05-23 23:50:48] [INFO ] Found NUPN structural information;
[2024-05-23 23:50:48] [INFO ] Parsed PT model containing 14019 places and 16008 transitions and 61028 arcs in 1329 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 96 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 6002 places and 0 transitions.
FORMULA AirplaneLD-PT-2000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-2000-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-2000-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-2000-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4016 out of 8017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8017/8017 places, 16008/16008 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8014 transition count 16008
Discarding 3996 places :
Symmetric choice reduction at 1 with 3996 rule applications. Total rules 3999 place count 4018 transition count 12012
Iterating global reduction 1 with 3996 rules applied. Total rules applied 7995 place count 4018 transition count 12012
Ensure Unique test removed 3996 transitions
Reduce isomorphic transitions removed 3996 transitions.
Iterating post reduction 1 with 3996 rules applied. Total rules applied 11991 place count 4018 transition count 8016
Applied a total of 11991 rules in 559 ms. Remains 4018 /8017 variables (removed 3999) and now considering 8016/16008 (removed 7992) transitions.
// Phase 1: matrix 8016 rows 4018 cols
[2024-05-23 23:50:52] [INFO ] Computed 1 invariants in 2176 ms
[2024-05-23 23:50:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-23 23:50:53] [INFO ] Implicit Places using invariants in 3889 ms returned []
[2024-05-23 23:50:53] [INFO ] Invariant cache hit.
[2024-05-23 23:50:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-23 23:50:54] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 4808 ms to find 0 implicit places.
[2024-05-23 23:50:54] [INFO ] Invariant cache hit.
[2024-05-23 23:50:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-23 23:51:04] [INFO ] Dead Transitions using invariants and state equation in 9431 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4018/8017 places, 8016/16008 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14805 ms. Remains : 4018/8017 places, 8016/16008 transitions.
Support contains 4016 out of 4018 places after structural reductions.
[2024-05-23 23:51:05] [INFO ] Flatten gal took : 710 ms
[2024-05-23 23:51:05] [INFO ] Flatten gal took : 335 ms
[2024-05-23 23:51:06] [INFO ] Input system was already deterministic with 8016 transitions.
Incomplete random walk after 10000 steps, including 1294 resets, run finished after 4277 ms. (steps per millisecond=2 ) properties (out of 22) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 680 ms. (steps per millisecond=14 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-23 23:51:11] [INFO ] Invariant cache hit.
[2024-05-23 23:51:14] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 23:51:15] [INFO ] After 1906ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 23:51:16] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 23:51:24] [INFO ] After 6840ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 23:51:27] [INFO ] After 10337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2057 ms.
[2024-05-23 23:51:29] [INFO ] After 14173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=2 )
Parikh walk visited 6 properties in 59 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 4018 stabilizing places and 8016 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4018 transition count 8016
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(F(p0)))'
Support contains 1002 out of 4018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4018/4018 places, 8016/8016 transitions.
Discarding 2999 places :
Symmetric choice reduction at 0 with 2999 rule applications. Total rules 2999 place count 1019 transition count 5017
Iterating global reduction 0 with 2999 rules applied. Total rules applied 5998 place count 1019 transition count 5017
Ensure Unique test removed 2999 transitions
Reduce isomorphic transitions removed 2999 transitions.
Iterating post reduction 0 with 2999 rules applied. Total rules applied 8997 place count 1019 transition count 2018
Applied a total of 8997 rules in 352 ms. Remains 1019 /4018 variables (removed 2999) and now considering 2018/8016 (removed 5998) transitions.
// Phase 1: matrix 2018 rows 1019 cols
[2024-05-23 23:51:30] [INFO ] Computed 1 invariants in 136 ms
[2024-05-23 23:51:31] [INFO ] Implicit Places using invariants in 330 ms returned [1018]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 334 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1018/4018 places, 2018/8016 transitions.
Applied a total of 0 rules in 12 ms. Remains 1018 /1018 variables (removed 0) and now considering 2018/2018 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 700 ms. Remains : 1018/4018 places, 2018/8016 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 255 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s862 1) (EQ s1015 1)) (AND (EQ s383 1) (EQ s1015 1)) (AND (EQ s412 1) (EQ s1015 1)) (AND (EQ s833 1) (EQ s1015 1)) (AND (EQ s354 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 6 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-01 finished in 1071 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 3000 out of 4018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4018/4018 places, 8016/8016 transitions.
Graph (complete) has 5017 edges and 4018 vertex of which 4013 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.31 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Discarding 1001 places :
Symmetric choice reduction at 0 with 1001 rule applications. Total rules 1002 place count 3012 transition count 7009
Iterating global reduction 0 with 1001 rules applied. Total rules applied 2003 place count 3012 transition count 7009
Ensure Unique test removed 1001 transitions
Reduce isomorphic transitions removed 1001 transitions.
Iterating post reduction 0 with 1001 rules applied. Total rules applied 3004 place count 3012 transition count 6008
Applied a total of 3004 rules in 226 ms. Remains 3012 /4018 variables (removed 1006) and now considering 6008/8016 (removed 2008) transitions.
// Phase 1: matrix 6008 rows 3012 cols
[2024-05-23 23:51:32] [INFO ] Computed 1 invariants in 1168 ms
[2024-05-23 23:51:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-23 23:51:33] [INFO ] Implicit Places using invariants in 1926 ms returned [3011]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1930 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3011/4018 places, 6008/8016 transitions.
Graph (complete) has 3009 edges and 3011 vertex of which 3010 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 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 3010 transition count 6006
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 3009 transition count 6006
Applied a total of 3 rules in 93 ms. Remains 3009 /3011 variables (removed 2) and now considering 6006/6008 (removed 2) transitions.
// Phase 1: matrix 6006 rows 3009 cols
[2024-05-23 23:51:35] [INFO ] Computed 0 invariants in 1414 ms
[2024-05-23 23:51:35] [INFO ] Implicit Places using invariants in 1838 ms returned []
[2024-05-23 23:51:35] [INFO ] Invariant cache hit.
[2024-05-23 23:51:36] [INFO ] Implicit Places using invariants and state equation in 1537 ms returned []
Implicit Place search using SMT with State Equation took 3377 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3009/4018 places, 6006/8016 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5629 ms. Remains : 3009/4018 places, 6006/8016 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (AND (EQ s2548 1) (EQ s3007 1)) (AND (EQ s2069 1) (EQ s3007 1)) (AND (EQ s1111 1) (EQ s3007 1)) (AND (EQ s2127 1) (EQ s3007 1)) (AND (EQ s2490...], 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 6 steps with 0 reset in 7 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-03 finished in 5747 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(p1)&&p0) U X((G(p2) U p3))))'
Support contains 4 out of 4018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4018/4018 places, 8016/8016 transitions.
Discarding 3999 places :
Symmetric choice reduction at 0 with 3999 rule applications. Total rules 3999 place count 19 transition count 4017
Iterating global reduction 0 with 3999 rules applied. Total rules applied 7998 place count 19 transition count 4017
Ensure Unique test removed 3999 transitions
Reduce isomorphic transitions removed 3999 transitions.
Iterating post reduction 0 with 3999 rules applied. Total rules applied 11997 place count 19 transition count 18
Applied a total of 11997 rules in 110 ms. Remains 19 /4018 variables (removed 3999) and now considering 18/8016 (removed 7998) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 23:51:37] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 23:51:37] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 23:51:37] [INFO ] Invariant cache hit.
[2024-05-23 23:51:37] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-23 23:51:37] [INFO ] Invariant cache hit.
[2024-05-23 23:51:37] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/4018 places, 18/8016 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 19/4018 places, 18/8016 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p3), (NOT p3), (NOT p3), true, (NOT p2)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3) p1) (AND (NOT p3) p2 (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p3) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s18 1)), p3:(EQ s11 1), p2:(AND (EQ s13 1) (EQ s18 1)), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 2 reset in 0 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-05 finished in 543 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 4018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4018/4018 places, 8016/8016 transitions.
Discarding 3999 places :
Symmetric choice reduction at 0 with 3999 rule applications. Total rules 3999 place count 19 transition count 4017
Iterating global reduction 0 with 3999 rules applied. Total rules applied 7998 place count 19 transition count 4017
Ensure Unique test removed 3999 transitions
Reduce isomorphic transitions removed 3999 transitions.
Iterating post reduction 0 with 3999 rules applied. Total rules applied 11997 place count 19 transition count 18
Applied a total of 11997 rules in 121 ms. Remains 19 /4018 variables (removed 3999) and now considering 18/8016 (removed 7998) transitions.
[2024-05-23 23:51:37] [INFO ] Invariant cache hit.
[2024-05-23 23:51:37] [INFO ] Implicit Places using invariants in 32 ms returned [18]
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/4018 places, 18/8016 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 155 ms. Remains : 18/4018 places, 18/8016 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-2000-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 s10 1) (NEQ s17 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 14 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-06 finished in 267 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(((p1||X(!p2))&&p0)) U G((p1||X(p3)))))'
Support contains 6 out of 4018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4018/4018 places, 8016/8016 transitions.
Discarding 3997 places :
Symmetric choice reduction at 0 with 3997 rule applications. Total rules 3997 place count 21 transition count 4019
Iterating global reduction 0 with 3997 rules applied. Total rules applied 7994 place count 21 transition count 4019
Ensure Unique test removed 3997 transitions
Reduce isomorphic transitions removed 3997 transitions.
Iterating post reduction 0 with 3997 rules applied. Total rules applied 11991 place count 21 transition count 22
Applied a total of 11991 rules in 105 ms. Remains 21 /4018 variables (removed 3997) and now considering 22/8016 (removed 7994) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-23 23:51:38] [INFO ] Computed 1 invariants in 2 ms
[2024-05-23 23:51:38] [INFO ] Implicit Places using invariants in 30 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/4018 places, 22/8016 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 137 ms. Remains : 20/4018 places, 22/8016 transitions.
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) p0 (NOT p3) p2), true, (AND p3 p2), (AND (NOT p3) p0), (AND (NOT p1) p0 (NOT p3)), (AND p0 p2 (NOT p3))]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p3 p2), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p3) p0), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) p0 p2), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) p3 p0 p2), acceptance={} source=7 dest: 5}, { cond=(AND p3 p0 p2), acceptance={} source=7 dest: 6}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s16 1)), p3:(AND (EQ s9 1) (EQ s18 1)), p0:(AND (EQ s12 1) (EQ s19 1)), p2:(OR (NEQ s12 1) (NEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 2 reset in 1 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-08 finished in 496 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 2 out of 4018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4018/4018 places, 8016/8016 transitions.
Graph (complete) has 5017 edges and 4018 vertex of which 8 are kept as prefixes of interest. Removing 4010 places using SCC suffix rule.6 ms
Discarding 4010 places :
Also discarding 8008 output transitions
Drop transitions removed 8008 transitions
Applied a total of 1 rules in 39 ms. Remains 8 /4018 variables (removed 4010) and now considering 8/8016 (removed 8008) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-05-23 23:51:38] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 23:51:38] [INFO ] Implicit Places using invariants in 24 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/4018 places, 8/8016 transitions.
Graph (complete) has 5 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 16 ms. Remains 6 /7 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-23 23:51:38] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 23:51:38] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 23:51:38] [INFO ] Invariant cache hit.
[2024-05-23 23:51:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/4018 places, 7/8016 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 130 ms. Remains : 6/4018 places, 7/8016 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s5 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 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-09 finished in 190 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((X(F(p0))&&(X(G(p2))||p1))))'
Support contains 2 out of 4018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4018/4018 places, 8016/8016 transitions.
Discarding 3999 places :
Symmetric choice reduction at 0 with 3999 rule applications. Total rules 3999 place count 19 transition count 4017
Iterating global reduction 0 with 3999 rules applied. Total rules applied 7998 place count 19 transition count 4017
Ensure Unique test removed 3999 transitions
Reduce isomorphic transitions removed 3999 transitions.
Iterating post reduction 0 with 3999 rules applied. Total rules applied 11997 place count 19 transition count 18
Applied a total of 11997 rules in 88 ms. Remains 19 /4018 variables (removed 3999) and now considering 18/8016 (removed 7998) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 23:51:38] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 23:51:38] [INFO ] Implicit Places using invariants in 27 ms returned [18]
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 : 18/4018 places, 18/8016 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 120 ms. Remains : 18/4018 places, 18/8016 transitions.
Stuttering acceptance computed with spot in 199 ms :[(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-2000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s0 1) (EQ s5 1)), p0:(EQ s0 0), p2:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24768 reset in 286 ms.
Product exploration explored 100000 steps with 24820 reset in 221 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 p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (NOT p2)), (X p2), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-2000-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-2000-LTLFireability-10 finished in 909 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((!p0&&X(p1))))))'
Support contains 3 out of 4018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4018/4018 places, 8016/8016 transitions.
Discarding 3998 places :
Symmetric choice reduction at 0 with 3998 rule applications. Total rules 3998 place count 20 transition count 4018
Iterating global reduction 0 with 3998 rules applied. Total rules applied 7996 place count 20 transition count 4018
Ensure Unique test removed 3998 transitions
Reduce isomorphic transitions removed 3998 transitions.
Iterating post reduction 0 with 3998 rules applied. Total rules applied 11994 place count 20 transition count 20
Applied a total of 11994 rules in 86 ms. Remains 20 /4018 variables (removed 3998) and now considering 20/8016 (removed 7996) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-23 23:51:39] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 23:51:39] [INFO ] Implicit Places using invariants in 28 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/4018 places, 20/8016 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 19/4018 places, 20/8016 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s9 1), p1:(AND (EQ s5 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-11 finished in 308 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(((X(F(p1))||p0)&&(X(F(p1))||G(p2))))))'
Support contains 5 out of 4018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4018/4018 places, 8016/8016 transitions.
Graph (complete) has 5017 edges and 4018 vertex of which 9 are kept as prefixes of interest. Removing 4009 places using SCC suffix rule.4 ms
Discarding 4009 places :
Also discarding 8005 output transitions
Drop transitions removed 8005 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 9 transition count 9
Applied a total of 3 rules in 16 ms. Remains 9 /4018 variables (removed 4009) and now considering 9/8016 (removed 8007) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-23 23:51:39] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 23:51:39] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 23:51:39] [INFO ] Invariant cache hit.
[2024-05-23 23:51:39] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-23 23:51:39] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 23:51:39] [INFO ] Invariant cache hit.
[2024-05-23 23:51:39] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/4018 places, 9/8016 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 9/4018 places, 9/8016 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s8 0)), p2:(OR (EQ s3 0) (EQ s7 0)), p1:(EQ s0 0)], nbAcceptance=2, 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 24589 reset in 233 ms.
Product exploration explored 100000 steps with 24565 reset in 209 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-2000-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-2000-LTLFireability-13 finished in 725 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&&F(p1))) U X(X((p2 U X(G(!p3)))))))'
Support contains 6 out of 4018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4018/4018 places, 8016/8016 transitions.
Discarding 3997 places :
Symmetric choice reduction at 0 with 3997 rule applications. Total rules 3997 place count 21 transition count 4019
Iterating global reduction 0 with 3997 rules applied. Total rules applied 7994 place count 21 transition count 4019
Ensure Unique test removed 3997 transitions
Reduce isomorphic transitions removed 3997 transitions.
Iterating post reduction 0 with 3997 rules applied. Total rules applied 11991 place count 21 transition count 22
Applied a total of 11991 rules in 80 ms. Remains 21 /4018 variables (removed 3997) and now considering 22/8016 (removed 7994) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-23 23:51:40] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 23:51:40] [INFO ] Implicit Places using invariants in 29 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/4018 places, 22/8016 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 111 ms. Remains : 20/4018 places, 22/8016 transitions.
Stuttering acceptance computed with spot in 756 ms :[p3, p3, p3, p3, p3, true, (OR (AND (NOT p1) (NOT p2) p3) (AND p0 (NOT p2) p3)), (AND p3 (NOT p2)), (AND (NOT p1) p3), (AND (NOT p1) p3), (OR (AND (NOT p1) p3) (AND p0 p3)), (OR (AND (NOT p1) p3) (AND p0 p3)), (OR (AND (NOT p1) p3) (AND p0 p3)), p3, p3, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}, { cond=(NOT p0), acceptance={} source=2 dest: 11}, { cond=(NOT p0), acceptance={} source=2 dest: 13}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=p3, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p3), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 11}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 15}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p2 p3), acceptance={0} source=9 dest: 9}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=10 dest: 3}, { cond=(AND p0 p3), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=10 dest: 15}, { cond=(AND (NOT p0) p3), acceptance={} source=10 dest: 16}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=11 dest: 3}, { cond=(AND p0 p2), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p0) p2), acceptance={} source=11 dest: 11}], [{ cond=p0, acceptance={} source=12 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=12 dest: 9}, { cond=(NOT p0), acceptance={} source=12 dest: 11}], [{ cond=(NOT p0), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=13 dest: 13}, { cond=(AND (NOT p0) p3), acceptance={0} source=13 dest: 13}, { cond=p0, acceptance={} source=13 dest: 14}], [{ cond=true, acceptance={} source=14 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=15 dest: 15}], [{ cond=p0, acceptance={} source=16 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=16 dest: 15}, { cond=(NOT p0), acceptance={} source=16 dest: 16}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s18 1)), p3:(EQ s13 1), p2:(EQ s0 1), p1:(AND (EQ s2 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-14 finished in 900 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 4 out of 4018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4018/4018 places, 8016/8016 transitions.
Graph (complete) has 5017 edges and 4018 vertex of which 4013 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.12 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Discarding 3997 places :
Symmetric choice reduction at 0 with 3997 rule applications. Total rules 3998 place count 16 transition count 4013
Iterating global reduction 0 with 3997 rules applied. Total rules applied 7995 place count 16 transition count 4013
Ensure Unique test removed 3997 transitions
Reduce isomorphic transitions removed 3997 transitions.
Iterating post reduction 0 with 3997 rules applied. Total rules applied 11992 place count 16 transition count 16
Applied a total of 11992 rules in 193 ms. Remains 16 /4018 variables (removed 4002) and now considering 16/8016 (removed 8000) transitions.
// Phase 1: matrix 16 rows 16 cols
[2024-05-23 23:51:41] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 23:51:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 23:51:41] [INFO ] Invariant cache hit.
[2024-05-23 23:51:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-23 23:51:41] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 23:51:41] [INFO ] Invariant cache hit.
[2024-05-23 23:51:41] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/4018 places, 16/8016 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 16/4018 places, 16/8016 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (NEQ s11 1) (NEQ s15 1)) (OR (EQ s2 0) (EQ s12 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14529 reset in 110 ms.
Product exploration explored 100000 steps with 14531 reset in 128 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
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, (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-2000-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-2000-LTLFireability-15 finished in 699 ms.
All properties solved by simple procedures.
Total runtime 55364 ms.

BK_STOP 1716508303556

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

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