About the Execution of LoLa+red for SharedMemory-COL-000050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1033.119 | 296787.00 | 329120.00 | 1319.90 | FFFFFTFFFFFTFFFF | 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.r359-smll-167891809200572.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is SharedMemory-COL-000050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891809200572
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 15:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 17:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14K Mar 5 18:23 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 SharedMemory-COL-000050-LTLFireability-00
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-01
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-02
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-03
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-04
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-05
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-06
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-07
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-08
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-09
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-10
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-11
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-12
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-13
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-14
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679168791161
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-COL-000050
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 19:46:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 19:46:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 19:46:33] [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-18 19:46:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 19:46:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 632 ms
[2023-03-18 19:46:34] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 2701 PT places and 7600.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 19:46:34] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 6 ms.
[2023-03-18 19:46:34] [INFO ] Skeletonized 13 HLPN properties in 3 ms. Removed 3 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 4 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 410 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=37 )
[2023-03-18 19:46:35] [INFO ] Flatten gal took : 17 ms
[2023-03-18 19:46:35] [INFO ] Flatten gal took : 2 ms
Domain [P(50), P(50)] of place Ext_Mem_Acc breaks symmetries in sort P
[2023-03-18 19:46:35] [INFO ] Unfolded HLPN to a Petri net with 2701 places and 5100 transitions 20200 arcs in 119 ms.
[2023-03-18 19:46:35] [INFO ] Unfolded 16 HLPN properties in 6 ms.
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 50 places in 10 ms
Reduce places removed 50 places and 50 transitions.
FORMULA SharedMemory-COL-000050-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000050-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000050-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2651 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 54 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
// Phase 1: matrix 5050 rows 2651 cols
[2023-03-18 19:46:36] [INFO ] Computed 101 place invariants in 368 ms
[2023-03-18 19:46:37] [INFO ] Implicit Places using invariants in 1197 ms returned []
[2023-03-18 19:46:37] [INFO ] Invariant cache hit.
[2023-03-18 19:46:38] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 2459 ms to find 0 implicit places.
[2023-03-18 19:46:38] [INFO ] Invariant cache hit.
[2023-03-18 19:46:42] [INFO ] Dead Transitions using invariants and state equation in 4525 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7047 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Support contains 2651 out of 2651 places after structural reductions.
[2023-03-18 19:46:44] [INFO ] Flatten gal took : 708 ms
[2023-03-18 19:46:45] [INFO ] Flatten gal took : 431 ms
[2023-03-18 19:46:47] [INFO ] Input system was already deterministic with 5050 transitions.
Finished random walk after 103 steps, including 0 resets, run visited all 6 properties in 23 ms. (steps per millisecond=4 )
FORMULA SharedMemory-COL-000050-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(F((G((p1&&F(p2)))||p0)))'
Support contains 201 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 1183 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:46:49] [INFO ] Invariant cache hit.
[2023-03-18 19:46:49] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-18 19:46:49] [INFO ] Invariant cache hit.
[2023-03-18 19:46:50] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1590 ms to find 0 implicit places.
[2023-03-18 19:46:51] [INFO ] Redundant transitions in 526 ms returned []
[2023-03-18 19:46:51] [INFO ] Invariant cache hit.
[2023-03-18 19:46:55] [INFO ] Dead Transitions using invariants and state equation in 3830 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7149 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s17 1) (GEQ s117 1)) (AND (GEQ s27 1) (GEQ s127 1)) (AND (GEQ s7 1) (GEQ s107 1)) (AND (GEQ s37 1) (GEQ s137 1)) (AND (GEQ s39 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 62350 steps with 20624 reset in 10002 ms.
Stack based approach found an accepted trace after 2015 steps with 658 reset with depth 2 and stack size 2 in 317 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-01 finished in 17859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U !p1)&&F((p2&&G(F(p0)))))))'
Support contains 2600 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 564 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:47:06] [INFO ] Invariant cache hit.
[2023-03-18 19:47:06] [INFO ] Implicit Places using invariants in 675 ms returned []
[2023-03-18 19:47:06] [INFO ] Invariant cache hit.
[2023-03-18 19:47:08] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 2179 ms to find 0 implicit places.
[2023-03-18 19:47:08] [INFO ] Redundant transitions in 488 ms returned []
[2023-03-18 19:47:08] [INFO ] Invariant cache hit.
[2023-03-18 19:47:13] [INFO ] Dead Transitions using invariants and state equation in 4868 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8116 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p2) p1), (NOT p0), (NOT p0), (OR (NOT p2) p1), (NOT p2), p1]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s194 1) (GEQ s192 1) (GEQ s198 1) (GEQ s196 1) (GEQ s151 1) (GEQ s155 1) (GEQ s153 1) (GEQ s159 1) (GEQ s157 1) (GEQ s163 1) (GEQ s161 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1046 reset in 9612 ms.
Stack based approach found an accepted trace after 3031 steps with 32 reset with depth 5 and stack size 5 in 307 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-02 finished in 18365 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 100 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 986 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:47:25] [INFO ] Invariant cache hit.
[2023-03-18 19:47:25] [INFO ] Implicit Places using invariants in 756 ms returned []
[2023-03-18 19:47:25] [INFO ] Invariant cache hit.
[2023-03-18 19:47:26] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1713 ms to find 0 implicit places.
[2023-03-18 19:47:27] [INFO ] Redundant transitions in 456 ms returned []
[2023-03-18 19:47:27] [INFO ] Invariant cache hit.
[2023-03-18 19:47:32] [INFO ] Dead Transitions using invariants and state equation in 5195 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8362 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-03 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 (AND (GEQ s17 1) (GEQ s117 1)) (AND (GEQ s27 1) (GEQ s127 1)) (AND (GEQ s7 1) (GEQ s107 1)) (AND (GEQ s37 1) (GEQ s137 1)) (AND (GEQ s39 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 86720 steps with 1341 reset in 10002 ms.
Stack based approach found an accepted trace after 75667 steps with 1217 reset with depth 227 and stack size 223 in 8377 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-03 finished in 26854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 50 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 1149 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:47:52] [INFO ] Invariant cache hit.
[2023-03-18 19:47:52] [INFO ] Implicit Places using invariants in 814 ms returned []
[2023-03-18 19:47:52] [INFO ] Invariant cache hit.
[2023-03-18 19:47:54] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2507 ms to find 0 implicit places.
[2023-03-18 19:47:54] [INFO ] Redundant transitions in 278 ms returned []
[2023-03-18 19:47:54] [INFO ] Invariant cache hit.
[2023-03-18 19:47:59] [INFO ] Dead Transitions using invariants and state equation in 4340 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8284 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s194 1) (GEQ s192 1) (GEQ s198 1) (GEQ s196 1) (GEQ s151 1) (GEQ s155 1) (GEQ s153 1) (GEQ s159 1) (GEQ s157 1) (GEQ s163 1) (GEQ s161 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 20840 steps with 0 reset in 10004 ms.
Stack based approach found an accepted trace after 83 steps with 0 reset with depth 84 and stack size 84 in 3 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-04 finished in 18367 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(p0)||X(G(!p0))))'
Support contains 2450 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 19 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:48:09] [INFO ] Invariant cache hit.
[2023-03-18 19:48:10] [INFO ] Implicit Places using invariants in 980 ms returned []
[2023-03-18 19:48:10] [INFO ] Invariant cache hit.
[2023-03-18 19:48:11] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2681 ms to find 0 implicit places.
[2023-03-18 19:48:11] [INFO ] Invariant cache hit.
[2023-03-18 19:48:17] [INFO ] Dead Transitions using invariants and state equation in 5452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8154 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s1088 1) (GEQ s1343 1) (GEQ s1598 1) (GEQ s1852 1) (GEQ s833 1) (GEQ s323 1) (GEQ s578 1) (GEQ s2362 1) (GEQ s2617 1) (GEQ s1008 1) (GEQ s2028...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 2 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-07 finished in 8367 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(!p1)))))'
Support contains 2500 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 20 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:48:17] [INFO ] Invariant cache hit.
[2023-03-18 19:48:18] [INFO ] Implicit Places using invariants in 802 ms returned []
[2023-03-18 19:48:18] [INFO ] Invariant cache hit.
[2023-03-18 19:48:20] [INFO ] Implicit Places using invariants and state equation in 1710 ms returned []
Implicit Place search using SMT with State Equation took 2514 ms to find 0 implicit places.
[2023-03-18 19:48:20] [INFO ] Invariant cache hit.
[2023-03-18 19:48:25] [INFO ] Dead Transitions using invariants and state equation in 5110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7647 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, p1, (AND p1 p0), (AND p0 p1)]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (GEQ s1088 1) (GEQ s1343 1) (GEQ s1598 1) (GEQ s1852 1) (GEQ s833 1) (GEQ s323 1) (GEQ s578 1) (GEQ s2362 1) (GEQ s2617 1) (GEQ s1008 1) (GEQ s2028...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-08 finished in 7799 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(p0)||X(F(p1))))'
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 213 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:48:25] [INFO ] Invariant cache hit.
[2023-03-18 19:48:26] [INFO ] Implicit Places using invariants in 722 ms returned []
[2023-03-18 19:48:26] [INFO ] Invariant cache hit.
[2023-03-18 19:48:27] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 2143 ms to find 0 implicit places.
[2023-03-18 19:48:27] [INFO ] Invariant cache hit.
[2023-03-18 19:48:32] [INFO ] Dead Transitions using invariants and state equation in 4631 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6990 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s17 1) (GEQ s117 1)) (AND (GEQ s27 1) (GEQ s127 1)) (AND (GEQ s7 1) (GEQ s107 1)) (AND (GEQ s37 1) (GEQ s137 1)) (AND (GEQ s39 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 30227 reset in 2623 ms.
Product exploration explored 100000 steps with 30213 reset in 2592 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 299 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 225 steps, including 0 resets, run visited all 3 properties in 54 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 349 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 204 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:48:39] [INFO ] Invariant cache hit.
[2023-03-18 19:48:39] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-18 19:48:39] [INFO ] Invariant cache hit.
[2023-03-18 19:48:41] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 2063 ms to find 0 implicit places.
[2023-03-18 19:48:41] [INFO ] Invariant cache hit.
[2023-03-18 19:48:46] [INFO ] Dead Transitions using invariants and state equation in 5438 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7707 ms. Remains : 2651/2651 places, 5050/5050 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 p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 359 steps, including 0 resets, run visited all 3 properties in 120 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 371 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 30255 reset in 2611 ms.
Product exploration explored 100000 steps with 30327 reset in 2672 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 1101 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:48:54] [INFO ] Redundant transitions in 285 ms returned []
[2023-03-18 19:48:54] [INFO ] Invariant cache hit.
[2023-03-18 19:48:59] [INFO ] Dead Transitions using invariants and state equation in 4862 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6255 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 207 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:48:59] [INFO ] Invariant cache hit.
[2023-03-18 19:49:00] [INFO ] Implicit Places using invariants in 664 ms returned []
[2023-03-18 19:49:00] [INFO ] Invariant cache hit.
[2023-03-18 19:49:01] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 2034 ms to find 0 implicit places.
[2023-03-18 19:49:01] [INFO ] Invariant cache hit.
[2023-03-18 19:49:07] [INFO ] Dead Transitions using invariants and state equation in 5394 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7640 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Treatment of property SharedMemory-COL-000050-LTLFireability-09 finished in 42924 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(p1))||p0))))'
Support contains 151 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 253 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:49:08] [INFO ] Invariant cache hit.
[2023-03-18 19:49:09] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-18 19:49:09] [INFO ] Invariant cache hit.
[2023-03-18 19:49:10] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned []
Implicit Place search using SMT with State Equation took 1620 ms to find 0 implicit places.
[2023-03-18 19:49:10] [INFO ] Invariant cache hit.
[2023-03-18 19:49:14] [INFO ] Dead Transitions using invariants and state equation in 4622 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6497 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s117 1)) (AND (GEQ s27 1) (GEQ s127 1)) (AND (GEQ s7 1) (GEQ s107 1)) (AND (GEQ s37 1) (GEQ s137 1)) (AND (GEQ s39 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 8580 steps with 0 reset in 10006 ms.
Stack based approach found an accepted trace after 71 steps with 0 reset with depth 72 and stack size 72 in 33 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-10 finished in 16719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2450 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 621 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:49:25] [INFO ] Invariant cache hit.
[2023-03-18 19:49:26] [INFO ] Implicit Places using invariants in 812 ms returned []
[2023-03-18 19:49:26] [INFO ] Invariant cache hit.
[2023-03-18 19:49:28] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2488 ms to find 0 implicit places.
[2023-03-18 19:49:28] [INFO ] Redundant transitions in 288 ms returned []
[2023-03-18 19:49:28] [INFO ] Invariant cache hit.
[2023-03-18 19:49:33] [INFO ] Dead Transitions using invariants and state equation in 5443 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8850 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s1088 1) (GEQ s1343 1) (GEQ s1598 1) (GEQ s1852 1) (GEQ s833 1) (GEQ s323 1) (GEQ s578 1) (GEQ s2362 1) (GEQ s2617 1) (GEQ s1008 1) (GEQ s2028...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 90980 steps with 16761 reset in 10001 ms.
Stack based approach found an accepted trace after 357 steps with 66 reset with depth 2 and stack size 2 in 40 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-12 finished in 18953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 50 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 825 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:49:44] [INFO ] Invariant cache hit.
[2023-03-18 19:49:45] [INFO ] Implicit Places using invariants in 981 ms returned []
[2023-03-18 19:49:45] [INFO ] Invariant cache hit.
[2023-03-18 19:49:47] [INFO ] Implicit Places using invariants and state equation in 1709 ms returned []
Implicit Place search using SMT with State Equation took 2692 ms to find 0 implicit places.
[2023-03-18 19:49:47] [INFO ] Redundant transitions in 285 ms returned []
[2023-03-18 19:49:47] [INFO ] Invariant cache hit.
[2023-03-18 19:49:52] [INFO ] Dead Transitions using invariants and state equation in 4331 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8141 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s194 1) (GEQ s192 1) (GEQ s198 1) (GEQ s196 1) (GEQ s151 1) (GEQ s155 1) (GEQ s153 1) (GEQ s159 1) (GEQ s157 1) (GEQ s163 1) (GEQ s161 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 20510 steps with 0 reset in 10004 ms.
Stack based approach found an accepted trace after 304 steps with 0 reset with depth 305 and stack size 293 in 75 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-13 finished in 18287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 101 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 682 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:50:02] [INFO ] Invariant cache hit.
[2023-03-18 19:50:03] [INFO ] Implicit Places using invariants in 526 ms returned []
[2023-03-18 19:50:03] [INFO ] Invariant cache hit.
[2023-03-18 19:50:04] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1743 ms to find 0 implicit places.
[2023-03-18 19:50:05] [INFO ] Redundant transitions in 279 ms returned []
[2023-03-18 19:50:05] [INFO ] Invariant cache hit.
[2023-03-18 19:50:10] [INFO ] Dead Transitions using invariants and state equation in 5349 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8068 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s79 1) (GEQ s148 1) (GEQ s2650 1)) (AND (GEQ s80 1) (GEQ s145 1) (GEQ s2650 1)) (AND (GEQ s50 1) (GEQ s104 1) (GEQ s2650 1)) (AND (GEQ s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 95450 steps with 31530 reset in 10004 ms.
Stack based approach found an accepted trace after 448 steps with 150 reset with depth 3 and stack size 3 in 48 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-14 finished in 18197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p1 U p0) U X(!p2))))'
Support contains 201 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 190 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:50:20] [INFO ] Invariant cache hit.
[2023-03-18 19:50:21] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-18 19:50:21] [INFO ] Invariant cache hit.
[2023-03-18 19:50:22] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
[2023-03-18 19:50:22] [INFO ] Invariant cache hit.
[2023-03-18 19:50:27] [INFO ] Dead Transitions using invariants and state equation in 5304 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7048 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) p2), p2, (NOT p0), (AND (NOT p0) p2), p2, true, (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s117 1)) (AND (GEQ s27 1) (GEQ s127 1)) (AND (GEQ s7 1) (GEQ s107 1)) (AND (GEQ s37 1) (GEQ s137 1)) (AND (GEQ s39 1) (GEQ s1...], nbAcceptance=0, 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]]
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 1 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-15 finished in 7383 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(p0)||X(F(p1))))'
Found a Shortening insensitive property : SharedMemory-COL-000050-LTLFireability-09
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 232 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:50:28] [INFO ] Invariant cache hit.
[2023-03-18 19:50:29] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-18 19:50:29] [INFO ] Invariant cache hit.
[2023-03-18 19:50:30] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
[2023-03-18 19:50:30] [INFO ] Invariant cache hit.
[2023-03-18 19:50:35] [INFO ] Dead Transitions using invariants and state equation in 5114 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7456 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s17 1) (GEQ s117 1)) (AND (GEQ s27 1) (GEQ s127 1)) (AND (GEQ s7 1) (GEQ s107 1)) (AND (GEQ s37 1) (GEQ s137 1)) (AND (GEQ s39 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 30255 reset in 2645 ms.
Product exploration explored 100000 steps with 30505 reset in 2738 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 344 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 161 steps, including 0 resets, run visited all 3 properties in 26 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 343 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 189 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:50:42] [INFO ] Invariant cache hit.
[2023-03-18 19:50:42] [INFO ] Implicit Places using invariants in 656 ms returned []
[2023-03-18 19:50:42] [INFO ] Invariant cache hit.
[2023-03-18 19:50:44] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 2123 ms to find 0 implicit places.
[2023-03-18 19:50:44] [INFO ] Invariant cache hit.
[2023-03-18 19:50:49] [INFO ] Dead Transitions using invariants and state equation in 5183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7499 ms. Remains : 2651/2651 places, 5050/5050 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 p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 248 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 221 steps, including 0 resets, run visited all 3 properties in 34 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 295 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 30215 reset in 2824 ms.
Product exploration explored 100000 steps with 30189 reset in 2881 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 695 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:50:57] [INFO ] Redundant transitions in 282 ms returned []
[2023-03-18 19:50:57] [INFO ] Invariant cache hit.
[2023-03-18 19:51:02] [INFO ] Dead Transitions using invariants and state equation in 5274 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6260 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 187 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-18 19:51:02] [INFO ] Invariant cache hit.
[2023-03-18 19:51:03] [INFO ] Implicit Places using invariants in 704 ms returned []
[2023-03-18 19:51:03] [INFO ] Invariant cache hit.
[2023-03-18 19:51:05] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 2105 ms to find 0 implicit places.
[2023-03-18 19:51:05] [INFO ] Invariant cache hit.
[2023-03-18 19:51:10] [INFO ] Dead Transitions using invariants and state equation in 5458 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7753 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Treatment of property SharedMemory-COL-000050-LTLFireability-09 finished in 43096 ms.
[2023-03-18 19:51:11] [INFO ] Flatten gal took : 170 ms
[2023-03-18 19:51:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2023-03-18 19:51:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2651 places, 5050 transitions and 20000 arcs took 32 ms.
Total runtime 277367 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SharedMemory-COL-000050
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability
FORMULA SharedMemory-COL-000050-LTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679169087948
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 SharedMemory-COL-000050-LTLFireability-09
lola: time limit : 3585 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for SharedMemory-COL-000050-LTLFireability-09
lola: result : false
lola: markings : 515
lola: fired transitions : 515
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SharedMemory-COL-000050-LTLFireability-09: LTL false LTL model checker
Time elapsed: 15 secs. Pages in use: 1
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SharedMemory-COL-000050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is SharedMemory-COL-000050, 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 r359-smll-167891809200572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-000050.tgz
mv SharedMemory-COL-000050 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 ;