About the Execution of LoLa+red for DrinkVendingMachine-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 399.352 | 18925.00 | 30308.00 | 640.80 | TFTFFFFFTFFFFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r135-smll-167819414800580.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DrinkVendingMachine-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414800580
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.4K Feb 26 07:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 07:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 06:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 06:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K Feb 26 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 20:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 20:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 24K Mar 5 18:22 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 DrinkVendingMachine-COL-10-LTLFireability-00
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-01
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-02
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-03
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-04
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-05
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-06
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-07
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-08
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-09
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-10
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-11
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-12
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-13
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-14
FORMULA_NAME DrinkVendingMachine-COL-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678424539152
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 05:02:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 05:02:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 05:02:21] [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.
[2023-03-10 05:02:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-10 05:02:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 695 ms
[2023-03-10 05:02:22] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 120 PT places and 444460.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-10 05:02:22] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 5 ms.
[2023-03-10 05:02:22] [INFO ] Skeletonized 8 HLPN properties in 2 ms. Removed 8 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 4 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 186 ms. (steps per millisecond=0 )
[2023-03-10 05:02:23] [INFO ] Flatten gal took : 20 ms
[2023-03-10 05:02:23] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate0 : guard parameter $x(Quality:40) in guard (LEQ $x 9)introduces in Quality(40) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:40) in guard (AND (GT $x 9) (LEQ $x 19))introduces in Quality(40) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:40) in guard (AND (GT $x 19) (LEQ $x 29))introduces in Quality(40) partition with 2 elements
Transition elaborate3 : guard parameter $x(Quality:40) in guard (AND (GT $x 29) (LEQ $x 39))introduces in Quality(40) partition with 2 elements
Sort wr.t. initial and guards Quality has partition 4
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 40 reducing to 4 values.
For transition elaborate0:(LEQ $x 9) -> (EQ $x 3)
For transition elaborate1:(AND (GT $x 9) (LEQ $x 19)) -> (EQ $x 2)
For transition elaborate2:(AND (GT $x 19) (LEQ $x 29)) -> (EQ $x 1)
For transition elaborate3:(AND (GT $x 29) (LEQ $x 39)) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 10
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 10
[2023-03-10 05:02:23] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 16 ms.
[2023-03-10 05:02:23] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 8 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-10 05:02:23] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-10 05:02:23] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
[2023-03-10 05:02:23] [INFO ] Invariant cache hit.
[2023-03-10 05:02:23] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 05:02:23] [INFO ] Invariant cache hit.
[2023-03-10 05:02:23] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-10 05:02:23] [INFO ] Invariant cache hit.
[2023-03-10 05:02:23] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-10 05:02:23] [INFO ] Flatten gal took : 5 ms
[2023-03-10 05:02:23] [INFO ] Flatten gal took : 5 ms
[2023-03-10 05:02:23] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 05:02:23] [INFO ] Invariant cache hit.
[2023-03-10 05:02:23] [INFO ] After 28ms 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.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0||G(p1))&&(X(F(!p0))||p2))))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 05:02:24] [INFO ] Invariant cache hit.
[2023-03-10 05:02:24] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-10 05:02:24] [INFO ] Invariant cache hit.
[2023-03-10 05:02:24] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 05:02:24] [INFO ] Invariant cache hit.
[2023-03-10 05:02:24] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-10 05:02:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 05:02:24] [INFO ] Invariant cache hit.
[2023-03-10 05:02:24] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p0 (NOT p2))), true, (AND p0 (NOT p1)), p0]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 2) (GEQ s3 1) (GEQ s5 1)), p1:(OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p2:(OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 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][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 6630 steps with 440 reset in 57 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-01 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 05:02:24] [INFO ] Invariant cache hit.
[2023-03-10 05:02:24] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-10 05:02:24] [INFO ] Invariant cache hit.
[2023-03-10 05:02:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 05:02:24] [INFO ] Invariant cache hit.
[2023-03-10 05:02:24] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-10 05:02:24] [INFO ] Invariant cache hit.
[2023-03-10 05:02:24] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GEQ s0 1), p0:(OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Product exploration explored 100000 steps with 50000 reset in 290 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-02 finished in 981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0 U (G(!p0)||(!p0&&G(!p1))))))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 05:02:25] [INFO ] Invariant cache hit.
[2023-03-10 05:02:25] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-10 05:02:25] [INFO ] Invariant cache hit.
[2023-03-10 05:02:25] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 05:02:25] [INFO ] Invariant cache hit.
[2023-03-10 05:02:25] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-10 05:02:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 05:02:25] [INFO ] Invariant cache hit.
[2023-03-10 05:02:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 81 ms :[p0, (AND p1 p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 3) (GEQ s3 1) (GEQ s4 1)), p0:(OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 186 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-03 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 05:02:26] [INFO ] Invariant cache hit.
[2023-03-10 05:02:26] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2023-03-10 05:02:26] [INFO ] Invariant cache hit.
[2023-03-10 05:02:26] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 05:02:26] [INFO ] Invariant cache hit.
[2023-03-10 05:02:26] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-10 05:02:26] [INFO ] Invariant cache hit.
[2023-03-10 05:02:26] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 1) (OR (LT s1 3) (LT s3 1) (LT s4 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1754 reset in 168 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 3 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-04 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(p0 U (X(p0) U X(p1))))))'
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 05:02:26] [INFO ] Invariant cache hit.
[2023-03-10 05:02:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-10 05:02:26] [INFO ] Invariant cache hit.
[2023-03-10 05:02:26] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 05:02:26] [INFO ] Invariant cache hit.
[2023-03-10 05:02:26] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-10 05:02:26] [INFO ] Invariant cache hit.
[2023-03-10 05:02:26] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 123 ms :[p1, false, p1]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p1:(GEQ s2 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 21770 reset in 259 ms.
Stack based approach found an accepted trace after 1003 steps with 219 reset with depth 7 and stack size 7 in 2 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-05 finished in 531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&(G(p1)||G(F(p2)))))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 05:02:27] [INFO ] Invariant cache hit.
[2023-03-10 05:02:27] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-10 05:02:27] [INFO ] Invariant cache hit.
[2023-03-10 05:02:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 05:02:27] [INFO ] Invariant cache hit.
[2023-03-10 05:02:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-10 05:02:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 05:02:27] [INFO ] Invariant cache hit.
[2023-03-10 05:02:27] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s0 1), p2:(AND (GEQ s3 1) (GEQ s7 1)), p0:(OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 168 ms.
Stack based approach found an accepted trace after 124 steps with 0 reset with depth 125 and stack size 113 in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-06 finished in 559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U p1)||G(p2)))'
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 5 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-10 05:02:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 05:02:27] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-10 05:02:27] [INFO ] Invariant cache hit.
[2023-03-10 05:02:27] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 05:02:27] [INFO ] Invariant cache hit.
[2023-03-10 05:02:27] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-10 05:02:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 05:02:27] [INFO ] Invariant cache hit.
[2023-03-10 05:02:27] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1), (AND p0 (NOT p2))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s3 1) (LT s5 1)), p2:(AND (GEQ s3 1) (GEQ s6 1)), p0:(AND (GEQ s1 3) (GEQ s3 1) (GEQ s4 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][true, true, true, true]]
Product exploration explored 100000 steps with 8421 reset in 166 ms.
Product exploration explored 100000 steps with 8355 reset in 178 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) p2)), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X p0), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0)), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 825 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1), (AND p0 (NOT p2))]
Finished random walk after 61 steps, including 0 resets, run visited all 9 properties in 3 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) p2)), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X p0), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0)), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p2 p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p2 p0))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 19 factoid took 1044 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1), (AND p0 (NOT p2))]
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-10 05:02:30] [INFO ] Invariant cache hit.
[2023-03-10 05:02:30] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-10 05:02:30] [INFO ] Invariant cache hit.
[2023-03-10 05:02:30] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 05:02:30] [INFO ] Invariant cache hit.
[2023-03-10 05:02:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-10 05:02:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 05:02:30] [INFO ] Invariant cache hit.
[2023-03-10 05:02:30] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 10/10 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p1)), (X (AND p2 p0 (NOT p1))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (AND p0 (NOT p1))), (X (AND p2 (NOT p1))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 853 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1), (AND p0 (NOT p2))]
Finished random walk after 166 steps, including 0 resets, run visited all 9 properties in 2 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p1)), (X (AND p2 p0 (NOT p1))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (AND p0 (NOT p1))), (X (AND p2 (NOT p1))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1) p2))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 19 factoid took 1033 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 8362 reset in 165 ms.
Product exploration explored 100000 steps with 8485 reset in 245 ms.
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-10 05:02:33] [INFO ] Invariant cache hit.
[2023-03-10 05:02:33] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-10 05:02:33] [INFO ] Invariant cache hit.
[2023-03-10 05:02:33] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 05:02:33] [INFO ] Invariant cache hit.
[2023-03-10 05:02:33] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-10 05:02:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 05:02:33] [INFO ] Invariant cache hit.
[2023-03-10 05:02:33] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 10/10 places, 9/9 transitions.
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-07 finished in 6355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-10 05:02:33] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 05:02:33] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-10 05:02:33] [INFO ] Invariant cache hit.
[2023-03-10 05:02:33] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 05:02:33] [INFO ] Invariant cache hit.
[2023-03-10 05:02:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-10 05:02:34] [INFO ] Invariant cache hit.
[2023-03-10 05:02:34] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 2) (GEQ s3 1) (GEQ s5 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]]
Product exploration explored 100000 steps with 50000 reset in 102 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-08 finished in 485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G(p1))))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 05:02:34] [INFO ] Invariant cache hit.
[2023-03-10 05:02:34] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-10 05:02:34] [INFO ] Invariant cache hit.
[2023-03-10 05:02:34] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-10 05:02:34] [INFO ] Invariant cache hit.
[2023-03-10 05:02:34] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-10 05:02:34] [INFO ] Invariant cache hit.
[2023-03-10 05:02:34] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-09 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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s3 1) (LT s6 1)), p1:(AND (OR (LT s1 1) (LT s3 1) (LT s6 1)) (LT s0 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-09 finished in 261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(p1)))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 6 transition count 7
Applied a total of 9 rules in 2 ms. Remains 6 /12 variables (removed 6) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-10 05:02:34] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 05:02:34] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-10 05:02:34] [INFO ] Invariant cache hit.
[2023-03-10 05:02:34] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 05:02:34] [INFO ] Invariant cache hit.
[2023-03-10 05:02:34] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-10 05:02:34] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-10 05:02:34] [INFO ] Invariant cache hit.
[2023-03-10 05:02:34] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/12 places, 7/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 6/12 places, 7/10 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s0 1) (AND (GEQ s3 1) (GEQ s4 1))), p0:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2355 reset in 109 ms.
Stack based approach found an accepted trace after 6781 steps with 166 reset with depth 107 and stack size 73 in 15 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-10 finished in 374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 8 transition count 8
Applied a total of 6 rules in 2 ms. Remains 8 /12 variables (removed 4) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-10 05:02:35] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 05:02:35] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-10 05:02:35] [INFO ] Invariant cache hit.
[2023-03-10 05:02:35] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 05:02:35] [INFO ] Invariant cache hit.
[2023-03-10 05:02:35] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-10 05:02:35] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-10 05:02:35] [INFO ] Invariant cache hit.
[2023-03-10 05:02:35] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/12 places, 8/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 8/12 places, 8/10 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-12 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 (GEQ s1 3) (GEQ s3 1) (GEQ s4 1) (GEQ s1 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2952 reset in 96 ms.
Stack based approach found an accepted trace after 31 steps with 1 reset with depth 19 and stack size 18 in 1 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-12 finished in 293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-10 05:02:35] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-10 05:02:35] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-10 05:02:35] [INFO ] Invariant cache hit.
[2023-03-10 05:02:35] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 05:02:35] [INFO ] Invariant cache hit.
[2023-03-10 05:02:35] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-10 05:02:35] [INFO ] Invariant cache hit.
[2023-03-10 05:02:35] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 2) (GEQ s3 1) (GEQ s5 1)), p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-13 finished in 492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(!p1)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 05:02:35] [INFO ] Invariant cache hit.
[2023-03-10 05:02:35] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-10 05:02:35] [INFO ] Invariant cache hit.
[2023-03-10 05:02:35] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 05:02:35] [INFO ] Invariant cache hit.
[2023-03-10 05:02:35] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-10 05:02:35] [INFO ] Invariant cache hit.
[2023-03-10 05:02:35] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s7 1)), p1:(OR (LT s1 1) (LT s3 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 136 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-14 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 05:02:36] [INFO ] Invariant cache hit.
[2023-03-10 05:02:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-10 05:02:36] [INFO ] Invariant cache hit.
[2023-03-10 05:02:36] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 05:02:36] [INFO ] Invariant cache hit.
[2023-03-10 05:02:36] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-10 05:02:36] [INFO ] Invariant cache hit.
[2023-03-10 05:02:36] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 106 ms :[p0, p0, p0]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, 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, null][false, false, false]]
Product exploration explored 100000 steps with 14 reset in 93 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLFireability-15 finished in 324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U p1)||G(p2)))'
[2023-03-10 05:02:36] [INFO ] Flatten gal took : 3 ms
[2023-03-10 05:02:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-10 05:02:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 10 transitions and 34 arcs took 0 ms.
Total runtime 15498 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DrinkVendingMachine-COL-10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability
FORMULA DrinkVendingMachine-COL-10-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678424558077
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DrinkVendingMachine-COL-10-LTLFireability-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DrinkVendingMachine-COL-10-LTLFireability-07
lola: result : false
lola: markings : 191
lola: fired transitions : 213
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DrinkVendingMachine-COL-10-LTLFireability-07: LTL false LTL model checker
Time elapsed: 0 secs. Pages in use: 1
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="DrinkVendingMachine-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DrinkVendingMachine-COL-10, 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 r135-smll-167819414800580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-10.tgz
mv DrinkVendingMachine-COL-10 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 ;