About the Execution of ITS-Tools for TwoPhaseLocking-PT-nC02000vD
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4790.027 | 3600000.00 | 4185826.00 | 8253.00 | F?FFTFFFFFFTFFFF | normal |
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-165303546200844.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-nC02000vD, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303546200844
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 6.5K Apr 30 10:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 30 10:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 10:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 10:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 9 09:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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-nC02000vD-LTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC02000vD-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653194267742
Running Version 202205111006
[2022-05-22 04:37:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-22 04:37:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 04:37:48] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2022-05-22 04:37:48] [INFO ] Transformed 8 places.
[2022-05-22 04:37:49] [INFO ] Transformed 6 transitions.
[2022-05-22 04:37:49] [INFO ] Parsed PT model containing 8 places and 6 transitions in 137 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-04 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:37:49] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-22 04:37:49] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:37:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:37:49] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:37:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:37:49] [INFO ] Dead Transitions using invariants and state equation in 35 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:37:49] [INFO ] Flatten gal took : 12 ms
[2022-05-22 04:37:49] [INFO ] Flatten gal took : 2 ms
[2022-05-22 04:37:49] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=455 ) properties (out of 6) seen :4
Finished Best-First random walk after 64 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=21 )
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(G((p0 U (F((F(p1)||G(p1))) U p2)))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 4 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:37:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:37:49] [INFO ] Implicit Places using invariants in 22 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 341 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vD-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LT s5 1), p1:(AND (GEQ s3 1) (GEQ s4 1)), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 11573 reset in 230 ms.
Stack based approach found an accepted trace after 1282 steps with 150 reset with depth 15 and stack size 15 in 3 ms.
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vD-LTLFireability-00 finished in 674 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((!p0||F(p1)))) U 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:37:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:37:50] [INFO ] Implicit Places using invariants in 23 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vD-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1)), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2157 reset in 119 ms.
Product exploration explored 100000 steps with 1980 reset in 178 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 p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 3003 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=500 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 04:37:51] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 04:37:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 04:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:37:51] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-22 04:37:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 04:37:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 04:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 04:37:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-22 04:37:52] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 04:37:52] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 04:37:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 04:37:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 04:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:37:52] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-22 04:37:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 04:37:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-22 04:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 04:37:52] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 04:37:52] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 04:37:52] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 04:37:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 04:37:52] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 04:37:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 04:37:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 04:37:52] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-22 04:37:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/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 (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 296 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 3003 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=1001 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 295 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 04:37:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 04:37:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 04:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:37:53] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 04:37:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 04:37:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-22 04:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 04:37:53] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-22 04:37:53] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-22 04:37:53] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 04:37:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 04:37:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 04:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:37:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-22 04:37:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 04:37:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 04:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 04:37:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 04:37:53] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 04:37:53] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 768 reset in 117 ms.
Product exploration explored 100000 steps with 1949 reset in 90 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 11 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2022-05-22 04:37:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 04:37:54] [INFO ] Computed 2 place invariants in 13 ms
[2022-05-22 04:37:54] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/7 places, 6/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Product exploration explored 100000 steps with 1903 reset in 112 ms.
Product exploration explored 100000 steps with 1651 reset in 148 ms.
Built C files in :
/tmp/ltsmin374408001028891222
[2022-05-22 04:37:54] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin374408001028891222
Running compilation step : cd /tmp/ltsmin374408001028891222;'/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 169 ms.
Running link step : cd /tmp/ltsmin374408001028891222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin374408001028891222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10421714299904539878.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 04:38:09] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 04:38:09] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 04:38:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 04:38:09] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 04:38:09] [INFO ] Computed 2 place invariants in 7 ms
[2022-05-22 04:38:09] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin16546701329521856539
[2022-05-22 04:38:09] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16546701329521856539
Running compilation step : cd /tmp/ltsmin16546701329521856539;'/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 76 ms.
Running link step : cd /tmp/ltsmin16546701329521856539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16546701329521856539;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1394801853577821743.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 04:38:24] [INFO ] Flatten gal took : 1 ms
[2022-05-22 04:38:24] [INFO ] Flatten gal took : 1 ms
[2022-05-22 04:38:24] [INFO ] Time to serialize gal into /tmp/LTL3919068055153188240.gal : 1 ms
[2022-05-22 04:38:24] [INFO ] Time to serialize properties into /tmp/LTL646803957566462292.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3919068055153188240.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL646803957566462292.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3919068...265
Read 1 LTL properties
Checking formula 0 : !((X((F(G((!("((resA>=1)&&(haveB>=1))"))||(F("(haveAandB>=1)")))))U("((resA>=1)&&(haveB>=1))"))))
Formula 0 simplified : !X(FG(!"((resA>=1)&&(haveB>=1))" | F"(haveAandB>=1)") U "((resA>=1)&&(haveB>=1))")
Detected timeout of ITS tools.
[2022-05-22 04:38:39] [INFO ] Flatten gal took : 1 ms
[2022-05-22 04:38:39] [INFO ] Applying decomposition
[2022-05-22 04:38:39] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11362671259697321289.txt' '-o' '/tmp/graph11362671259697321289.bin' '-w' '/tmp/graph11362671259697321289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11362671259697321289.bin' '-l' '-1' '-v' '-w' '/tmp/graph11362671259697321289.weights' '-q' '0' '-e' '0.001'
[2022-05-22 04:38:39] [INFO ] Decomposing Gal with order
[2022-05-22 04:38:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 04:38:40] [INFO ] Flatten gal took : 49 ms
[2022-05-22 04:38:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 04:38:40] [INFO ] Time to serialize gal into /tmp/LTL8382384886785530432.gal : 1 ms
[2022-05-22 04:38:40] [INFO ] Time to serialize properties into /tmp/LTL761469315965843494.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8382384886785530432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL761469315965843494.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8382384...244
Read 1 LTL properties
Checking formula 0 : !((X((F(G((!("((u0.resA>=1)&&(i1.u2.haveB>=1))"))||(F("(i1.u1.haveAandB>=1)")))))U("((u0.resA>=1)&&(i1.u2.haveB>=1))"))))
Formula 0 simplified : !X(FG(!"((u0.resA>=1)&&(i1.u2.haveB>=1))" | F"(i1.u1.haveAandB>=1)") U "((u0.resA>=1)&&(i1.u2.haveB>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18244603987441970254
[2022-05-22 04:38:55] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18244603987441970254
Running compilation step : cd /tmp/ltsmin18244603987441970254;'/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 60 ms.
Running link step : cd /tmp/ltsmin18244603987441970254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18244603987441970254;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((!(LTLAPp0==true)||<>((LTLAPp1==true))))) U (LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC02000vD-LTLFireability-01 finished in 79741 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(p0))) U p1))'
Support contains 2 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:39:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:39:10] [INFO ] Implicit Places using invariants in 26 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vD-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s2 1), p0:(GEQ s5 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vD-LTLFireability-02 finished in 134 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 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:39:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:39:10] [INFO ] Implicit Places using invariants in 26 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vD-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT 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][false, false]]
Product exploration explored 100000 steps with 77 reset in 61 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vD-LTLFireability-03 finished in 157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(X(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 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:39:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:39:10] [INFO ] Implicit Places using invariants in 23 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/8 places, 4/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 5/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vD-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:(GEQ s4 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 12439 reset in 47 ms.
Product exploration explored 100000 steps with 12541 reset in 163 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 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 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1002 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1002 )
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 126 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 48 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 4 rows 5 cols
[2022-05-22 04:39:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 04:39:11] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-22 04:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:39:11] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 04:39:11] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 04:39:11] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 5 cols
[2022-05-22 04:39:11] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-22 04:39:11] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2022-05-22 04:39:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 04:39:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-22 04:39:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2022-05-22 04:39:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 04:39:11] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 102 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 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1002 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 112 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 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 4 rows 5 cols
[2022-05-22 04:39:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 04:39:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 04:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:39:11] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 04:39:11] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 04:39:11] [INFO ] Added : 0 causal constraints over 0 iterations in 9 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 12114 reset in 45 ms.
Product exploration explored 100000 steps with 11149 reset in 104 ms.
Built C files in :
/tmp/ltsmin9672123151432681801
[2022-05-22 04:39:11] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-22 04:39:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:39:11] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-22 04:39:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:39:11] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-22 04:39:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:39:12] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9672123151432681801
Running compilation step : cd /tmp/ltsmin9672123151432681801;'/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 65 ms.
Running link step : cd /tmp/ltsmin9672123151432681801;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin9672123151432681801;'/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/stateBased3346988122051049388.hoa' '--buchi-type=spotba'
LTSmin run took 1631 ms.
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC02000vD-LTLFireability-05 finished in 3283 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 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 3 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:39:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:39:13] [INFO ] Implicit Places using invariants in 19 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/8 places, 4/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 5/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vD-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 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 58 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vD-LTLFireability-06 finished in 128 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(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:39:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:39:13] [INFO ] Implicit Places using invariants in 25 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vD-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s0 1) (LT s1 1)), p0:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vD-LTLFireability-07 finished in 165 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((!G(p0) U X(p1))))))'
Support contains 2 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:39:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:39:14] [INFO ] Implicit Places using invariants in 20 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vD-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s2 1), p1:(LT s5 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 13996 reset in 71 ms.
Stack based approach found an accepted trace after 28 steps with 4 reset with depth 14 and stack size 14 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vD-LTLFireability-09 finished in 272 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
Applied a total of 2 rules in 1 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:39:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:39:14] [INFO ] Implicit Places using invariants in 23 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 5/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vD-LTLFireability-10 automaton TGBA Formula[mat=[[{ 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, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10241 reset in 65 ms.
Product exploration explored 100000 steps with 10283 reset in 81 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 83 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)]
Finished random walk after 6008 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1502 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 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 25 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 04:39:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 04:39:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-22 04:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:39:14] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 04:39:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 04:39:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 04:39:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 04:39:14] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 04:39:14] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 04:39:14] [INFO ] Added : 2 causal constraints over 1 iterations in 3 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, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 04:39:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 04:39:14] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 04:39:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 04:39:14] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-22 04:39:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 04:39:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 04:39:14] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 24 ms :[(NOT p0)]
Finished random walk after 3004 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1001 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 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 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 04:39:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 04:39:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 04:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 04:39:15] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-22 04:39:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 04:39:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 04:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 04:39:15] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 04:39:15] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 04:39:15] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10238 reset in 59 ms.
Product exploration explored 100000 steps with 10246 reset in 52 ms.
Built C files in :
/tmp/ltsmin7434325892192475365
[2022-05-22 04:39:15] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-22 04:39:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:39:15] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-22 04:39:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:39:15] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-22 04:39:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:39:15] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7434325892192475365
Running compilation step : cd /tmp/ltsmin7434325892192475365;'/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 59 ms.
Running link step : cd /tmp/ltsmin7434325892192475365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin7434325892192475365;'/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/stateBased6198557626442487663.hoa' '--buchi-type=spotba'
LTSmin run took 7819 ms.
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC02000vD-LTLFireability-10 finished in 9034 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G(!(F(p0)||p0)) U (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:39:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:39:23] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:39:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:39:23] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 04:39:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:39:23] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p2), (NOT p0), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, p0, (NOT p2), (NOT p2)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vD-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s1 1)), p1:(GEQ s6 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, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Product exploration explored 100000 steps with 50000 reset in 80 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) (NOT p1) p0), (X p2), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0))))]
Property proved to be true thanks to knowledge :(X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))
Knowledge based reduction with 17 factoid took 489 ms. Reduced automaton from 9 states, 20 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC02000vD-LTLFireability-11 finished in 1071 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 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:39:24] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 04:39:24] [INFO ] Implicit Places using invariants in 30 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vD-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (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][false, false, false]]
Entered a terminal (fully accepting) state of product in 57 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vD-LTLFireability-13 finished in 121 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
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 3 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:39:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 04:39:24] [INFO ] Implicit Places using invariants in 25 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/8 places, 4/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 5/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vD-LTLFireability-14 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 s4 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 42 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 7 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC02000vD-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vD-LTLFireability-14 finished in 124 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((!p0||F(p1)))) U p0)))'
[2022-05-22 04:39:24] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16928643947646887211
[2022-05-22 04:39:24] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-22 04:39:24] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:39:24] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-22 04:39:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:39:24] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-22 04:39:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 04:39:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16928643947646887211
[2022-05-22 04:39:24] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin16928643947646887211;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-22 04:39:24] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8340052009901753891.txt' '-o' '/tmp/graph8340052009901753891.bin' '-w' '/tmp/graph8340052009901753891.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8340052009901753891.bin' '-l' '-1' '-v' '-w' '/tmp/graph8340052009901753891.weights' '-q' '0' '-e' '0.001'
[2022-05-22 04:39:24] [INFO ] Decomposing Gal with order
[2022-05-22 04:39:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 04:39:24] [INFO ] Flatten gal took : 2 ms
[2022-05-22 04:39:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 04:39:24] [INFO ] Time to serialize gal into /tmp/LTLFireability6521056414667112961.gal : 1 ms
[2022-05-22 04:39:24] [INFO ] Time to serialize properties into /tmp/LTLFireability5474691671314074143.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6521056414667112961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5474691671314074143.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((X((F(G((!("((u0.resA>=1)&&(u1.haveB>=1))"))||(F("(u1.haveAandB>=1)")))))U("((u0.resA>=1)&&(u1.haveB>=1))"))))
Formula 0 simplified : !X(FG(!"((u0.resA>=1)&&(u1.haveB>=1))" | F"(u1.haveAandB>=1)") U "((u0.resA>=1)&&(u1.haveB>=1))")
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin16928643947646887211;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin16928643947646887211;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((!(LTLAPp0==true)||<>((LTLAPp1==true))))) U (LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: LTL layer: formula: X((<>([]((!(LTLAPp0==true)||<>((LTLAPp1==true))))) U (LTLAPp0==true)))
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: "X((<>([]((!(LTLAPp0==true)||<>((LTLAPp1==true))))) U (LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: There are 9 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.020: State length is 9, there are 15 groups
pins2lts-mc-linux64( 0/ 8), 0.020: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.020: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.020: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.020: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.040: [Blue] ~120 levels ~960 states ~3440 transitions
pins2lts-mc-linux64( 0/ 8), 0.056: [Blue] ~240 levels ~1920 states ~6440 transitions
pins2lts-mc-linux64( 3/ 8), 0.070: [Blue] ~245 levels ~3840 states ~3920 transitions
pins2lts-mc-linux64( 3/ 8), 0.091: [Blue] ~485 levels ~7680 states ~7776 transitions
pins2lts-mc-linux64( 3/ 8), 0.142: [Blue] ~887 levels ~15360 states ~16080 transitions
pins2lts-mc-linux64( 3/ 8), 0.192: [Blue] ~887 levels ~30720 states ~39144 transitions
pins2lts-mc-linux64( 6/ 8), 0.353: [Blue] ~1141 levels ~61440 states ~97272 transitions
pins2lts-mc-linux64( 2/ 8), 0.603: [Blue] ~1155 levels ~122880 states ~258848 transitions
pins2lts-mc-linux64( 3/ 8), 0.932: [Blue] ~1147 levels ~245760 states ~479456 transitions
pins2lts-mc-linux64( 3/ 8), 1.387: [Blue] ~1147 levels ~491520 states ~1033344 transitions
pins2lts-mc-linux64( 3/ 8), 1.946: [Blue] ~1147 levels ~983040 states ~2167800 transitions
pins2lts-mc-linux64( 3/ 8), 2.615: [Blue] ~1147 levels ~1966080 states ~4254272 transitions
pins2lts-mc-linux64( 7/ 8), 3.983: [Blue] ~8085 levels ~3932160 states ~9074304 transitions
pins2lts-mc-linux64( 7/ 8), 6.349: [Blue] ~8095 levels ~7864320 states ~18555488 transitions
pins2lts-mc-linux64( 7/ 8), 11.187: [Blue] ~8423 levels ~15728640 states ~38418008 transitions
pins2lts-mc-linux64( 6/ 8), 21.020: [Blue] ~33272 levels ~31457280 states ~66204936 transitions
pins2lts-mc-linux64( 6/ 8), 40.536: [Blue] ~33272 levels ~62914560 states ~129089128 transitions
pins2lts-mc-linux64( 6/ 8), 81.044: [Blue] ~33272 levels ~125829120 states ~254850368 transitions
pins2lts-mc-linux64( 3/ 8), 127.960: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 127.991:
pins2lts-mc-linux64( 0/ 8), 127.991: Explored 133910336 states 435687928 transitions, fanout: 3.254
pins2lts-mc-linux64( 0/ 8), 127.991: Total exploration time 127.940 sec (127.920 sec minimum, 127.934 sec on average)
pins2lts-mc-linux64( 0/ 8), 127.991: States per second: 1046665, Transitions per second: 3405408
pins2lts-mc-linux64( 0/ 8), 127.991:
pins2lts-mc-linux64( 0/ 8), 127.991: State space has 134217205 states, 40409383 are accepting
pins2lts-mc-linux64( 0/ 8), 127.991: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 127.991: blue states: 133910336 (99.77%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 127.991: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 127.991: all-red states: 54362372 (40.50%), bogus 2933032 (2.19%)
pins2lts-mc-linux64( 0/ 8), 127.991:
pins2lts-mc-linux64( 0/ 8), 127.991: Total memory used for local state coloring: 501.8MB
pins2lts-mc-linux64( 0/ 8), 127.991:
pins2lts-mc-linux64( 0/ 8), 127.991: Queue width: 8B, total height: 32886278, memory: 250.90MB
pins2lts-mc-linux64( 0/ 8), 127.991: Tree memory: 1137.5MB, 8.9 B/state, compr.: 23.4%
pins2lts-mc-linux64( 0/ 8), 127.991: Tree fill ratio (roots/leafs): 99.0%/44.0%
pins2lts-mc-linux64( 0/ 8), 127.991: Stored 8 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 127.991: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 127.992: Est. total memory use: 1388.4MB (~1274.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16928643947646887211;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((!(LTLAPp0==true)||<>((LTLAPp1==true))))) U (LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16928643947646887211;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((!(LTLAPp0==true)||<>((LTLAPp1==true))))) U (LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-22 04:59:55] [INFO ] Flatten gal took : 3 ms
[2022-05-22 04:59:55] [INFO ] Time to serialize gal into /tmp/LTLFireability911434593434659644.gal : 0 ms
[2022-05-22 04:59:55] [INFO ] Time to serialize properties into /tmp/LTLFireability14513542528522215033.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability911434593434659644.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14513542528522215033.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((X((F(G((!("((resA>=1)&&(haveB>=1))"))||(F("(haveAandB>=1)")))))U("((resA>=1)&&(haveB>=1))"))))
Formula 0 simplified : !X(FG(!"((resA>=1)&&(haveB>=1))" | F"(haveAandB>=1)") U "((resA>=1)&&(haveB>=1))")
Detected timeout of ITS tools.
[2022-05-22 05:20:27] [INFO ] Flatten gal took : 3 ms
[2022-05-22 05:20:27] [INFO ] Input system was already deterministic with 6 transitions.
[2022-05-22 05:20:27] [INFO ] Transformed 8 places.
[2022-05-22 05:20:27] [INFO ] Transformed 6 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-22 05:20:27] [INFO ] Time to serialize gal into /tmp/LTLFireability4744509793311668548.gal : 1 ms
[2022-05-22 05:20:27] [INFO ] Time to serialize properties into /tmp/LTLFireability9212316293940967050.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4744509793311668548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9212316293940967050.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F(G((!("((resA>=1)&&(haveB>=1))"))||(F("(haveAandB>=1)")))))U("((resA>=1)&&(haveB>=1))"))))
Formula 0 simplified : !X(FG(!"((resA>=1)&&(haveB>=1))" | F"(haveAandB>=1)") U "((resA>=1)&&(haveB>=1))")
BK_TIME_CONFINEMENT_REACHED
--------------------
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-nC02000vD"
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-nC02000vD, 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-165303546200844"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC02000vD.tgz
mv TwoPhaseLocking-PT-nC02000vD execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;