About the Execution of LTSMin+red for CSRepetitions-COL-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 390.899 | 20865.00 | 35079.00 | 762.50 | FF?FTFFFFFFFFTFF | 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.r073-smll-167814399000020.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 ltsminxred
Input is CSRepetitions-COL-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399000020
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.0K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 11:52 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.0K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:41 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 14K 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 CSRepetitions-COL-04-LTLFireability-00
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-01
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-02
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-03
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-04
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-05
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-06
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-07
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-08
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-09
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-10
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-11
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-12
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-13
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-14
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678219200124
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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-07 20:00:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-07 20:00:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 20:00:03] [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-07 20:00:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-07 20:00:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 786 ms
[2023-03-07 20:00:03] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 117 PT places and 176.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2023-03-07 20:00:04] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 6 ms.
[2023-03-07 20:00:04] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
Finished random walk after 51 steps, including 1 resets, run visited all 6 properties in 24 ms. (steps per millisecond=2 )
[2023-03-07 20:00:04] [INFO ] Flatten gal took : 20 ms
[2023-03-07 20:00:04] [INFO ] Flatten gal took : 4 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 4
[2023-03-07 20:00:04] [INFO ] Unfolded HLPN to a Petri net with 66 places and 80 transitions 240 arcs in 14 ms.
[2023-03-07 20:00:04] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-COL-04-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 30 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2023-03-07 20:00:04] [INFO ] Computed 17 place invariants in 11 ms
[2023-03-07 20:00:04] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-07 20:00:04] [INFO ] Invariant cache hit.
[2023-03-07 20:00:04] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:04] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-07 20:00:04] [INFO ] Invariant cache hit.
[2023-03-07 20:00:04] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 551 ms. Remains : 66/66 places, 80/80 transitions.
Support contains 66 out of 66 places after structural reductions.
[2023-03-07 20:00:05] [INFO ] Flatten gal took : 19 ms
[2023-03-07 20:00:05] [INFO ] Flatten gal took : 29 ms
[2023-03-07 20:00:05] [INFO ] Input system was already deterministic with 80 transitions.
Finished random walk after 41 steps, including 1 resets, run visited all 9 properties in 8 ms. (steps per millisecond=5 )
Computed a total of 0 stabilizing places and 16 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' '!(X((G((X(p1)&&p0))||(X(p2)&&F(!p2)))))'
Support contains 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:05] [INFO ] Invariant cache hit.
[2023-03-07 20:00:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-07 20:00:05] [INFO ] Invariant cache hit.
[2023-03-07 20:00:05] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:06] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-07 20:00:06] [INFO ] Invariant cache hit.
[2023-03-07 20:00:06] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), p2, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s16 1)) (OR (LT s0 1) (LT s5 1)) (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s7 1)) (OR (LT s0 1) (LT s6 1)) (OR (LT s0 1) (LT s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10411 reset in 500 ms.
Stack based approach found an accepted trace after 8866 steps with 915 reset with depth 8 and stack size 8 in 36 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-00 finished in 1443 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 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:07] [INFO ] Invariant cache hit.
[2023-03-07 20:00:07] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-07 20:00:07] [INFO ] Invariant cache hit.
[2023-03-07 20:00:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:07] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-07 20:00:07] [INFO ] Invariant cache hit.
[2023-03-07 20:00:07] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s10 1) (GEQ s59 1)) (AND (GEQ s13 1) (GEQ s62 1)) (AND (GEQ s15 1) (GEQ s64 1)) (AND (GEQ s16 1) (GEQ s65 1)) (AND (GEQ s2 1) (GEQ s51 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 329 steps with 22 reset in 4 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-01 finished in 347 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(X(F(p1))))))'
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:07] [INFO ] Invariant cache hit.
[2023-03-07 20:00:07] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-07 20:00:07] [INFO ] Invariant cache hit.
[2023-03-07 20:00:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:07] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-07 20:00:07] [INFO ] Invariant cache hit.
[2023-03-07 20:00:07] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (GEQ s32 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14697 reset in 274 ms.
Product exploration explored 100000 steps with 14705 reset in 440 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 292 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 38 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:09] [INFO ] Invariant cache hit.
[2023-03-07 20:00:10] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-07 20:00:10] [INFO ] Invariant cache hit.
[2023-03-07 20:00:10] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:10] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-07 20:00:10] [INFO ] Invariant cache hit.
[2023-03-07 20:00:10] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 66/66 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 26 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14703 reset in 280 ms.
Product exploration explored 100000 steps with 14631 reset in 279 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-07 20:00:12] [INFO ] Invariant cache hit.
[2023-03-07 20:00:12] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 66/66 places, 80/80 transitions.
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:12] [INFO ] Invariant cache hit.
[2023-03-07 20:00:12] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-07 20:00:12] [INFO ] Invariant cache hit.
[2023-03-07 20:00:12] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:12] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-07 20:00:12] [INFO ] Invariant cache hit.
[2023-03-07 20:00:12] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 66/66 places, 80/80 transitions.
Treatment of property CSRepetitions-COL-04-LTLFireability-02 finished in 5127 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(((!p1||X(G(!p1)))&&p0))))'
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:12] [INFO ] Invariant cache hit.
[2023-03-07 20:00:12] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-07 20:00:12] [INFO ] Invariant cache hit.
[2023-03-07 20:00:12] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:12] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-07 20:00:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 20:00:12] [INFO ] Invariant cache hit.
[2023-03-07 20:00:12] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s10 1) (GEQ s59 1)) (AND (GEQ s13 1) (GEQ s62 1)) (AND (GEQ s15 1) (GEQ s64 1)) (AND (GEQ s16 1) (GEQ s65 1)) (AND (GEQ s2 1) (GEQ s51 1)...], nbAcceptance=1, 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 2482 reset in 742 ms.
Stack based approach found an accepted trace after 4892 steps with 117 reset with depth 48 and stack size 48 in 39 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-03 finished in 1066 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 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:13] [INFO ] Invariant cache hit.
[2023-03-07 20:00:13] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-07 20:00:13] [INFO ] Invariant cache hit.
[2023-03-07 20:00:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:13] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-07 20:00:13] [INFO ] Invariant cache hit.
[2023-03-07 20:00:13] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 208 ms :[p0, p0, p0]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-04 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:(OR (AND (GEQ s10 1) (GEQ s59 1)) (AND (GEQ s13 1) (GEQ s62 1)) (AND (GEQ s15 1) (GEQ s64 1)) (AND (GEQ s16 1) (GEQ s65 1)) (AND (GEQ s2 1) (GEQ s51 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 33333 reset in 192 ms.
Product exploration explored 100000 steps with 33333 reset in 213 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-04-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-04-LTLFireability-04 finished in 883 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(X((X((!(p1 U p2)||!p1))&&p0)))))'
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:14] [INFO ] Invariant cache hit.
[2023-03-07 20:00:14] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-07 20:00:14] [INFO ] Invariant cache hit.
[2023-03-07 20:00:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:14] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-07 20:00:14] [INFO ] Invariant cache hit.
[2023-03-07 20:00:14] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) p2), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2))]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND p1 p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(AND (LT s34 1) (LT s35 1) (LT s36 1) (LT s37 1) (LT s39 1) (LT s38 1) (LT s41 1) (LT s40 1) (LT s43 1) (LT s42 1) (LT s45 1) (LT s44 1) (LT s47 1) (LT...], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-05 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((X(G(p1))||p0)))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:15] [INFO ] Invariant cache hit.
[2023-03-07 20:00:15] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-07 20:00:15] [INFO ] Invariant cache hit.
[2023-03-07 20:00:15] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:15] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-07 20:00:15] [INFO ] Invariant cache hit.
[2023-03-07 20:00:15] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s18 1) (GEQ s33 1)) (AND (GEQ s23 1) (GEQ s33 1)) (AND (GEQ s30 1) (GEQ s33 1)) (AND (GEQ s31 1) (GEQ s33 1)) (AND (GEQ s21 1) (GEQ s33 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-06 finished in 370 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||G(!p1))))))'
Support contains 48 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:15] [INFO ] Invariant cache hit.
[2023-03-07 20:00:15] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-07 20:00:15] [INFO ] Invariant cache hit.
[2023-03-07 20:00:15] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:15] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-07 20:00:15] [INFO ] Invariant cache hit.
[2023-03-07 20:00:15] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (AND (GEQ s10 1) (GEQ s59 1)) (AND (GEQ s13 1) (GEQ s62 1)) (AND (GEQ s15 1) (GEQ s64 1)) (AND (GEQ s16 1) (GEQ s65 1)) (AND (GEQ s2 1) (GEQ s51 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24972 reset in 314 ms.
Stack based approach found an accepted trace after 55587 steps with 14079 reset with depth 36 and stack size 36 in 194 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-08 finished in 830 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(((X(!(F(p0)&&p1)) U p0)&&p2))) U G(p0)))'
Support contains 50 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:16] [INFO ] Invariant cache hit.
[2023-03-07 20:00:16] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-07 20:00:16] [INFO ] Invariant cache hit.
[2023-03-07 20:00:16] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:16] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-07 20:00:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 20:00:16] [INFO ] Invariant cache hit.
[2023-03-07 20:00:16] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 213 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (...], 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]]
Stuttering criterion allowed to conclude after 246 steps with 16 reset in 2 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-09 finished in 449 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 G(p1)))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 34 transition count 64
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 63 place count 19 transition count 49
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 19 transition count 49
Applied a total of 78 rules in 11 ms. Remains 19 /66 variables (removed 47) and now considering 49/80 (removed 31) transitions.
// Phase 1: matrix 49 rows 19 cols
[2023-03-07 20:00:16] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-07 20:00:16] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-07 20:00:16] [INFO ] Invariant cache hit.
[2023-03-07 20:00:16] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-07 20:00:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 20:00:16] [INFO ] Invariant cache hit.
[2023-03-07 20:00:16] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/66 places, 49/80 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 19/66 places, 49/80 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s2 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s17 1)) (AND (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s15 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s17 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 82 steps with 6 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-10 finished in 256 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)&&F(!p1))))'
Support contains 34 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2023-03-07 20:00:17] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-07 20:00:17] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-07 20:00:17] [INFO ] Invariant cache hit.
[2023-03-07 20:00:17] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:17] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-07 20:00:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 20:00:17] [INFO ] Invariant cache hit.
[2023-03-07 20:00:17] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (...], 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 6026 reset in 308 ms.
Stack based approach found an accepted trace after 12379 steps with 751 reset with depth 13 and stack size 13 in 44 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-11 finished in 712 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(G(p0)) U G(!p1)))))'
Support contains 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:17] [INFO ] Invariant cache hit.
[2023-03-07 20:00:17] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-07 20:00:17] [INFO ] Invariant cache hit.
[2023-03-07 20:00:17] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:17] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-07 20:00:17] [INFO ] Invariant cache hit.
[2023-03-07 20:00:17] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 166 ms :[p1, p1, p1, (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-12 finished in 383 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 16 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:18] [INFO ] Invariant cache hit.
[2023-03-07 20:00:18] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-07 20:00:18] [INFO ] Invariant cache hit.
[2023-03-07 20:00:18] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:18] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-07 20:00:18] [INFO ] Invariant cache hit.
[2023-03-07 20:00:18] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-13 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:(OR (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 1) (GE...], 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 33333 reset in 160 ms.
Product exploration explored 100000 steps with 33333 reset in 177 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 50 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-04-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-04-LTLFireability-13 finished in 736 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 16 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:18] [INFO ] Invariant cache hit.
[2023-03-07 20:00:18] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-07 20:00:18] [INFO ] Invariant cache hit.
[2023-03-07 20:00:18] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:19] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-07 20:00:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 20:00:19] [INFO ] Invariant cache hit.
[2023-03-07 20:00:19] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-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:(OR (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-14 finished in 384 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) U p1)) U (p0&&(F(p1)||X(!p0)))))'
Support contains 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-07 20:00:19] [INFO ] Invariant cache hit.
[2023-03-07 20:00:19] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-07 20:00:19] [INFO ] Invariant cache hit.
[2023-03-07 20:00:19] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-07 20:00:19] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-07 20:00:19] [INFO ] Invariant cache hit.
[2023-03-07 20:00:19] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(OR (AND (GEQ s10 1) (GEQ s59 1)) (AND (GEQ s13 1) (GEQ s62 1)) (AND (GEQ s15 1) (GEQ s64 1)) (AND (GEQ s16 1) (GEQ s65 1)) (AND (GEQ s2 1) (GEQ s51 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 12 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-15 finished in 362 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(X(F(p1))))))'
[2023-03-07 20:00:19] [INFO ] Flatten gal took : 10 ms
[2023-03-07 20:00:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-07 20:00:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 66 places, 80 transitions and 240 arcs took 2 ms.
Total runtime 17115 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1189/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CSRepetitions-COL-04-LTLFireability-02
BK_STOP 1678219220989
--------------------
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
mcc2023
ltl formula name CSRepetitions-COL-04-LTLFireability-02
ltl formula formula --ltl=/tmp/1189/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 66 places, 80 transitions and 240 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1189/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1189/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1189/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1189/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
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="CSRepetitions-COL-04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CSRepetitions-COL-04, 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 r073-smll-167814399000020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-04.tgz
mv CSRepetitions-COL-04 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 ;