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.r105-tall-167814482001020.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 DatabaseWithMutex-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814482001020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.8K Feb 25 13:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 13:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 13:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:56 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 19K 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 DatabaseWithMutex-COL-02-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678412525044

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=DatabaseWithMutex-COL-02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 01:42:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 01:42:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 01:42:06] [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 01:42:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-10 01:42:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 675 ms
[2023-03-10 01:42:07] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 38 PT places and 32.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-10 01:42:07] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 5 ms.
[2023-03-10 01:42:07] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 11 cols
[2023-03-10 01:42:07] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-10 01:42:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 01:42:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 01:42:07] [INFO ] After 97ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2023-03-10 01:42:07] [INFO ] Flatten gal took : 16 ms
[2023-03-10 01:42:07] [INFO ] Flatten gal took : 2 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2023-03-10 01:42:07] [INFO ] Unfolded HLPN to a Petri net with 38 places and 32 transitions 88 arcs in 7 ms.
[2023-03-10 01:42:07] [INFO ] Unfolded 15 HLPN properties in 0 ms.
[2023-03-10 01:42:07] [INFO ] Reduced 2 identical enabling conditions.
[2023-03-10 01:42:07] [INFO ] Reduced 2 identical enabling conditions.
[2023-03-10 01:42:07] [INFO ] Reduced 2 identical enabling conditions.
[2023-03-10 01:42:07] [INFO ] Reduced 2 identical enabling conditions.
[2023-03-10 01:42:07] [INFO ] Reduced 2 identical enabling conditions.
[2023-03-10 01:42:07] [INFO ] Reduced 2 identical enabling conditions.
[2023-03-10 01:42:07] [INFO ] Reduced 2 identical enabling conditions.
[2023-03-10 01:42:07] [INFO ] Reduced 2 identical enabling conditions.
Support contains 38 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2023-03-10 01:42:07] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 01:42:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-10 01:42:07] [INFO ] Invariant cache hit.
[2023-03-10 01:42:07] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-10 01:42:07] [INFO ] Invariant cache hit.
[2023-03-10 01:42:07] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 38/38 places, 32/32 transitions.
Support contains 38 out of 38 places after structural reductions.
[2023-03-10 01:42:07] [INFO ] Flatten gal took : 22 ms
[2023-03-10 01:42:07] [INFO ] Flatten gal took : 5 ms
[2023-03-10 01:42:07] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 01:42:08] [INFO ] Invariant cache hit.
[2023-03-10 01:42:08] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-10 01:42:08] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 01:42:08] [INFO ] After 46ms 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 DatabaseWithMutex-COL-02-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
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' '!(X((p0&&F((G(p0)||G(F(p1)))))))'
Support contains 14 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2023-03-10 01:42:08] [INFO ] Invariant cache hit.
[2023-03-10 01:42:08] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-10 01:42:08] [INFO ] Invariant cache hit.
[2023-03-10 01:42:08] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-10 01:42:08] [INFO ] Invariant cache hit.
[2023-03-10 01:42:08] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 38/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 399 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s29 1)) (AND (GEQ s0 1) (GEQ s28 1)) (AND (GEQ s1 1) (GEQ s28 1)) (AND (GEQ s2 1) (GEQ s29 1))), p1:(OR (AND (GEQ s8 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-00 finished in 599 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(G(p1)))||(p0&&F((G(F(p2))||(!p2&&F(p2)))))))))'
Support contains 12 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 34 transition count 24
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 20 place count 26 transition count 24
Applied a total of 20 rules in 8 ms. Remains 26 /38 variables (removed 12) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 26 cols
[2023-03-10 01:42:09] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-10 01:42:09] [INFO ] Implicit Places using invariants in 37 ms returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/38 places, 24/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49 ms. Remains : 24/38 places, 24/32 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s18 1) (GEQ s19 1) (GEQ s16 1) (GEQ s17 1)), p1:(OR (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s15 1)), p2:(AND (LT s8 1) (LT s9 1) (LT s10 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 8292 reset in 265 ms.
Stack based approach found an accepted trace after 2472 steps with 202 reset with depth 16 and stack size 16 in 4 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-01 finished in 497 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)&&F((F(!p0)&&p1))))))'
Support contains 12 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 3 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2023-03-10 01:42:09] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-10 01:42:09] [INFO ] Implicit Places using invariants in 33 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (OR (NOT p1) p0), p0]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s12 1) (LT s13 1) (LT s14 1) (LT s15 1)), p1:(AND (OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)) (OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1430 reset in 103 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 0 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-02 finished in 367 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(X((F(!p0)||X(G(p1)))))))'
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 2 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
[2023-03-10 01:42:09] [INFO ] Invariant cache hit.
[2023-03-10 01:42:09] [INFO ] Implicit Places using invariants in 34 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 224 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1)), p1:(OR (GEQ s4 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, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 98 ms.
Product exploration explored 100000 steps with 25000 reset in 80 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 p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 38 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 217 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2023-03-10 01:42:11] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-10 01:42:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 01:42:11] [INFO ] Invariant cache hit.
[2023-03-10 01:42:11] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-10 01:42:11] [INFO ] Invariant cache hit.
[2023-03-10 01:42:11] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 32/32 places, 32/32 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 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 94 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 210 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 208 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 66 ms.
Product exploration explored 100000 steps with 25000 reset in 68 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 228 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 32 transition count 32
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 20 place count 24 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 24 transition count 24
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 28 rules in 8 ms. Remains 24 /32 variables (removed 8) and now considering 24/32 (removed 8) transitions.
[2023-03-10 01:42:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2023-03-10 01:42:13] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-10 01:42:13] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/32 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57 ms. Remains : 24/32 places, 24/32 transitions.
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2023-03-10 01:42:13] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 01:42:13] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 01:42:13] [INFO ] Invariant cache hit.
[2023-03-10 01:42:13] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-10 01:42:13] [INFO ] Invariant cache hit.
[2023-03-10 01:42:13] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 32/32 places, 32/32 transitions.
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-03 finished in 3351 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 12 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2023-03-10 01:42:13] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-10 01:42:13] [INFO ] Implicit Places using invariants in 32 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 36 /36 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 36/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1)), p0:(OR (AND (GEQ s8 1) (GEQ s24 1)) (AND (GEQ s9 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s26 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Product exploration explored 100000 steps with 50000 reset in 83 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 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0))
Knowledge based reduction with 5 factoid took 259 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-02-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-04 finished in 537 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)||(p1&&G(p2)))))'
Support contains 16 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2023-03-10 01:42:13] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 01:42:13] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 01:42:13] [INFO ] Invariant cache hit.
[2023-03-10 01:42:13] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-10 01:42:13] [INFO ] Invariant cache hit.
[2023-03-10 01:42:13] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 34/38 places, 32/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 34/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GEQ s28 1) (GEQ s29 1) (GEQ s26 1) (GEQ s27 1)), p1:(OR (AND (GEQ s7 1) (GEQ s33 1)) (AND (GEQ s6 1) (GEQ s32 1)) (AND (GEQ s6 1) (GEQ s30 1)) (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12696 reset in 88 ms.
Product exploration explored 100000 steps with 12733 reset in 90 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 p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p0)]
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-10 01:42:14] [INFO ] Invariant cache hit.
[2023-03-10 01:42:14] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-10 01:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:42:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-10 01:42:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:42:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-10 01:42:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:42:15] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-10 01:42:15] [INFO ] Computed and/alt/rep : 28/28/28 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 01:42:15] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 34 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 28
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 30 transition count 28
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 30 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 26 transition count 24
Applied a total of 16 rules in 3 ms. Remains 26 /34 variables (removed 8) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 26 cols
[2023-03-10 01:42:15] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-10 01:42:15] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-10 01:42:15] [INFO ] Invariant cache hit.
[2023-03-10 01:42:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-10 01:42:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 01:42:15] [INFO ] Invariant cache hit.
[2023-03-10 01:42:15] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/34 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 26/34 places, 24/32 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-10 01:42:15] [INFO ] Invariant cache hit.
[2023-03-10 01:42:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-10 01:42:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:42:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-10 01:42:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:42:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-10 01:42:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:42:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-10 01:42:15] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 01:42:15] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15414 reset in 73 ms.
Product exploration explored 100000 steps with 15413 reset in 68 ms.
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 24/24 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 26 transition count 20
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 22 transition count 20
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 18 transition count 16
Applied a total of 16 rules in 2 ms. Remains 18 /26 variables (removed 8) and now considering 16/24 (removed 8) transitions.
// Phase 1: matrix 16 rows 18 cols
[2023-03-10 01:42:15] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 01:42:15] [INFO ] Implicit Places using invariants in 30 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/26 places, 16/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36 ms. Remains : 16/26 places, 16/24 transitions.
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-05 finished in 2019 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)||(!p1 U (G(!p1)||(!p1&&G(p2)))))))'
Support contains 12 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2023-03-10 01:42:15] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 01:42:15] [INFO ] Implicit Places using invariants in 24 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 303 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 7}, { cond=(AND p0 p2 p1), acceptance={} source=6 dest: 8}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=1, aps=[p1:(OR (GEQ s4 1) (GEQ s5 1)), p2:(AND (LT s12 1) (LT s13 1) (LT s14 1) (LT s15 1)), p0:(AND (OR (LT s7 1) (LT s31 1)) (OR (LT s6 1) (LT s30 1)) (OR (LT s...], 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-06 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)))'
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
[2023-03-10 01:42:16] [INFO ] Invariant cache hit.
[2023-03-10 01:42:16] [INFO ] Implicit Places using invariants in 29 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s15 1)) (OR (AND (GEQ s7 1) (GEQ s31 1)) (AND (GEQ s6 1) (GEQ s30 1)) (AND (GEQ s6 1) (GEQ s28 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-07 finished in 129 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 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
[2023-03-10 01:42:16] [INFO ] Invariant cache hit.
[2023-03-10 01:42:16] [INFO ] Implicit Places using invariants in 30 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-02-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:(OR (GEQ s4 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 51 ms.
Product exploration explored 100000 steps with 50000 reset in 69 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-02-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-08 finished in 334 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' '!((p0 U (F(G(p2))||p1)))'
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 34 transition count 24
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 20 place count 26 transition count 24
Applied a total of 20 rules in 5 ms. Remains 26 /38 variables (removed 12) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 26 cols
[2023-03-10 01:42:16] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 01:42:16] [INFO ] Implicit Places using invariants in 31 ms returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/38 places, 24/32 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 24 transition count 20
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 20
Applied a total of 8 rules in 3 ms. Remains 20 /24 variables (removed 4) and now considering 20/24 (removed 4) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-10 01:42:16] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 01:42:16] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-10 01:42:16] [INFO ] Invariant cache hit.
[2023-03-10 01:42:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/38 places, 20/32 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 20/38 places, 20/32 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1)), p2:(OR (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1)), p0:(OR (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 72 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-11 finished in 245 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((p0&&G(F(!p1)))))'
Support contains 14 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2023-03-10 01:42:16] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-10 01:42:16] [INFO ] Implicit Places using invariants in 37 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 36/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s30 1) (GEQ s31 1) (GEQ s28 1) (GEQ s29 1) (GEQ s4 1) (GEQ s5 1) (AND (GEQ s8 1) (GEQ s24 1)) (AND (GEQ s9 1) (GEQ s25 1)) (AND (GEQ s6 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5405 reset in 114 ms.
Stack based approach found an accepted trace after 1024 steps with 59 reset with depth 30 and stack size 30 in 1 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-12 finished in 337 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 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2023-03-10 01:42:17] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-10 01:42:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 01:42:17] [INFO ] Invariant cache hit.
[2023-03-10 01:42:17] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-10 01:42:17] [INFO ] Invariant cache hit.
[2023-03-10 01:42:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 34/38 places, 32/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 34/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-13 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 (OR (AND (GEQ s3 1) (GEQ s25 1)) (AND (GEQ s0 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s24 1)) (AND (GEQ s2 1) (GEQ s25 1))) (OR (GEQ s8 1) (GEQ s9 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 3246 reset in 103 ms.
Stack based approach found an accepted trace after 34 steps with 2 reset with depth 19 and stack size 19 in 0 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-13 finished in 268 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))||((p1 U !p2)&&X((G(p2)||(F(p1)&&p3))))))'
Support contains 14 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
[2023-03-10 01:42:17] [INFO ] Invariant cache hit.
[2023-03-10 01:42:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 01:42:17] [INFO ] Invariant cache hit.
[2023-03-10 01:42:17] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-10 01:42:17] [INFO ] Invariant cache hit.
[2023-03-10 01:42:17] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 34/38 places, 32/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 34/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0) p3), acceptance={} source=2 dest: 6}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (LT s12 1) (LT s13 1) (LT s14 1) (LT s15 1)), p1:(OR (AND (GEQ s3 1) (GEQ s25 1)) (AND (GEQ s0 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s24 1)) (AND (...], 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 12726 reset in 85 ms.
Product exploration explored 100000 steps with 12720 reset in 91 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 p2 (NOT p1) (NOT p0) p3), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3))), (X (AND p2 (NOT p1) (NOT p0) p3)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
Knowledge based reduction with 11 factoid took 576 ms. Reduced automaton from 7 states, 15 edges and 4 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0) p3), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3))), (X (AND p2 (NOT p1) (NOT p0) p3)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F p0)]
Knowledge based reduction with 11 factoid took 603 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-10 01:42:19] [INFO ] Invariant cache hit.
[2023-03-10 01:42:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-10 01:42:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:42:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-10 01:42:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:42:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-10 01:42:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:42:19] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-10 01:42:19] [INFO ] Computed and/alt/rep : 28/28/28 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 01:42:19] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 34 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 32/32 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 28
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 30 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 26 transition count 24
Applied a total of 16 rules in 4 ms. Remains 26 /34 variables (removed 8) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 26 cols
[2023-03-10 01:42:19] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-10 01:42:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 01:42:19] [INFO ] Invariant cache hit.
[2023-03-10 01:42:19] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-10 01:42:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 01:42:19] [INFO ] Invariant cache hit.
[2023-03-10 01:42:19] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/34 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 26/34 places, 24/32 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-10 01:42:20] [INFO ] Invariant cache hit.
[2023-03-10 01:42:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-10 01:42:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 01:42:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-10 01:42:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 01:42:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-10 01:42:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 01:42:20] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-10 01:42:20] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 01:42:20] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12689 reset in 70 ms.
Product exploration explored 100000 steps with 12715 reset in 70 ms.
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 24/24 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 16
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 18 transition count 16
Applied a total of 16 rules in 1 ms. Remains 18 /26 variables (removed 8) and now considering 16/24 (removed 8) transitions.
// Phase 1: matrix 16 rows 18 cols
[2023-03-10 01:42:20] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 01:42:20] [INFO ] Implicit Places using invariants in 34 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/26 places, 16/24 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38 ms. Remains : 16/26 places, 16/24 transitions.
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-14 finished in 2868 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 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2023-03-10 01:42:20] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-10 01:42:20] [INFO ] Implicit Places using invariants in 24 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s12 1) (LT s13 1) (LT s14 1) (LT s15 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 60 ms.
Product exploration explored 100000 steps with 50000 reset in 66 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-02-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-15 finished in 330 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(X((F(!p0)||X(G(p1)))))))'
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)||(p1&&G(p2)))))'
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))||((p1 U !p2)&&X((G(p2)||(F(p1)&&p3))))))'
[2023-03-10 01:42:20] [INFO ] Flatten gal took : 9 ms
[2023-03-10 01:42:20] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-10 01:42:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 32 transitions and 88 arcs took 0 ms.
Total runtime 14480 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1463/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1463/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1463/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DatabaseWithMutex-COL-02-LTLFireability-03
Could not compute solution for formula : DatabaseWithMutex-COL-02-LTLFireability-05
Could not compute solution for formula : DatabaseWithMutex-COL-02-LTLFireability-14

BK_STOP 1678412542108

--------------------
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 DatabaseWithMutex-COL-02-LTLFireability-03
ltl formula formula --ltl=/tmp/1463/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 38 places, 32 transitions and 88 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.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1463/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1463/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1463/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1463/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DatabaseWithMutex-COL-02-LTLFireability-05
ltl formula formula --ltl=/tmp/1463/ltl_1_
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 38 places, 32 transitions and 88 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.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1463/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1463/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1463/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1463/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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:
ltl formula name DatabaseWithMutex-COL-02-LTLFireability-14
ltl formula formula --ltl=/tmp/1463/ltl_2_
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
pnml2lts-mc( 0/ 4): Petri net has 38 places, 32 transitions and 88 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1463/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1463/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1463/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1463/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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:
corrupted size vs. prev_size in fastbins

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="DatabaseWithMutex-COL-02"
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 DatabaseWithMutex-COL-02, 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 r105-tall-167814482001020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-02.tgz
mv DatabaseWithMutex-COL-02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;