About the Execution of LoLa+red for SharedMemory-PT-000050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1180.348 | 292441.00 | 335488.00 | 1614.00 | FFFFFTFFFFTFFFFF | 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-167891809400684.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-PT-000050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891809400684
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 685K Feb 25 16:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Feb 25 16:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Feb 25 15:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.1M Feb 25 15:27 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 665K Feb 25 16:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 16:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 480K Feb 25 16:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 16:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5M Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.7M Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3M Feb 25 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13M Feb 25 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.6M 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-PT-000050-LTLFireability-00
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-01
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-02
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-03
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-04
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-05
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-06
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-07
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-08
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-09
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-10
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-11
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-12
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-13
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-14
FORMULA_NAME SharedMemory-PT-000050-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679279032511
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-PT-000050
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:23:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 02:23:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:23:55] [INFO ] Load time of PNML (sax parser for PT used): 378 ms
[2023-03-20 02:23:55] [INFO ] Transformed 2651 places.
[2023-03-20 02:23:55] [INFO ] Transformed 5050 transitions.
[2023-03-20 02:23:55] [INFO ] Found NUPN structural information;
[2023-03-20 02:23:55] [INFO ] Completing missing partition info from NUPN : creating a component with [Ext_Mem_Acc_8_2, Ext_Mem_Acc_7_2, Ext_Mem_Acc_20_3, Ext_Mem_Acc_19_3, Ext_Mem_Acc_24_4, Ext_Mem_Acc_15_4, Ext_Mem_Acc_13_5, Ext_Mem_Acc_14_5, Ext_Mem_Acc_17_6, Ext_Mem_Acc_14_6, Ext_Mem_Acc_2_8, Ext_Mem_Acc_1_8, Ext_Mem_Acc_16_9, Ext_Mem_Acc_21_9, Ext_Mem_Acc_26_9, Ext_Mem_Acc_25_9, Ext_Mem_Acc_6_11, Ext_Mem_Acc_7_11, Ext_Mem_Acc_27_11, Ext_Mem_Acc_28_11, Ext_Mem_Acc_40_13, Ext_Mem_Acc_39_13, Ext_Mem_Acc_39_14, Ext_Mem_Acc_38_14, Ext_Mem_Acc_20_14, Ext_Mem_Acc_21_14, Ext_Mem_Acc_43_15, Ext_Mem_Acc_44_15, Ext_Mem_Acc_49_16, Ext_Mem_Acc_48_16, Ext_Mem_Acc_40_18, Ext_Mem_Acc_41_18, Ext_Mem_Acc_13_20, Ext_Mem_Acc_14_20, Ext_Mem_Acc_37_21, Ext_Mem_Acc_38_21, Ext_Mem_Acc_41_20, Ext_Mem_Acc_40_20, Ext_Mem_Acc_45_23, Ext_Mem_Acc_46_23, Ext_Mem_Acc_16_22, Ext_Mem_Acc_15_22, Ext_Mem_Acc_11_26, Ext_Mem_Acc_12_26, Ext_Mem_Acc_31_24, Ext_Mem_Acc_30_24, Ext_Mem_Acc_31_25, Ext_Mem_Acc_32_25, Ext_Mem_Acc_21_29, Ext_Mem_Acc_20_29, Ext_Mem_Acc_13_28, Ext_Mem_Acc_16_28, Ext_Mem_Acc_15_31, Ext_Mem_Acc_14_31, Ext_Mem_Acc_16_30, Ext_Mem_Acc_13_30, Ext_Mem_Acc_24_34, Ext_Mem_Acc_21_34, Ext_Mem_Acc_9_34, Ext_Mem_Acc_12_34, Ext_Mem_Acc_20_32, Ext_Mem_Acc_21_32, Ext_Mem_Acc_25_37, Ext_Mem_Acc_22_37, Ext_Mem_Acc_2_36, Ext_Mem_Acc_49_35, Ext_Mem_Acc_6_40, Ext_Mem_Acc_5_40, Ext_Mem_Acc_42_38, Ext_Mem_Acc_43_38, Ext_Mem_Acc_44_37, Ext_Mem_Acc_43_37, Ext_Mem_Acc_38_41, Ext_Mem_Acc_39_41, Ext_Mem_Acc_43_40, Ext_Mem_Acc_42_40, Ext_Mem_Acc_36_45, Ext_Mem_Acc_37_45, Ext_Mem_Acc_6_46, Ext_Mem_Acc_5_46, Ext_Mem_Acc_29_47, Ext_Mem_Acc_28_47, Ext_Mem_Acc_41_43, Ext_Mem_Acc_40_43, Ext_Mem_Acc_17_44, Ext_Mem_Acc_18_44, Ext_Mem_Acc_34_50, Ext_Mem_Acc_33_50, Ext_Mem_Acc_44_48, Ext_Mem_Acc_45_48, Ext_Mem_Acc_2_50, Ext_Mem_Acc_3_50]
[2023-03-20 02:23:55] [INFO ] Parsed PT model containing 2651 places and 5050 transitions and 20000 arcs in 540 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 103 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA SharedMemory-PT-000050-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000050-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000050-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000050-LTLFireability-11 FALSE 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 49 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
// Phase 1: matrix 5050 rows 2651 cols
[2023-03-20 02:23:58] [INFO ] Computed 101 place invariants in 411 ms
[2023-03-20 02:23:59] [INFO ] Implicit Places using invariants in 1423 ms returned []
[2023-03-20 02:23:59] [INFO ] Invariant cache hit.
[2023-03-20 02:23:59] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 2150 ms to find 0 implicit places.
[2023-03-20 02:23:59] [INFO ] Invariant cache hit.
[2023-03-20 02:24:05] [INFO ] Dead Transitions using invariants and state equation in 5557 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7765 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Support contains 2651 out of 2651 places after structural reductions.
[2023-03-20 02:24:06] [INFO ] Flatten gal took : 601 ms
[2023-03-20 02:24:07] [INFO ] Flatten gal took : 417 ms
[2023-03-20 02:24:08] [INFO ] Input system was already deterministic with 5050 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4238 ms. (steps per millisecond=2 ) properties (out of 23) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:24:13] [INFO ] Invariant cache hit.
[2023-03-20 02:24:14] [INFO ] [Real]Absence check using 101 positive place invariants in 148 ms returned sat
[2023-03-20 02:24:17] [INFO ] After 3260ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-20 02:24:19] [INFO ] After 4563ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 656 ms.
[2023-03-20 02:24:19] [INFO ] After 6550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=4 )
Parikh walk visited 4 properties in 21 ms.
FORMULA SharedMemory-PT-000050-LTLFireability-08 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' '!(((((p0 U (p1&&G(p2))) U (G((p0 U (p1&&G(p2))))||(!p0&&(p0 U (p1&&G(p2)))))) U (G((p0 U (p1&&G(p2))))||(p0&&((p0 U (p1&&G(p2))) U (G((p0 U (p1&&G(p2))))||(!p0&&(p0 U (p1&&G(p2))))))))) U ((!p0&&(((p0 U (p1&&G(p2))) U (G((p0 U (p1&&G(p2))))||(!p0&&(p0 U (p1&&G(p2)))))) U (G((p0 U (p1&&G(p2))))||(p0&&((p0 U (p1&&G(p2))) U (G((p0 U (p1&&G(p2))))||(!p0&&(p0 U (p1&&G(p2))))))))))||G((((p0 U (p1&&G(p2))) U (G((p0 U (p1&&G(p2))))||(!p0&&(p0 U (p1&&G(p2)))))) U (G((p0 U (p1&&G(p2))))||(p0&&((p0 U (p1&&G(p2))) U (G((p0 U (p1&&G(p2))))||(!p0&&(p0 U (p1&&G(p2)))))))))))))'
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 1187 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:24:21] [INFO ] Invariant cache hit.
[2023-03-20 02:24:22] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2023-03-20 02:24:22] [INFO ] Invariant cache hit.
[2023-03-20 02:24:23] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
[2023-03-20 02:24:24] [INFO ] Redundant transitions in 638 ms returned []
[2023-03-20 02:24:24] [INFO ] Invariant cache hit.
[2023-03-20 02:24:28] [INFO ] Dead Transitions using invariants and state equation in 4349 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8146 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 478 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (OR (AND p0 (NOT p2)) (AND (NOT p1) p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : SharedMemory-PT-000050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s2402 1) (EQ s2400 1) (EQ s2406 1) (EQ s2404 1) (EQ s2410 1) (EQ s2408 1) (EQ s2412 1) (EQ s2418 1) (EQ s2422 1) (EQ s2428 1) (EQ s2424 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 239 steps with 0 reset in 36 ms.
FORMULA SharedMemory-PT-000050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000050-LTLFireability-00 finished in 8783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p1&&(F(p3)||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 837 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:24:30] [INFO ] Invariant cache hit.
[2023-03-20 02:24:30] [INFO ] Implicit Places using invariants in 657 ms returned []
[2023-03-20 02:24:30] [INFO ] Invariant cache hit.
[2023-03-20 02:24:31] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
[2023-03-20 02:24:31] [INFO ] Redundant transitions in 495 ms returned []
[2023-03-20 02:24:31] [INFO ] Invariant cache hit.
[2023-03-20 02:24:37] [INFO ] Dead Transitions using invariants and state equation in 5259 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7889 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : SharedMemory-PT-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) (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (EQ s2338 1) (EQ s2637 1)) (AND (EQ s2333 1) (EQ s2565 1)) (AND (EQ s2343 1) (EQ s2571 1)) (AND (EQ s2351 1) (EQ s2622 1)) (AND (EQ s2364 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 19320 steps with 6420 reset in 10008 ms.
Stack based approach found an accepted trace after 16 steps with 7 reset with depth 2 and stack size 2 in 12 ms.
FORMULA SharedMemory-PT-000050-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000050-LTLFireability-01 finished in 18125 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(p3)))))))'
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 859 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:24:48] [INFO ] Invariant cache hit.
[2023-03-20 02:24:49] [INFO ] Implicit Places using invariants in 892 ms returned []
[2023-03-20 02:24:49] [INFO ] Invariant cache hit.
[2023-03-20 02:24:50] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
[2023-03-20 02:24:50] [INFO ] Redundant transitions in 306 ms returned []
[2023-03-20 02:24:50] [INFO ] Invariant cache hit.
[2023-03-20 02:24:55] [INFO ] Dead Transitions using invariants and state equation in 5352 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8324 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p3) (NOT p2) p1), (NOT p3), (NOT p3), (OR (NOT p2) p1), (NOT p2), p1]
Running random walk in product with property : SharedMemory-PT-000050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(OR (EQ s2402 1) (EQ s2400 1) (EQ s2406 1) (EQ s2404 1) (EQ s2410 1) (EQ s2408 1) (EQ s2412 1) (EQ s2418 1) (EQ s2422 1) (EQ s2428 1) (EQ s2367 1) (EQ ...], 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 1127 reset in 7804 ms.
Stack based approach found an accepted trace after 3398 steps with 31 reset with depth 4 and stack size 4 in 288 ms.
FORMULA SharedMemory-PT-000050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000050-LTLFireability-02 finished in 16736 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 1354 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:25:05] [INFO ] Invariant cache hit.
[2023-03-20 02:25:06] [INFO ] Implicit Places using invariants in 905 ms returned []
[2023-03-20 02:25:06] [INFO ] Invariant cache hit.
[2023-03-20 02:25:07] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
[2023-03-20 02:25:07] [INFO ] Redundant transitions in 305 ms returned []
[2023-03-20 02:25:07] [INFO ] Invariant cache hit.
[2023-03-20 02:25:12] [INFO ] Dead Transitions using invariants and state equation in 4481 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7959 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-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 (EQ s2338 1) (EQ s2637 1)) (AND (EQ s2333 1) (EQ s2565 1)) (AND (EQ s2343 1) (EQ s2571 1)) (AND (EQ s2351 1) (EQ s2622 1)) (AND (EQ s2364 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1659 reset in 8959 ms.
Product exploration explored 100000 steps with 1524 reset in 9008 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2023-03-20 02:25:31] [INFO ] Invariant cache hit.
Could not prove EG (NOT 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 815 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:25:47] [INFO ] Invariant cache hit.
[2023-03-20 02:25:47] [INFO ] Implicit Places using invariants in 932 ms returned []
[2023-03-20 02:25:47] [INFO ] Invariant cache hit.
[2023-03-20 02:25:48] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
[2023-03-20 02:25:49] [INFO ] Redundant transitions in 298 ms returned []
[2023-03-20 02:25:49] [INFO ] Invariant cache hit.
[2023-03-20 02:25:53] [INFO ] Dead Transitions using invariants and state equation in 4373 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7310 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 245 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2023-03-20 02:25:54] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1614 reset in 9088 ms.
Stack based approach found an accepted trace after 70676 steps with 986 reset with depth 4 and stack size 4 in 6179 ms.
FORMULA SharedMemory-PT-000050-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000050-LTLFireability-03 finished in 80826 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 1267 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:26:26] [INFO ] Invariant cache hit.
[2023-03-20 02:26:27] [INFO ] Implicit Places using invariants in 1147 ms returned []
[2023-03-20 02:26:27] [INFO ] Invariant cache hit.
[2023-03-20 02:26:28] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 2200 ms to find 0 implicit places.
[2023-03-20 02:26:28] [INFO ] Redundant transitions in 285 ms returned []
[2023-03-20 02:26:28] [INFO ] Invariant cache hit.
[2023-03-20 02:26:33] [INFO ] Dead Transitions using invariants and state equation in 4678 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8440 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 37 ms :[p0]
Running random walk in product with property : SharedMemory-PT-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 (EQ s2402 1) (EQ s2400 1) (EQ s2406 1) (EQ s2404 1) (EQ s2410 1) (EQ s2408 1) (EQ s2412 1) (EQ s2418 1) (EQ s2422 1) (EQ s2428 1) (EQ s2367 1) (EQ ...], 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 25910 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 63 steps with 0 reset with depth 64 and stack size 64 in 2 ms.
FORMULA SharedMemory-PT-000050-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000050-LTLFireability-04 finished in 18515 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(p1))))'
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 27 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:26:43] [INFO ] Invariant cache hit.
[2023-03-20 02:26:44] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2023-03-20 02:26:44] [INFO ] Invariant cache hit.
[2023-03-20 02:26:45] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2023-03-20 02:26:45] [INFO ] Invariant cache hit.
[2023-03-20 02:26:50] [INFO ] Dead Transitions using invariants and state equation in 4666 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6865 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s846 1) (EQ s1106 1) (EQ s1366 1) (EQ s1886 1) (EQ s1626 1) (EQ s66 1) (EQ s326 1) (EQ s586 1) (EQ s1025 1) (EQ s2065 1) (EQ s147 1) (EQ s407 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 3 ms.
FORMULA SharedMemory-PT-000050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000050-LTLFireability-07 finished in 7166 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 9 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 298 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:26:50] [INFO ] Invariant cache hit.
[2023-03-20 02:26:52] [INFO ] Implicit Places using invariants in 1035 ms returned []
[2023-03-20 02:26:52] [INFO ] Invariant cache hit.
[2023-03-20 02:26:52] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
[2023-03-20 02:26:53] [INFO ] Invariant cache hit.
[2023-03-20 02:26:57] [INFO ] Dead Transitions using invariants and state equation in 4718 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7050 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s2352 1) (EQ s2621 1) (EQ s2340 1) (EQ s2639 1)) (AND (EQ s2332 1) (EQ s2361 1) (EQ s2610 1) (EQ s2351 1) (EQ s2611 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 900 reset in 3936 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 2 ms.
FORMULA SharedMemory-PT-000050-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000050-LTLFireability-09 finished in 11103 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||X((p1||G(p2))))) U X(X(p3))))'
Support contains 4 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 233 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:27:02] [INFO ] Invariant cache hit.
[2023-03-20 02:27:03] [INFO ] Implicit Places using invariants in 1075 ms returned []
[2023-03-20 02:27:03] [INFO ] Invariant cache hit.
[2023-03-20 02:27:04] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 2148 ms to find 0 implicit places.
[2023-03-20 02:27:04] [INFO ] Invariant cache hit.
[2023-03-20 02:27:08] [INFO ] Dead Transitions using invariants and state equation in 4333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6726 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p3), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : SharedMemory-PT-000050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s2334 1) (EQ s2566 1)), p1:(EQ s2385 1), p3:(EQ s579 1), p2:(OR (EQ s2385 1) (AND (EQ s2334 1) (EQ s2566 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 85470 steps with 12569 reset in 10006 ms.
Stack based approach found an accepted trace after 60 steps with 10 reset with depth 34 and stack size 34 in 2 ms.
FORMULA SharedMemory-PT-000050-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000050-LTLFireability-12 finished in 17111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0 U (G(p0)||(p0&&(!p1||F(G(!p2))))))))))'
Support contains 6 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 230 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:27:19] [INFO ] Invariant cache hit.
[2023-03-20 02:27:20] [INFO ] Implicit Places using invariants in 993 ms returned []
[2023-03-20 02:27:20] [INFO ] Invariant cache hit.
[2023-03-20 02:27:21] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 2024 ms to find 0 implicit places.
[2023-03-20 02:27:21] [INFO ] Invariant cache hit.
[2023-03-20 02:27:25] [INFO ] Dead Transitions using invariants and state equation in 4181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6437 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : SharedMemory-PT-000050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s1770 1), p1:(AND (EQ s2332 1) (EQ s2341 1) (EQ s2600 1)), p2:(OR (AND (EQ s2376 1) (EQ s2632 1)) (EQ s1770 1))], nbAcceptance=2, 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 explored 100000 steps with 32930 reset in 2437 ms.
Product exploration explored 100000 steps with 32939 reset in 2496 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3839 ms. (steps per millisecond=2 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:27:34] [INFO ] Invariant cache hit.
[2023-03-20 02:27:35] [INFO ] After 587ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND p0 p1 p2)), (F (AND (NOT p0) p2)), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (AND p0 p1))]
Knowledge based reduction with 2 factoid took 292 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 2651 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 222 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:27:36] [INFO ] Invariant cache hit.
[2023-03-20 02:27:37] [INFO ] Implicit Places using invariants in 1042 ms returned []
[2023-03-20 02:27:37] [INFO ] Invariant cache hit.
[2023-03-20 02:27:38] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
[2023-03-20 02:27:38] [INFO ] Invariant cache hit.
[2023-03-20 02:27:42] [INFO ] Dead Transitions using invariants and state equation in 4731 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7059 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 1 factoid took 193 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 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2299 steps, including 0 resets, run visited all 2 properties in 870 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND p0 p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 267 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 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32948 reset in 2432 ms.
Product exploration explored 100000 steps with 32949 reset in 2495 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 4 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 944 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:27:51] [INFO ] Redundant transitions in 301 ms returned []
[2023-03-20 02:27:51] [INFO ] Invariant cache hit.
[2023-03-20 02:27:56] [INFO ] Dead Transitions using invariants and state equation in 5098 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6371 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Support contains 4 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 241 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:27:56] [INFO ] Invariant cache hit.
[2023-03-20 02:27:57] [INFO ] Implicit Places using invariants in 1003 ms returned []
[2023-03-20 02:27:57] [INFO ] Invariant cache hit.
[2023-03-20 02:27:58] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 2019 ms to find 0 implicit places.
[2023-03-20 02:27:58] [INFO ] Invariant cache hit.
[2023-03-20 02:28:04] [INFO ] Dead Transitions using invariants and state equation in 5442 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7710 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Treatment of property SharedMemory-PT-000050-LTLFireability-13 finished in 45986 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 U X(p1)))||F(p2)))'
Support contains 4 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 286 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:28:05] [INFO ] Invariant cache hit.
[2023-03-20 02:28:06] [INFO ] Implicit Places using invariants in 1012 ms returned []
[2023-03-20 02:28:06] [INFO ] Invariant cache hit.
[2023-03-20 02:28:07] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
[2023-03-20 02:28:07] [INFO ] Invariant cache hit.
[2023-03-20 02:28:12] [INFO ] Dead Transitions using invariants and state equation in 5273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7609 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SharedMemory-PT-000050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}]], initial=4, aps=[p2:(AND (EQ s2332 1) (EQ s2354 1) (EQ s2414 1)), p0:(OR (EQ s1270 1) (AND (EQ s2332 1) (EQ s2354 1) (EQ s2414 1))), p1:(EQ s1270 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 999 reset in 3110 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 1 ms.
FORMULA SharedMemory-PT-000050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000050-LTLFireability-14 finished in 10952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 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 220 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:28:16] [INFO ] Invariant cache hit.
[2023-03-20 02:28:17] [INFO ] Implicit Places using invariants in 1106 ms returned []
[2023-03-20 02:28:17] [INFO ] Invariant cache hit.
[2023-03-20 02:28:18] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 2201 ms to find 0 implicit places.
[2023-03-20 02:28:18] [INFO ] Invariant cache hit.
[2023-03-20 02:28:23] [INFO ] Dead Transitions using invariants and state equation in 4860 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7283 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s2317 1) (NEQ s2564 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 26129 reset in 2292 ms.
Stack based approach found an accepted trace after 342 steps with 81 reset with depth 37 and stack size 37 in 9 ms.
FORMULA SharedMemory-PT-000050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000050-LTLFireability-15 finished in 9722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0 U (G(p0)||(p0&&(!p1||F(G(!p2))))))))))'
Found a Shortening insensitive property : SharedMemory-PT-000050-LTLFireability-13
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2)]
Support contains 6 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 259 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-20 02:28:26] [INFO ] Invariant cache hit.
[2023-03-20 02:28:27] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2023-03-20 02:28:27] [INFO ] Invariant cache hit.
[2023-03-20 02:28:28] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
[2023-03-20 02:28:28] [INFO ] Invariant cache hit.
[2023-03-20 02:28:32] [INFO ] Dead Transitions using invariants and state equation in 4696 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7017 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Running random walk in product with property : SharedMemory-PT-000050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s1770 1), p1:(AND (EQ s2332 1) (EQ s2341 1) (EQ s2600 1)), p2:(OR (AND (EQ s2376 1) (EQ s2632 1)) (EQ s1770 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 32908 reset in 2371 ms.
Stack based approach found an accepted trace after 26553 steps with 8739 reset with depth 59 and stack size 59 in 650 ms.
Treatment of property SharedMemory-PT-000050-LTLFireability-13 finished in 10328 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-20 02:28:36] [INFO ] Flatten gal took : 254 ms
[2023-03-20 02:28:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 02:28:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2651 places, 5050 transitions and 20000 arcs took 29 ms.
Total runtime 280984 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SharedMemory-PT-000050
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability
FORMULA SharedMemory-PT-000050-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679279324952
--------------------
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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 SharedMemory-PT-000050-LTLFireability-13
lola: time limit : 3595 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SharedMemory-PT-000050-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 2/3595 1/32 SharedMemory-PT-000050-LTLFireability-13 18097 m, 3619 m/sec, 18097 t fired, .
Time elapsed: 7 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 1
lola: FINISHED task # 1 (type EXCL) for SharedMemory-PT-000050-LTLFireability-13
lola: result : false
lola: markings : 21355
lola: fired transitions : 21355
lola: time used : 2.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SharedMemory-PT-000050-LTLFireability-13: LTL false LTL model checker
Time elapsed: 7 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-PT-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-PT-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-167891809400684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-PT-000050.tgz
mv SharedMemory-PT-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 ;