Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772200564.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DatabaseWithMutex-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772200564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 16K Apr 30 05:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 05:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 30 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Apr 30 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K May 9 07:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 9 07:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 9 07:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 9 07:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K May 9 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 61K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652622210062

Running Version 202205111006
[2022-05-15 13:43:31] [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]
[2022-05-15 13:43:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 13:43:31] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2022-05-15 13:43:31] [INFO ] Transformed 140 places.
[2022-05-15 13:43:31] [INFO ] Transformed 128 transitions.
[2022-05-15 13:43:31] [INFO ] Parsed PT model containing 140 places and 128 transitions in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
[2022-05-15 13:43:31] [INFO ] Reduced 12 identical enabling conditions.
[2022-05-15 13:43:31] [INFO ] Reduced 12 identical enabling conditions.
[2022-05-15 13:43:31] [INFO ] Reduced 12 identical enabling conditions.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 108 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 10 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 13:43:31] [INFO ] Computed 28 place invariants in 13 ms
[2022-05-15 13:43:31] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 13:43:31] [INFO ] Computed 28 place invariants in 5 ms
[2022-05-15 13:43:31] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 13:43:31] [INFO ] Computed 28 place invariants in 3 ms
[2022-05-15 13:43:32] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 128/128 transitions.
Support contains 108 out of 140 places after structural reductions.
[2022-05-15 13:43:32] [INFO ] Flatten gal took : 31 ms
[2022-05-15 13:43:32] [INFO ] Flatten gal took : 14 ms
[2022-05-15 13:43:32] [INFO ] Input system was already deterministic with 128 transitions.
Finished random walk after 597 steps, including 0 resets, run visited all 21 properties in 61 ms. (steps per millisecond=9 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(X(F(X(F(!p0))))) U p1)))'
Support contains 20 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 13:43:32] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:43:32] [INFO ] Implicit Places using invariants in 81 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 84 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 287 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 2}, { cond=p1, acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s57 1) (GEQ s49 1) (GEQ s66 1) (GEQ s51 1)), p0:(OR (GEQ s89 1) (GEQ s117 1) (GEQ s8 1) (GEQ s91 1) (GEQ s38 1) (GEQ s69 1) (GEQ s68 1) (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 384 ms.
Stack based approach found an accepted trace after 369 steps with 0 reset with depth 370 and stack size 370 in 3 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-00 finished in 829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||p1)))'
Support contains 20 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 8 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 13:43:33] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:43:33] [INFO ] Implicit Places using invariants in 73 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 74 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 1129 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (LT s57 1) (LT s49 1) (LT s66 1) (LT s51 1)), p0:(AND (LT s89 1) (LT s117 1) (LT s8 1) (LT s91 1) (LT s38 1) (LT s69 1) (LT s68 1) (LT s13 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-01 finished in 1236 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 36 rules applied. Total rules applied 52 place count 120 transition count 96
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 68 place count 104 transition count 96
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 68 place count 104 transition count 80
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Applied a total of 100 rules in 21 ms. Remains 88 /140 variables (removed 52) and now considering 80/128 (removed 48) transitions.
// Phase 1: matrix 80 rows 88 cols
[2022-05-15 13:43:34] [INFO ] Computed 24 place invariants in 3 ms
[2022-05-15 13:43:34] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 80 rows 88 cols
[2022-05-15 13:43:34] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-15 13:43:34] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-05-15 13:43:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 88 cols
[2022-05-15 13:43:34] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-15 13:43:34] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/140 places, 80/128 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/140 places, 80/128 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s5 1) (LT s6 1) (LT s23 1) (LT s51 1)) (OR (LT s5 1) (LT s22 1) (LT s51 1) (LT s63 1)) (OR (LT s29 1) (LT s42 1) (LT s56 1) (LT s70 1)) (O...], 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 341 ms.
Stack based approach found an accepted trace after 125 steps with 0 reset with depth 126 and stack size 126 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-02 finished in 585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&p0)))'
Support contains 16 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 13:43:35] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:43:35] [INFO ] Implicit Places using invariants in 68 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 69 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (GEQ s1 1) (GEQ s119 1) (GEQ s88 1) (GEQ s61 1) (GEQ s7 1) (GEQ s93 1) (GEQ s62 1) (GEQ s36 1) (GEQ s39 1) (GEQ s71 1) (GEQ s76 1) (GEQ s46 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-03 finished in 198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U G((F(!p3)||p2))))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 13:43:35] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:43:35] [INFO ] Implicit Places using invariants in 70 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 71 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p2) p3), (AND p1 (NOT p0) (NOT p2) p3), (AND (NOT p0) p3), (AND (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p0) p3 p1 (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p3 p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p3 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p3 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p3 p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 p3 p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s115 1) (GEQ s0 1) (GEQ s85 1) (GEQ s114 1) (GEQ s31 1) (GEQ s60 1) (GEQ s35 1) (GEQ s92 1) (GEQ s14 1) (GEQ s72 1) (GEQ s78 1) (GEQ s47 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 31637 reset in 567 ms.
Product exploration explored 100000 steps with 31721 reset in 568 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) p3 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 p3 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p2 p3 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 972 ms. Reduced automaton from 6 states, 17 edges and 4 AP to 6 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p2) p3), (AND p1 (NOT p0) (NOT p2) p3), (AND (NOT p0) p3), (AND (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p0) p3 p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 13:43:38] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-15 13:43:38] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) p3 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 p3 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p2 p3 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (G (NOT (AND p1 (NOT p2) p3 (NOT p0)))), (G (NOT (AND (NOT p1) p2 p3 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p3)), (F (AND (NOT p1) p3 (NOT p0))), (F (AND p2 p3)), (F (AND p1 (NOT p0))), (F (AND (NOT p2) p3)), (F (AND p3 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) (NOT p2) p3)), (F (AND (NOT p1) (NOT p2) p3 (NOT p0))), (F (AND p1 p2 p3 (NOT p0)))]
Knowledge based reduction with 24 factoid took 1964 ms. Reduced automaton from 6 states, 17 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p2) p3), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p2) p3), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3)]
Support contains 52 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 13:43:41] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 13:43:41] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 13:43:41] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 13:43:41] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2022-05-15 13:43:41] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 13:43:41] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 13:43:41] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p0) (NOT p2) p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 936 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p2) p3), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3)]
Finished random walk after 95 steps, including 0 resets, run visited all 6 properties in 8 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p0) (NOT p2) p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : [(F (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p1) p3))), (F (AND (NOT p0) p3)), (F (AND p2 p3)), (F (AND (NOT p2) (NOT p0) p3)), (F (AND (NOT p2) p3)), (F (AND (NOT p2) (NOT p1) p3))]
Knowledge based reduction with 13 factoid took 642 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p2) p3), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p2) p3), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p2) p3), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3)]
Product exploration explored 100000 steps with 4863 reset in 503 ms.
Product exploration explored 100000 steps with 4934 reset in 505 ms.
Built C files in :
/tmp/ltsmin16927269938899042300
[2022-05-15 13:43:45] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2022-05-15 13:43:45] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:43:45] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2022-05-15 13:43:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:43:45] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2022-05-15 13:43:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 13:43:45] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16927269938899042300
Running compilation step : cd /tmp/ltsmin16927269938899042300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 371 ms.
Running link step : cd /tmp/ltsmin16927269938899042300;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16927269938899042300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9111891478958343480.hoa' '--buchi-type=spotba'
LTSmin run took 155 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-06 finished in 10537 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(X(X(p0)))))||G(p1)))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 13:43:46] [INFO ] Computed 28 place invariants in 5 ms
[2022-05-15 13:43:46] [INFO ] Implicit Places using invariants in 89 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 90 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 337 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 5}], [{ cond=(NOT p1), acceptance={} source=8 dest: 9}, { cond=p1, acceptance={} source=8 dest: 10}], [{ cond=true, acceptance={} source=9 dest: 6}], [{ cond=(NOT p1), acceptance={} source=10 dest: 6}, { cond=p1, acceptance={} source=10 dest: 7}]], initial=8, aps=[p0:(LT s114 1), p1:(GEQ s1 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-08 finished in 452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U p1))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 140 transition count 98
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 48 rules applied. Total rules applied 78 place count 108 transition count 82
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 94 place count 92 transition count 82
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 94 place count 92 transition count 59
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 140 place count 69 transition count 59
Applied a total of 140 rules in 14 ms. Remains 69 /140 variables (removed 71) and now considering 59/128 (removed 69) transitions.
// Phase 1: matrix 59 rows 69 cols
[2022-05-15 13:43:46] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-15 13:43:46] [INFO ] Implicit Places using invariants in 189 ms returned [0, 3, 5, 6, 10, 11, 13, 14, 17, 18, 22, 25, 31, 34, 39, 40, 42, 43, 45, 47, 54, 60, 61, 67]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 205 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/140 places, 59/128 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 41 transition count 55
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 41 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 40 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 40 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 40 transition count 47
Applied a total of 14 rules in 6 ms. Remains 40 /45 variables (removed 5) and now considering 47/59 (removed 12) transitions.
// Phase 1: matrix 47 rows 40 cols
[2022-05-15 13:43:46] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 13:43:46] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 47 rows 40 cols
[2022-05-15 13:43:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 13:43:46] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/140 places, 47/128 transitions.
Finished structural reductions, in 2 iterations. Remains : 40/140 places, 47/128 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s22 1) (LT s18 1)), p0:(OR (AND (GEQ s12 1) (GEQ s18 1)) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 211 steps with 8 reset in 2 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-10 finished in 448 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((p0 U p1)))&&!(F(p2) U X(p0))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 13:43:46] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:43:47] [INFO ] Implicit Places using invariants in 64 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 71 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p1) p0), p0, p0, (NOT p1), (NOT p1), (AND p2 p0), true, (AND p2 p0), (AND p2 (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 8}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s88 1) (GEQ s77 1)), p1:(LT s72 1), p0:(GEQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 3292 reset in 189 ms.
Product exploration explored 100000 steps with 3269 reset in 189 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X p1), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 517 ms. Reduced automaton from 9 states, 21 edges and 3 AP to 9 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p1) (AND p0 p2)), p0, p0, (NOT p1), (NOT p1), (AND p2 p0), true, (AND p0 p2), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 13:43:48] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 13:43:48] [INFO ] After 33ms 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 (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X p1), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (G (NOT (AND p2 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (AND p2 p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0), (F (NOT p1)), (F p2)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 873 ms. Reduced automaton from 9 states, 18 edges and 3 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) p2), (NOT p1), (NOT p1), p2, true]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) p2), (NOT p1), (NOT p1), p2, true]
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 13:43:49] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-15 13:43:50] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 13:43:50] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 13:43:50] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 124 cols
[2022-05-15 13:43:50] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 13:43:50] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 128/128 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 p1 (NOT p2)), (X (NOT p2)), (X p1), true, (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 209 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) p2), (NOT p1), (NOT p1), p2, true]
Finished random walk after 1435 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=205 )
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X p1), true, (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p2)]
Knowledge based reduction with 6 factoid took 266 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) p2), (NOT p1), (NOT p1), p2, true]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) p2), (NOT p1), (NOT p1), p2, true]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) p2), (NOT p1), (NOT p1), p2, true]
Entered a terminal (fully accepting) state of product in 1062 steps with 0 reset in 5 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-11 finished in 4482 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(X(p0))) U G(!(G(p1)&&X(p2))))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 140 transition count 104
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 50 rules applied. Total rules applied 74 place count 113 transition count 81
Reduce places removed 23 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 28 rules applied. Total rules applied 102 place count 90 transition count 76
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 107 place count 85 transition count 76
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 107 place count 85 transition count 57
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 145 place count 66 transition count 57
Applied a total of 145 rules in 10 ms. Remains 66 /140 variables (removed 74) and now considering 57/128 (removed 71) transitions.
// Phase 1: matrix 57 rows 66 cols
[2022-05-15 13:43:51] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-15 13:43:51] [INFO ] Implicit Places using invariants in 129 ms returned [2, 6, 7, 8, 11, 13, 14, 15, 17, 18, 19, 22, 23, 30, 38, 39, 41, 43, 45, 46, 47, 53, 56, 57, 59, 60, 64]
[2022-05-15 13:43:51] [INFO ] Actually due to overlaps returned [8, 13, 15, 17, 38, 41, 43, 47, 56, 57, 60, 2, 6, 11, 14, 19, 22, 23, 30, 39, 46, 53, 59, 64]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 132 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/140 places, 57/128 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 40 transition count 55
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 37 transition count 52
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 37 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 36 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 36 transition count 51
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 2 with 4 rules applied. Total rules applied 16 place count 34 transition count 49
Applied a total of 16 rules in 5 ms. Remains 34 /42 variables (removed 8) and now considering 49/57 (removed 8) transitions.
// Phase 1: matrix 49 rows 34 cols
[2022-05-15 13:43:51] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 13:43:51] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 49 rows 34 cols
[2022-05-15 13:43:51] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 13:43:51] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/140 places, 49/128 transitions.
Finished structural reductions, in 2 iterations. Remains : 34/140 places, 49/128 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND p2 p1), (AND p2 p1)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s16 1) (GEQ s29 1)), p1:(OR (GEQ s27 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 367 reset in 149 ms.
Stack based approach found an accepted trace after 6882 steps with 22 reset with depth 11 and stack size 11 in 12 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-14 finished in 469 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||F(p1))) U X(X(p2))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2022-05-15 13:43:51] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:43:52] [INFO ] Implicit Places using invariants in 87 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 88 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (NOT p2), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(NOT p2), acceptance={0} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s51 1), p1:(GEQ s113 1), p2:(GEQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1832 reset in 151 ms.
Stack based approach found an accepted trace after 1569 steps with 22 reset with depth 420 and stack size 420 in 3 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-15 finished in 542 ms.
All properties solved by simple procedures.
Total runtime 21212 ms.

BK_STOP 1652622232548

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DatabaseWithMutex-PT-04"
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 DatabaseWithMutex-PT-04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r060-tall-165254772200564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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