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.r258-tall-165303546200836.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 TwoPhaseLocking-PT-nC01000vN, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303546200836
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 7.1K Apr 30 10:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 30 10:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 10:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 10:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 09:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 09:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 09:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 4.6K May 10 09:34 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 TwoPhaseLocking-PT-nC01000vN-LTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC01000vN-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653192270698

Running Version 202205111006
[2022-05-22 04:04: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-22 04:04:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 04:04:32] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2022-05-22 04:04:32] [INFO ] Transformed 8 places.
[2022-05-22 04:04:32] [INFO ] Transformed 6 transitions.
[2022-05-22 04:04:32] [INFO ] Parsed PT model containing 8 places and 6 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 7 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:32] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-22 04:04:32] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:32] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:32] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2022-05-22 04:04:32] [INFO ] Flatten gal took : 13 ms
[2022-05-22 04:04:32] [INFO ] Flatten gal took : 3 ms
[2022-05-22 04:04:32] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 2005 steps, including 0 resets, run visited all 8 properties in 25 ms. (steps per millisecond=80 )
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((p0 U X(G((G((p1 U p2))&&(p1 U !p2))))))'
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:32] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:32] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:32] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-22 04:04:32] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 410 ms :[true, true, true, (NOT p2), p2, (NOT p2), p2]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vN-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 5}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 p2 p1), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s1 1)), p2:(GEQ s2 1), p0:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5209 reset in 248 ms.
Stack based approach found an accepted trace after 40 steps with 1 reset with depth 28 and stack size 28 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vN-LTLFireability-00 finished in 820 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 10 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 04:04:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:33] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 04:04:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:33] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-05-22 04:04:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 04:04:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:33] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vN-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 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 86 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vN-LTLFireability-01 finished in 235 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(((X(p0)&&G(p0)) U G(p0)))))||X(p1))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:33] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:33] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-22 04:04:33] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:33] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 257 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vN-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(AND (GEQ s0 1) (GEQ s1 1)), p0:(GEQ s2 1)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vN-LTLFireability-03 finished in 346 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 5 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 04:04:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:34] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 04:04:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-22 04:04:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 04:04:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:34] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vN-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1) (GEQ s6 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 10767 reset in 81 ms.
Product exploration explored 100000 steps with 12211 reset in 151 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1003 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=501 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 04:04:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 04:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:04:35] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 04:04:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 04:04:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 04:04:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 04:04:35] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-22 04:04:35] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 04:04:35] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 04:04:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:35] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 04:04:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:35] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-22 04:04:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 04:04:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:35] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1003 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=501 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 04:04:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 04:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:04:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-22 04:04:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 04:04:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 04:04:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 04:04:35] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 04:04:35] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 04:04:35] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13192 reset in 93 ms.
Product exploration explored 100000 steps with 10698 reset in 111 ms.
Built C files in :
/tmp/ltsmin6569740053107173376
[2022-05-22 04:04:36] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-22 04:04:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:04:36] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-22 04:04:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:04:36] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-22 04:04:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:04:36] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6569740053107173376
Running compilation step : cd /tmp/ltsmin6569740053107173376;'/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 147 ms.
Running link step : cd /tmp/ltsmin6569740053107173376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6569740053107173376;'/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/stateBased5937340897354727846.hoa' '--buchi-type=spotba'
LTSmin run took 131 ms.
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC01000vN-LTLFireability-05 finished in 2202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
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 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:36] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:36] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-22 04:04:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:36] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vN-LTLFireability-06 automaton TGBA Formula[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}]], initial=0, aps=[p0:(GEQ s5 1), p1:(OR (LT s0 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1419 reset in 62 ms.
Stack based approach found an accepted trace after 52 steps with 4 reset with depth 19 and stack size 19 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vN-LTLFireability-06 finished in 263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 5 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:36] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:36] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-22 04:04:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:36] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vN-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s5 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][true]]
Product exploration explored 100000 steps with 15161 reset in 52 ms.
Product exploration explored 100000 steps with 15101 reset in 54 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 1003 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=501 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-22 04:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:04:37] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 04:04:37] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 04:04:37] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:37] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:37] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-22 04:04:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:37] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1003 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=334 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:37] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 04:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:04:37] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 04:04:37] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-22 04:04:37] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15128 reset in 56 ms.
Product exploration explored 100000 steps with 15081 reset in 56 ms.
Built C files in :
/tmp/ltsmin13343458960046401346
[2022-05-22 04:04:37] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-22 04:04:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:04:37] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-22 04:04:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:04:37] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-22 04:04:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:04:37] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13343458960046401346
Running compilation step : cd /tmp/ltsmin13343458960046401346;'/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 79 ms.
Running link step : cd /tmp/ltsmin13343458960046401346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13343458960046401346;'/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/stateBased12488843512584455714.hoa' '--buchi-type=spotba'
LTSmin run took 185 ms.
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC01000vN-LTLFireability-07 finished in 1560 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||F(p1)))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:38] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:38] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:38] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vN-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s4 1)), p0:(OR (LT s3 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15048 reset in 66 ms.
Product exploration explored 100000 steps with 15151 reset in 63 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)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=250 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 04:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:04:38] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-22 04:04:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 04:04:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 04:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 04:04:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-22 04:04:38] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 04:04:38] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:38] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:39] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-22 04:04:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:39] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 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 p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 215 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=250 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 04:04:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 04:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:04:39] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 04:04:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 04:04:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 04:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 04:04:39] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 04:04:39] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 04:04:39] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25043 reset in 76 ms.
Product exploration explored 100000 steps with 24993 reset in 67 ms.
Built C files in :
/tmp/ltsmin83479624853000095
[2022-05-22 04:04:39] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-22 04:04:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:04:39] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-22 04:04:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:04:39] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-22 04:04:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:04:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin83479624853000095
Running compilation step : cd /tmp/ltsmin83479624853000095;'/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 77 ms.
Running link step : cd /tmp/ltsmin83479624853000095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin83479624853000095;'/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/stateBased11233693993170261691.hoa' '--buchi-type=spotba'
LTSmin run took 122 ms.
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC01000vN-LTLFireability-08 finished in 1747 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p1 U !p1)&&X(!p0))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:40] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:40] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:40] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR p1 p0), p0, p1]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vN-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s1 1)), p0:(LT s2 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 175 reset in 152 ms.
Stack based approach found an accepted trace after 95 steps with 2 reset with depth 23 and stack size 23 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vN-LTLFireability-09 finished in 348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)&&p0)) U p2))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:40] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:40] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:04:40] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), true, (NOT p2), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vN-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s2 1), p2:(AND (GEQ s0 1) (GEQ s1 1)), p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vN-LTLFireability-12 finished in 221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U X((!(F(p1)||X(p2))||G(!p3)))))'
Support contains 6 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:40] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:40] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:40] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 396 ms :[(OR (AND p1 p3) (AND p2 p3)), (OR (AND p1 p3) (AND p2 p3)), true, p1, (AND (NOT p1) p2), p3, (AND p1 p3), (AND p3 (NOT p1) p2), (AND p1 p3), (AND p2 p3)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vN-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p3 p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p3 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=1 dest: 8}, { cond=(AND (NOT p1) p3 p0), acceptance={1} source=1 dest: 8}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=1 dest: 9}, { cond=(AND (NOT p1) p3 p0), acceptance={0, 1} source=1 dest: 9}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 2}], [{ cond=p3, acceptance={} source=5 dest: 2}, { cond=(NOT p3), acceptance={} source=5 dest: 5}], [{ cond=(AND p1 p3), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p3 p2), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=7 dest: 5}], [{ cond=(AND p1 (NOT p3) p0), acceptance={0} source=8 dest: 1}, { cond=(AND p1 p3 p0), acceptance={0, 1} source=8 dest: 1}, { cond=(AND p1 p3 (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p3 p0), acceptance={1} source=8 dest: 8}], [{ cond=(AND p1 (NOT p3) p0 p2), acceptance={0} source=9 dest: 1}, { cond=(AND p1 p3 p0 p2), acceptance={0, 1} source=9 dest: 1}, { cond=(AND p1 p3 (NOT p0) p2), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p1) p3 (NOT p0) p2), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) p3 (NOT p0) p2), acceptance={} source=9 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p0) p2), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) (NOT p3) (NOT p0) p2), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) (NOT p3) (NOT p0) p2), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p0 p2), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p3 p0 p2), acceptance={1} source=9 dest: 8}, { cond=(AND (NOT p1) (NOT p3) p0 p2), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p1) p3 p0 p2), acceptance={0, 1} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s1 1)), p3:(AND (GEQ s3 1) (GEQ s4 1)), p0:(GEQ s2 1), p2:(GEQ s7 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vN-LTLFireability-14 finished in 489 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(F((F(X(G(p0)))&&p1)))&&p2))||!p1)))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:41] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:41] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:04:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:04:41] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (NOT p0), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vN-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s1 1)), p2:(LT s7 1), p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 42 ms.
Product exploration explored 100000 steps with 50000 reset in 53 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p2))))
Knowledge based reduction with 8 factoid took 177 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC01000vN-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC01000vN-LTLFireability-15 finished in 591 ms.
All properties solved by simple procedures.
Total runtime 9782 ms.

BK_STOP 1653192281710

--------------------
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="TwoPhaseLocking-PT-nC01000vN"
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 TwoPhaseLocking-PT-nC01000vN, 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 r258-tall-165303546200836"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC01000vN.tgz
mv TwoPhaseLocking-PT-nC01000vN 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 ;