About the Execution of ITS-Tools for LamportFastMutEx-PT-2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 308.216 | 7695.00 | 14721.00 | 123.70 | FTFFFFFFFFFFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r121-tall-162075407200645.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LamportFastMutEx-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407200645
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 32K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 184K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 43K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 232K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.3K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 25 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 25 07:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 48K May 5 16:51 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 LamportFastMutEx-PT-2-00
FORMULA_NAME LamportFastMutEx-PT-2-01
FORMULA_NAME LamportFastMutEx-PT-2-02
FORMULA_NAME LamportFastMutEx-PT-2-03
FORMULA_NAME LamportFastMutEx-PT-2-04
FORMULA_NAME LamportFastMutEx-PT-2-05
FORMULA_NAME LamportFastMutEx-PT-2-06
FORMULA_NAME LamportFastMutEx-PT-2-07
FORMULA_NAME LamportFastMutEx-PT-2-08
FORMULA_NAME LamportFastMutEx-PT-2-09
FORMULA_NAME LamportFastMutEx-PT-2-10
FORMULA_NAME LamportFastMutEx-PT-2-11
FORMULA_NAME LamportFastMutEx-PT-2-12
FORMULA_NAME LamportFastMutEx-PT-2-13
FORMULA_NAME LamportFastMutEx-PT-2-14
FORMULA_NAME LamportFastMutEx-PT-2-15
=== Now, execution of the tool begins
BK_START 1620881267063
Running Version 0
[2021-05-13 04:47:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 04:47:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 04:47:48] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-13 04:47:48] [INFO ] Transformed 69 places.
[2021-05-13 04:47:48] [INFO ] Transformed 96 transitions.
[2021-05-13 04:47:48] [INFO ] Found NUPN structural information;
[2021-05-13 04:47:48] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_await_13_0, P_await_13_1, P_await_13_2, P_done_0_0, P_done_0_1, P_done_0_2, P_done_1_0, P_done_1_1, P_done_1_2, P_done_2_0, P_done_2_1, P_done_2_2, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_awaity_0, P_awaity_1, P_awaity_2, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2]
[2021-05-13 04:47:48] [INFO ] Parsed PT model containing 69 places and 96 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 04:47:48] [INFO ] Initial state test concluded for 2 properties.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
FORMULA LamportFastMutEx-PT-2-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 44 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 13 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2021-05-13 04:47:48] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 04:47:48] [INFO ] Computed 10 place invariants in 10 ms
[2021-05-13 04:47:48] [INFO ] Implicit Places using invariants in 110 ms returned []
[2021-05-13 04:47:48] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 04:47:48] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-13 04:47:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-13 04:47:49] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2021-05-13 04:47:49] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 04:47:49] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-13 04:47:49] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 44/44 places, 62/62 transitions.
[2021-05-13 04:47:49] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-13 04:47:49] [INFO ] Flatten gal took : 26 ms
FORMULA LamportFastMutEx-PT-2-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 04:47:49] [INFO ] Flatten gal took : 9 ms
[2021-05-13 04:47:49] [INFO ] Input system was already deterministic with 62 transitions.
Finished random walk after 125 steps, including 0 resets, run visited all 14 properties in 4 ms. (steps per millisecond=31 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((F(p1)&&(p2||F(p3)))||p0))))], workingDir=/home/mcc/execution]
Support contains 11 out of 44 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2021-05-13 04:47:49] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 04:47:49] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-13 04:47:49] [INFO ] Implicit Places using invariants in 37 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
[2021-05-13 04:47:49] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 42 cols
[2021-05-13 04:47:49] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-13 04:47:49] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 42/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2021-05-13 04:47:49] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 42 cols
[2021-05-13 04:47:49] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-13 04:47:49] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/44 places, 62/62 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p3)]
Running random walk in product with property : LamportFastMutEx-PT-2-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s6 1) (EQ s16 1)) (AND (EQ s6 1) (EQ s17 1)) (AND (EQ s7 1) (EQ s16 1)) (AND (EQ s7 1) (EQ s17 1))), p1:(OR (EQ s24 1) (EQ s25 1)), p2:(AND (OR (EQ s2 0) (EQ s21 0)) (OR (EQ s4 0) (EQ s20 0)) (OR (EQ s2 0) (EQ s20 0)) (OR (EQ s3 0) (EQ s21 0))), p3:(OR (AND (NEQ s6 0) (NEQ s16 0)) (AND (NEQ s6 0) (NEQ s17 0)) (AND (NEQ s7 0) (NEQ s16 0)) (AND (NEQ s7 0) (NEQ s17 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6137 reset in 299 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 1 ms.
FORMULA LamportFastMutEx-PT-2-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-2-00 finished in 721 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X((X(p1)&&(!p1 U ((F(p3)&&p2)||G(!p1)))))&&p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 44 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2021-05-13 04:47:50] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 04:47:50] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-13 04:47:50] [INFO ] Implicit Places using invariants in 42 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
[2021-05-13 04:47:50] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 42 cols
[2021-05-13 04:47:50] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-13 04:47:50] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 42/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2021-05-13 04:47:50] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 42 cols
[2021-05-13 04:47:50] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-13 04:47:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/44 places, 62/62 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (NOT p1), (OR (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (OR (NOT p3) (NOT p2) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p1) (NOT p3) (NOT p2)), (OR (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-PT-2-02 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2 p3 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 5}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2 p3), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p2 p3), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 8}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={0} source=5 dest: 4}], [{ cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={0} source=6 dest: 0}, { cond=(AND p0 p2 p3 (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 8}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0} source=7 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={0} source=7 dest: 3}, { cond=(AND p2 (NOT p3) p1), acceptance={0} source=7 dest: 4}], [{ cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={0} source=8 dest: 0}, { cond=(AND p0 p2 p3 (NOT p1)), acceptance={0} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=8 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=8 dest: 3}, { cond=(AND p2 (NOT p3) p1), acceptance={0} source=8 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={0} source=8 dest: 5}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 8}]], initial=2, aps=[p0:(AND (OR (NEQ s10 1) (NEQ s23 1)) (OR (NEQ s9 1) (NEQ s22 1)) (OR (NEQ s11 1) (NEQ s23 1)) (OR (NEQ s8 1) (NEQ s22 1))), p1:(OR (AND (EQ s10 1) (EQ s23 1)) (AND (EQ s9 1) (EQ s22 1)) (AND (EQ s11 1) (EQ s23 1)) (AND (EQ s8 1) (EQ s22 1))), p2:(AND (OR (NEQ s10 1) (NEQ s23 1)) (OR (NEQ s9 1) (NEQ s22 1)) (OR (NEQ s11 1) (NEQ s23 1)) (OR (NEQ s8 1) (NEQ s22 1))), p3:(OR (AND (EQ s5 1) (EQ s16 1)) (AND (EQ s5 1) (EQ s17 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4027 reset in 341 ms.
Stack based approach found an accepted trace after 474 steps with 19 reset with depth 39 and stack size 39 in 2 ms.
FORMULA LamportFastMutEx-PT-2-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-2-02 finished in 823 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U p1))], workingDir=/home/mcc/execution]
Support contains 7 out of 44 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 10 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2021-05-13 04:47:50] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 04:47:50] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-13 04:47:50] [INFO ] Implicit Places using invariants in 31 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
[2021-05-13 04:47:50] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 04:47:50] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 42 cols
[2021-05-13 04:47:50] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-13 04:47:50] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 42/44 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2021-05-13 04:47:50] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 04:47:50] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 42 cols
[2021-05-13 04:47:50] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-13 04:47:51] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/44 places, 62/62 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-2-03 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (EQ s7 1) (EQ s34 1)) (AND (EQ s5 1) (EQ s34 1)) (AND (EQ s6 1) (EQ s35 1)) (AND (EQ s5 1) (EQ s35 1))), p0:(OR (EQ s24 1) (EQ s25 1))], nbAcceptance=0, 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 6272 reset in 112 ms.
Stack based approach found an accepted trace after 148 steps with 11 reset with depth 17 and stack size 17 in 1 ms.
FORMULA LamportFastMutEx-PT-2-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-2-03 finished in 307 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 10 out of 44 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 44/44 places, 62/62 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 60
Applied a total of 4 rules in 13 ms. Remains 42 /44 variables (removed 2) and now considering 60/62 (removed 2) transitions.
[2021-05-13 04:47:51] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
// Phase 1: matrix 54 rows 42 cols
[2021-05-13 04:47:51] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-13 04:47:51] [INFO ] Implicit Places using invariants in 44 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
[2021-05-13 04:47:51] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 04:47:51] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
// Phase 1: matrix 54 rows 40 cols
[2021-05-13 04:47:51] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-13 04:47:51] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 40/44 places, 60/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2021-05-13 04:47:51] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 04:47:51] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
// Phase 1: matrix 54 rows 40 cols
[2021-05-13 04:47:51] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-13 04:47:51] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 40/44 places, 60/62 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-2-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s3 1) (EQ s13 1)) (AND (EQ s3 1) (EQ s12 1)) (AND (EQ s4 1) (EQ s12 1)) (AND (EQ s4 1) (EQ s13 1)) (AND (EQ s2 1) (EQ s13 1)) (AND (EQ s2 1) (EQ s12 1))), p1:(OR (AND (EQ s7 1) (EQ s32 1)) (AND (EQ s5 1) (EQ s32 1)) (AND (EQ s6 1) (EQ s33 1)) (AND (EQ s5 1) (EQ s33 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 152 ms.
Stack based approach found an accepted trace after 59 steps with 6 reset with depth 44 and stack size 44 in 1 ms.
FORMULA LamportFastMutEx-PT-2-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-2-04 finished in 378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (G(p0)||((G(!p2)||(G(p4)&&p3))&&p1))))))], workingDir=/home/mcc/execution]
Support contains 11 out of 44 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2021-05-13 04:47:51] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 04:47:51] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-13 04:47:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2021-05-13 04:47:51] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 04:47:51] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-13 04:47:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-13 04:47:51] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2021-05-13 04:47:51] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 04:47:51] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 04:47:51] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-13 04:47:51] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 44/44 places, 62/62 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) p2 (NOT p4))), (AND (NOT p0) p2 (NOT p4)), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p2 (NOT p3)))]
Running random walk in product with property : LamportFastMutEx-PT-2-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (AND p2 (NOT p3)) (AND p2 (NOT p4))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 p3 p4), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) p3 p4 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4))), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p4) (NOT p0))), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(OR (AND (NOT p1) p0) (AND p2 (NOT p3) p0) (AND p2 (NOT p4) p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p2 p3 p4 (NOT p0)), acceptance={0, 2} source=1 dest: 2}, { cond=(AND p1 p2 p3 p4 p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p2) p3 p4 (NOT p0)), acceptance={2} source=1 dest: 3}, { cond=(AND p1 (NOT p2) p3 p4 p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p2) (NOT p3) (NOT p0)) (AND p1 (NOT p2) (NOT p4) (NOT p0))), acceptance={1, 2} source=1 dest: 4}, { cond=(OR (AND p1 (NOT p2) (NOT p3) p0) (AND p1 (NOT p2) (NOT p4) p0)), acceptance={1} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p4) (NOT p0)) (AND p2 (NOT p4) (NOT p0))), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p4) p0) (AND p2 (NOT p4) p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p4 (NOT p0)) (AND p2 p4 (NOT p0))), acceptance={0, 2} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p4 p0) (AND p2 p4 p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p4 (NOT p0)), acceptance={2} source=2 dest: 3}, { cond=(AND p1 (NOT p2) p4 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p4) (NOT p0)), acceptance={1, 2} source=2 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p4) p0), acceptance={1} source=2 dest: 4}], [{ cond=(AND p2 (NOT p4) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p2 (NOT p4) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 p4 (NOT p0)), acceptance={0, 2} source=3 dest: 2}, { cond=(AND p2 p4 p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p4 (NOT p0)), acceptance={2} source=3 dest: 3}, { cond=(AND (NOT p2) p4 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p4) (NOT p0)), acceptance={1, 2} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p4) p0), acceptance={1} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) p2 (NOT p0)) (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p4) (NOT p0))), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(OR (AND (NOT p1) p2 p0) (AND p2 (NOT p3) p0) (AND p2 (NOT p4) p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 p2 p3 p4 (NOT p0)), acceptance={0, 2} source=4 dest: 2}, { cond=(AND p1 p2 p3 p4 p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2) p3 p4 (NOT p0)), acceptance={2} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p3 p4 p0), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p4) (NOT p0))), acceptance={1, 2} source=4 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p2) (NOT p3) p0) (AND (NOT p2) (NOT p4) p0)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (NEQ s5 1) (NEQ s38 1)) (OR (NEQ s5 1) (NEQ s39 1))), p2:(OR (AND (EQ s5 1) (EQ s16 1)) (AND (EQ s5 1) (EQ s17 1))), p3:(AND (OR (NEQ s5 1) (NEQ s16 1)) (OR (NEQ s5 1) (NEQ s17 1))), p4:(OR (AND (NEQ s30 0) (NEQ s32 0) (NEQ s33 0)) (AND (NEQ s31 0) (NEQ s34 0) (NEQ s35 0))), p0:(AND (OR (NEQ s5 1) (NEQ s38 1)) (OR (NEQ s5 1) (NEQ s39 1)))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 538 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA LamportFastMutEx-PT-2-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-2-05 finished in 883 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)||G(p1)||F(p2))))], workingDir=/home/mcc/execution]
Support contains 12 out of 44 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2021-05-13 04:47:52] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 04:47:52] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-13 04:47:52] [INFO ] Implicit Places using invariants in 31 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
[2021-05-13 04:47:52] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 42 cols
[2021-05-13 04:47:52] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-13 04:47:52] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 42/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2021-05-13 04:47:52] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 42 cols
[2021-05-13 04:47:52] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-13 04:47:52] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/44 places, 62/62 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-2-06 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(OR (AND (EQ s6 1) (EQ s16 1)) (AND (EQ s6 1) (EQ s17 1)) (AND (EQ s7 1) (EQ s16 1)) (AND (EQ s7 1) (EQ s17 1))), p0:(OR (AND (EQ s10 1) (EQ s23 1)) (AND (EQ s9 1) (EQ s22 1)) (AND (EQ s11 1) (EQ s23 1)) (AND (EQ s8 1) (EQ s22 1))), p1:(OR (EQ s24 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4402 reset in 108 ms.
Stack based approach found an accepted trace after 31 steps with 2 reset with depth 18 and stack size 18 in 0 ms.
FORMULA LamportFastMutEx-PT-2-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-2-06 finished in 376 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(!p1)&&X(F(((F(p3)&&p2)||G(F(p3))))))))], workingDir=/home/mcc/execution]
Support contains 12 out of 44 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2021-05-13 04:47:52] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 04:47:52] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-13 04:47:52] [INFO ] Implicit Places using invariants in 26 ms returned []
[2021-05-13 04:47:52] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 04:47:52] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-13 04:47:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-13 04:47:52] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2021-05-13 04:47:52] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 04:47:52] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-13 04:47:52] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 44/44 places, 62/62 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p3) p1), (OR (NOT p0) (NOT p3) p1), (NOT p0), p1, (NOT p3), (NOT p3)]
Running random walk in product with property : LamportFastMutEx-PT-2-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (NEQ s8 1) (NEQ s28 1) (NEQ s31 1)) (OR (NEQ s10 1) (NEQ s29 1) (NEQ s31 1)) (OR (NEQ s10 1) (NEQ s27 1) (NEQ s30 1)) (OR (NEQ s8 1) (NEQ s26 1) (NEQ s30 1))), p1:(OR (AND (EQ s6 1) (EQ s16 1)) (AND (EQ s6 1) (EQ s17 1)) (AND (EQ s7 1) (EQ s16 1)) (AND (EQ s7 1) (EQ s17 1))), p2:(AND (OR (NEQ s6 1) (NEQ s16 1)) (OR (NEQ s6 1) (NEQ s17 1)) (OR (NEQ s7 1) (NEQ s16 1)) (OR (NEQ s7 1) (NEQ s17 1))), p3:(OR (AND (NEQ s6 0) (NEQ s16 0)) (AND (NEQ s6 0) (NEQ s17 0)) (AND (NEQ s7 0) (NEQ s16 0)) (AND (NEQ s7 0) (NEQ s17 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4413 reset in 111 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA LamportFastMutEx-PT-2-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-2-07 finished in 410 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 44 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 44/44 places, 62/62 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 61
Applied a total of 2 rules in 4 ms. Remains 43 /44 variables (removed 1) and now considering 61/62 (removed 1) transitions.
[2021-05-13 04:47:53] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
// Phase 1: matrix 55 rows 43 cols
[2021-05-13 04:47:53] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-13 04:47:53] [INFO ] Implicit Places using invariants in 34 ms returned [29, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
[2021-05-13 04:47:53] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 04:47:53] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
// Phase 1: matrix 55 rows 41 cols
[2021-05-13 04:47:53] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-13 04:47:53] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 41/44 places, 61/62 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 41 transition count 59
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 59
Applied a total of 4 rules in 4 ms. Remains 39 /41 variables (removed 2) and now considering 59/61 (removed 2) transitions.
[2021-05-13 04:47:53] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
// Phase 1: matrix 53 rows 39 cols
[2021-05-13 04:47:53] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-13 04:47:53] [INFO ] Implicit Places using invariants in 38 ms returned []
[2021-05-13 04:47:53] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
// Phase 1: matrix 53 rows 39 cols
[2021-05-13 04:47:53] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-13 04:47:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-13 04:47:53] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 39/44 places, 59/62 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-2-08 automaton TGBA [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:(EQ s24 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 2533 reset in 92 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 0 ms.
FORMULA LamportFastMutEx-PT-2-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-2-08 finished in 325 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 44/44 places, 62/62 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 60
Applied a total of 4 rules in 4 ms. Remains 42 /44 variables (removed 2) and now considering 60/62 (removed 2) transitions.
[2021-05-13 04:47:53] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
// Phase 1: matrix 54 rows 42 cols
[2021-05-13 04:47:53] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-13 04:47:53] [INFO ] Implicit Places using invariants in 33 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
[2021-05-13 04:47:53] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 04:47:53] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
// Phase 1: matrix 54 rows 40 cols
[2021-05-13 04:47:53] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-13 04:47:53] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 40/44 places, 60/62 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 40 transition count 58
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 58
Applied a total of 4 rules in 4 ms. Remains 38 /40 variables (removed 2) and now considering 58/60 (removed 2) transitions.
[2021-05-13 04:47:53] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 38 cols
[2021-05-13 04:47:53] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-13 04:47:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2021-05-13 04:47:53] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 38 cols
[2021-05-13 04:47:53] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-13 04:47:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-13 04:47:53] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 38/44 places, 58/62 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-2-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 0 ms.
FORMULA LamportFastMutEx-PT-2-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-2-09 finished in 309 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620881274758
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="LamportFastMutEx-PT-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-2, 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 r121-tall-162075407200645"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-2.tgz
mv LamportFastMutEx-PT-2 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 ;