About the Execution of 2023-gold for AirplaneLD-COL-0200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 441.716 | 27468.00 | 40290.00 | 698.50 | FFFTTTFFTFFTTFTF | normal |
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-171620128000128.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-COL-0200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620128000128
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.4K Apr 12 03:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 12 03:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 03:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 03:38 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 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 04:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K 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-COL-0200-LTLFireability-00
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-01
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-02
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-03
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-04
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-05
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-06
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-07
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-08
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-09
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-10
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-11
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-12
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-13
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-14
FORMULA_NAME AirplaneLD-COL-0200-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716497273801
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-COL-0200
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-23 20:47:56] [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 20:47:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:47:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-23 20:47:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-23 20:47:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 964 ms
[2024-05-23 20:47:57] [INFO ] Detected 3 constant HL places corresponding to 602 PT places.
[2024-05-23 20:47:57] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 1419 PT places and 2412.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-23 20:47:57] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 9 ms.
[2024-05-23 20:47:57] [INFO ] Skeletonized 15 HLPN properties in 4 ms. Removed 1 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA AirplaneLD-COL-0200-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 15
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 4 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 17 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 9 steps, including 0 resets, run visited all 5 properties in 15 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-23 20:47:58] [INFO ] Flatten gal took : 20 ms
[2024-05-23 20:47:58] [INFO ] Flatten gal took : 6 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:400) in guard (OR (GEQ $A 199) (EQ $A 399))introduces in Altitude(400) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:400) in guard (AND (LT $A 199) (NEQ $A 399))introduces in Altitude(400) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 400 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 199) (EQ $A 399)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 199) (NEQ $A 399)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:200) in guard (OR (LEQ $S 99) (EQ $S 199))introduces in Speed(200) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:200) in guard (AND (GT $S 99) (NEQ $S 199))introduces in Speed(200) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:200) in guard (OR (LEQ $S 99) (EQ $S 199))introduces in Speed(200) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:200) in guard (AND (GT $S 99) (NEQ $S 199))introduces in Speed(200) partition with 2 elements
Sort wr.t. initial and guards Speed has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 200 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 99) (EQ $S 199)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 99) (NEQ $S 199)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 99) (EQ $S 199)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 99) (NEQ $S 199)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2024-05-23 20:47:58] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 36 ms.
[2024-05-23 20:47:58] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
[2024-05-23 20:47:58] [INFO ] Reduced 1 identical enabling conditions.
Reduce places removed 6 places and 0 transitions.
FORMULA AirplaneLD-COL-0200-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0200-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0200-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Applied a total of 3 rules in 11 ms. Remains 20 /23 variables (removed 3) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-23 20:47:58] [INFO ] Computed 1 invariants in 5 ms
[2024-05-23 20:47:58] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-23 20:47:58] [INFO ] Invariant cache hit.
[2024-05-23 20:47:58] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-23 20:47:58] [INFO ] Invariant cache hit.
[2024-05-23 20:47:58] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 20/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 20/23 places, 20/20 transitions.
Support contains 19 out of 20 places after structural reductions.
[2024-05-23 20:47:58] [INFO ] Flatten gal took : 9 ms
[2024-05-23 20:47:58] [INFO ] Flatten gal took : 8 ms
[2024-05-23 20:47:58] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 514 steps, including 66 resets, run visited all 16 properties in 66 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 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).
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(!p0)))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 5 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 20:47:59] [INFO ] Computed 1 invariants in 3 ms
[2024-05-23 20:47:59] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-23 20:47:59] [INFO ] Invariant cache hit.
[2024-05-23 20:47:59] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-23 20:47:59] [INFO ] Invariant cache hit.
[2024-05-23 20:47:59] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/20 places, 18/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 19/20 places, 18/20 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 422 ms :[p0, p0, true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : AirplaneLD-COL-0200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s9 1) (GEQ s12 1)), p1:(OR (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 4 reset in 3 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-00 finished in 736 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 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 6 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-23 20:47:59] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 20:47:59] [INFO ] Implicit Places using invariants in 45 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/20 places, 20/20 transitions.
Graph (complete) has 17 edges and 19 vertex of which 18 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 18 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 17 transition count 18
Applied a total of 3 rules in 6 ms. Remains 17 /19 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 17 cols
[2024-05-23 20:47:59] [INFO ] Computed 0 invariants in 2 ms
[2024-05-23 20:47:59] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-23 20:47:59] [INFO ] Invariant cache hit.
[2024-05-23 20:48:00] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/20 places, 18/20 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 17/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-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:(AND (GEQ s5 1) (GEQ s15 1))], 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 0 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-01 finished in 231 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 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 2 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 20:48:00] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 20:48:00] [INFO ] Implicit Places using invariants in 50 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/20 places, 18/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 18/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-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:(AND (GEQ s6 1) (GEQ s15 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 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-02 finished in 210 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 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 3 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
[2024-05-23 20:48:00] [INFO ] Invariant cache hit.
[2024-05-23 20:48:00] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-23 20:48:00] [INFO ] Invariant cache hit.
[2024-05-23 20:48:00] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-23 20:48:00] [INFO ] Invariant cache hit.
[2024-05-23 20:48:00] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/20 places, 18/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 19/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, p0, p1, (AND p1 p0), p0, p0]
Running random walk in product with property : AirplaneLD-COL-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 (GEQ s9 1) (GEQ s12 1)), p0:(AND (GEQ s8 1) (GEQ s11 1)), p2:(LT s4 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 12586 reset in 517 ms.
Product exploration explored 100000 steps with 12603 reset in 358 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)), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : [(X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (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) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT 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 1482 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 316 ms :[true, (AND p0 p1), p1, p0, p0, p0, p0, p0]
Incomplete random walk after 10000 steps, including 1255 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 20:48:03] [INFO ] Invariant cache hit.
[2024-05-23 20:48:03] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 20:48:03] [INFO ] After 49ms 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)), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND p0 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 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (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) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT 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 2666 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 341 ms :[true, p1, (AND p1 p0), p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 394 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 2 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 20:48:07] [INFO ] Computed 1 invariants in 2 ms
[2024-05-23 20:48:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-23 20:48:07] [INFO ] Invariant cache hit.
[2024-05-23 20:48:07] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-23 20:48:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 20:48:07] [INFO ] Invariant cache hit.
[2024-05-23 20:48:07] [INFO ] Dead Transitions using invariants and state equation in 28 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 152 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 (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : [(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 (AND (NOT p1) (NOT p0) p2)), (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) p2))), (X (X (NOT (AND (NOT 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 1817 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 222 ms :[true, (AND p1 p0 p2), p0, (AND p0 p1), p1]
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 953 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-23 20:48:09] [INFO ] Invariant cache hit.
[2024-05-23 20:48:09] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 20:48:09] [INFO ] After 48ms 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 (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (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 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 (AND (NOT p1) (NOT p0) p2)), (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) p2))), (X (X (NOT (AND (NOT 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 4429 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 261 ms :[true, p0, (AND p0 p1 p2), (AND p0 p1), p1]
Stuttering acceptance computed with spot in 216 ms :[true, p0, (AND p0 p1 p2), (AND p0 p1), p1]
Stuttering acceptance computed with spot in 230 ms :[true, p0, (AND p0 p1 p2), (AND p0 p1), p1]
Product exploration explored 100000 steps with 22214 reset in 225 ms.
Product exploration explored 100000 steps with 22246 reset in 202 ms.
Built C files in :
/tmp/ltsmin5521426943863332209
[2024-05-23 20:48:15] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-23 20:48:15] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:48:15] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-23 20:48:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:48:15] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-23 20:48:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:48:15] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5521426943863332209
Running compilation step : cd /tmp/ltsmin5521426943863332209;'/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 368 ms.
Running link step : cd /tmp/ltsmin5521426943863332209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin5521426943863332209;'/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/stateBased15096038920890478985.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-COL-0200-LTLFireability-04 finished in 15686 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 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-23 20:48:15] [INFO ] Computed 1 invariants in 2 ms
[2024-05-23 20:48:16] [INFO ] Implicit Places using invariants in 47 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/20 places, 20/20 transitions.
Graph (complete) has 17 edges and 19 vertex of which 18 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 18 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 17 transition count 18
Applied a total of 3 rules in 6 ms. Remains 17 /19 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 17 cols
[2024-05-23 20:48:16] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 20:48:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-23 20:48:16] [INFO ] Invariant cache hit.
[2024-05-23 20:48:16] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/20 places, 18/20 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 153 ms. Remains : 17/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 268 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-COL-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:(GEQ s2 1), p2:(AND (GEQ s5 1) (GEQ s16 1)), p1:(GEQ s0 1)], 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 0 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-07 finished in 453 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(F((X(!p1)||p0)))))'
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 4 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 20:48:16] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 20:48:16] [INFO ] Implicit Places using invariants in 67 ms returned [9]
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 : 18/20 places, 18/20 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 75 ms. Remains : 18/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : AirplaneLD-COL-0200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(OR (LT s8 1) (LT s10 1)), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 318 ms.
Product exploration explored 100000 steps with 33333 reset in 328 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-COL-0200-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0200-LTLFireability-08 finished in 1172 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 (F(p2)&&p1)))'
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-05-23 20:48:17] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 20:48:17] [INFO ] Implicit Places using invariants in 32 ms returned [9]
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 : 19/20 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 19/20 places, 20/20 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) p0), (NOT p2)]
Running random walk in product with property : AirplaneLD-COL-0200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s8 1) (GEQ s10 1)), p2:(AND (GEQ s7 1) (GEQ s13 1)), p0:(AND (GEQ s5 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-09 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((G(((F(G(p1)) U p2)||X(p3)))&&p0)))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-23 20:48:17] [INFO ] Invariant cache hit.
[2024-05-23 20:48:17] [INFO ] Implicit Places using invariants in 32 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/20 places, 20/20 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 37 ms. Remains : 19/20 places, 20/20 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (NOT p2)]
Running random walk in product with property : AirplaneLD-COL-0200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s18 1)), p2:(GEQ s1 1), p3:(AND (GEQ s5 1) (GEQ s18 1)), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-10 finished in 348 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 U !p1))))'
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-23 20:48:18] [INFO ] Invariant cache hit.
[2024-05-23 20:48:18] [INFO ] Implicit Places using invariants in 42 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/20 places, 20/20 transitions.
Graph (complete) has 17 edges and 19 vertex of which 18 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 18 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 17 transition count 18
Applied a total of 3 rules in 7 ms. Remains 17 /19 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 17 cols
[2024-05-23 20:48:18] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 20:48:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-23 20:48:18] [INFO ] Invariant cache hit.
[2024-05-23 20:48:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/20 places, 18/20 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 17/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 103 ms :[p1, p1]
Running random walk in product with property : AirplaneLD-COL-0200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s16 1)), p0:(OR (AND (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s6 1) (GEQ s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14399 reset in 176 ms.
Product exploration explored 100000 steps with 14387 reset in 502 ms.
Computed a total of 17 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 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)), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-COL-0200-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0200-LTLFireability-12 finished in 971 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 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Graph (complete) has 18 edges and 20 vertex of which 1 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1 transition count 1
Applied a total of 2 rules in 2 ms. Remains 1 /20 variables (removed 19) and now considering 1/20 (removed 19) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-23 20:48:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 20:48:19] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-23 20:48:19] [INFO ] Invariant cache hit.
[2024-05-23 20:48:19] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-23 20:48:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 20:48:19] [INFO ] Invariant cache hit.
[2024-05-23 20:48:19] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/20 places, 1/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 1/20 places, 1/20 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], 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 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-13 finished in 118 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 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Graph (complete) has 18 edges and 20 vertex of which 8 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Applied a total of 1 rules in 2 ms. Remains 8 /20 variables (removed 12) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-05-23 20:48:19] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 20:48:19] [INFO ] Implicit Places using invariants in 33 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/20 places, 8/20 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 5 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 20:48:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 20:48:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 20:48:19] [INFO ] Invariant cache hit.
[2024-05-23 20:48:19] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/20 places, 7/20 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 6/20 places, 7/20 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-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 (LT s0 1) (OR (LT s2 1) (LT s3 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]]
Product exploration explored 100000 steps with 31071 reset in 88 ms.
Product exploration explored 100000 steps with 31097 reset in 142 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-COL-0200-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0200-LTLFireability-14 finished in 480 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)))'
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 3 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-23 20:48:19] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 20:48:19] [INFO ] Implicit Places using invariants in 40 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/20 places, 18/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 18/20 places, 18/20 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-COL-0200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0200-LTLFireability-15 finished in 155 ms.
All properties solved by simple procedures.
Total runtime 23247 ms.
BK_STOP 1716497301269
--------------------
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-COL-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-COL-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-171620128000128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-0200.tgz
mv AirplaneLD-COL-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 '
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 ;