About the Execution of ITS-Tools for TwoPhaseLocking-PT-nC05000vN
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5947.027 | 3600000.00 | 4712705.00 | 9638.80 | FFTFF?TT?FFFFFFF | 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-165303546300867.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-nC05000vN, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303546300867
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 7.3K Apr 30 10:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 10:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 10:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 10:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 09:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 09:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 09:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:19 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-nC05000vN-LTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653201495233
Running Version 202205111006
[2022-05-22 06:38:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 06:38:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 06:38:16] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2022-05-22 06:38:16] [INFO ] Transformed 8 places.
[2022-05-22 06:38:16] [INFO ] Transformed 6 transitions.
[2022-05-22 06:38:16] [INFO ] Parsed PT model containing 8 places and 6 transitions in 136 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-07 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 8 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 06:38:16] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-22 06:38:16] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:16] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-22 06:38:16] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:16] [INFO ] Computed 3 place invariants in 8 ms
[2022-05-22 06:38:16] [INFO ] Dead Transitions using invariants and state equation in 36 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 06:38:16] [INFO ] Flatten gal took : 13 ms
[2022-05-22 06:38:16] [INFO ] Flatten gal took : 2 ms
[2022-05-22 06:38:16] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=417 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:38:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:38:17] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-22 06:38:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 06:38:17] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-22 06:38:17] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-22 06:38:17] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 10000 steps, including 0 resets, run visited all 4 properties in 191 ms. (steps per millisecond=52 )
Parikh walk visited 4 properties in 191 ms.
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' '!(G(F((p0||G(F(p1))))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 7 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 06:38:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:17] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:38:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:17] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-22 06:38:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:38:17] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 06:38:17] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s3), p1:(LEQ s1 s5)], 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 0 reset in 213 ms.
Product exploration explored 100000 steps with 0 reset in 241 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7505 steps, run visited all 1 properties in 34 ms. (steps per millisecond=220 )
Probabilistic random walk after 7505 steps, saw 5005 distinct states, run finished after 34 ms. (steps per millisecond=220 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT 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, 5/5 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:38:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:19] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:38:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:38:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-05-22 06:38:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:38:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:19] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7505 steps, run visited all 1 properties in 25 ms. (steps per millisecond=300 )
Probabilistic random walk after 7505 steps, saw 5005 distinct states, run finished after 25 ms. (steps per millisecond=300 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 91 ms.
Product exploration explored 100000 steps with 0 reset in 182 ms.
Built C files in :
/tmp/ltsmin4137628589669229666
[2022-05-22 06:38:20] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-22 06:38:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:38:20] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-22 06:38:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:38:20] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-22 06:38:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:38:20] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4137628589669229666
Running compilation step : cd /tmp/ltsmin4137628589669229666;'/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 161 ms.
Running link step : cd /tmp/ltsmin4137628589669229666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4137628589669229666;'/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/stateBased14526380607191140638.hoa' '--buchi-type=spotba'
LTSmin run took 1024 ms.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLCardinality-00 finished in 3620 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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
Applied a total of 2 rules in 3 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 06:38:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:38:21] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:38:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:38:21] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-22 06:38:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:38:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:38:21] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s0 s2)], 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 81 ms.
Product exploration explored 100000 steps with 0 reset in 120 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 39336 steps, run visited all 1 properties in 59 ms. (steps per millisecond=666 )
Probabilistic random walk after 39336 steps, saw 27280 distinct states, run finished after 59 ms. (steps per millisecond=666 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:38:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:22] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:38:22] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-22 06:38:22] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2022-05-22 06:38:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:38:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:38:22] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 39336 steps, run visited all 1 properties in 55 ms. (steps per millisecond=715 )
Probabilistic random walk after 39336 steps, saw 27280 distinct states, run finished after 55 ms. (steps per millisecond=715 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 99 ms.
Built C files in :
/tmp/ltsmin8556446232488882166
[2022-05-22 06:38:22] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-22 06:38:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:38:22] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-22 06:38:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:38:22] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-22 06:38:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:38:22] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8556446232488882166
Running compilation step : cd /tmp/ltsmin8556446232488882166;'/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 69 ms.
Running link step : cd /tmp/ltsmin8556446232488882166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8556446232488882166;'/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/stateBased14676067352798498154.hoa' '--buchi-type=spotba'
LTSmin run took 500 ms.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLCardinality-01 finished in 2014 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 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 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 06:38:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:23] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:23] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-05-22 06:38:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:23] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-22 06:38:23] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 s5) (AND (GT s0 s3) (GT s2 s6)))], 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 0 reset in 77 ms.
Product exploration explored 100000 steps with 0 reset in 96 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 198 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 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 103249 steps, run visited all 1 properties in 110 ms. (steps per millisecond=938 )
Probabilistic random walk after 103249 steps, saw 69321 distinct states, run finished after 110 ms. (steps per millisecond=938 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 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)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Support contains 5 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 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 06:38:24] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:24] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:38:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-22 06:38:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:38:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 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 54 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5003 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 103249 steps, run visited all 1 properties in 107 ms. (steps per millisecond=964 )
Probabilistic random walk after 103249 steps, saw 69321 distinct states, run finished after 107 ms. (steps per millisecond=964 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Product exploration explored 100000 steps with 0 reset in 166 ms.
Built C files in :
/tmp/ltsmin4695311788734994436
[2022-05-22 06:38:25] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-22 06:38:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:38:25] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-22 06:38:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:38:25] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-22 06:38:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:38:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4695311788734994436
Running compilation step : cd /tmp/ltsmin4695311788734994436;'/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 67 ms.
Running link step : cd /tmp/ltsmin4695311788734994436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4695311788734994436;'/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/stateBased10212719015270944226.hoa' '--buchi-type=spotba'
LTSmin run took 1184 ms.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLCardinality-03 finished in 3162 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))&&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 06:38:26] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:38:26] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:26] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:38:26] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:26] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:26] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s4 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Product exploration explored 100000 steps with 0 reset in 92 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7505 steps, run visited all 1 properties in 13 ms. (steps per millisecond=577 )
Probabilistic random walk after 7505 steps, saw 5005 distinct states, run finished after 13 ms. (steps per millisecond=577 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT 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 06:38:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:27] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:27] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:27] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2501 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7505 steps, run visited all 1 properties in 11 ms. (steps per millisecond=682 )
Probabilistic random walk after 7505 steps, saw 5005 distinct states, run finished after 11 ms. (steps per millisecond=682 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 96 ms.
Product exploration explored 100000 steps with 0 reset in 81 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0), (NOT 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: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2022-05-22 06:38:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:29] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/8 places, 6/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 0 reset in 56 ms.
Product exploration explored 100000 steps with 0 reset in 69 ms.
Built C files in :
/tmp/ltsmin3538896920094333768
[2022-05-22 06:38:29] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3538896920094333768
Running compilation step : cd /tmp/ltsmin3538896920094333768;'/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 70 ms.
Running link step : cd /tmp/ltsmin3538896920094333768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3538896920094333768;'/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/stateBased6998927485754344275.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 06:38:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:44] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:44] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:38:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:38:44] [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.
Built C files in :
/tmp/ltsmin15033030513967733326
[2022-05-22 06:38:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15033030513967733326
Running compilation step : cd /tmp/ltsmin15033030513967733326;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin15033030513967733326;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15033030513967733326;'/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/stateBased8708784741547383236.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 06:38:59] [INFO ] Flatten gal took : 2 ms
[2022-05-22 06:38:59] [INFO ] Flatten gal took : 2 ms
[2022-05-22 06:38:59] [INFO ] Time to serialize gal into /tmp/LTL18329131443277325198.gal : 1 ms
[2022-05-22 06:38:59] [INFO ] Time to serialize properties into /tmp/LTL12156253361454407273.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/LTL18329131443277325198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12156253361454407273.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/LTL1832913...268
Read 1 LTL properties
Checking formula 0 : !((G((X(X("(haveB<=resA)")))&&(F("(haveB<=resA)")))))
Formula 0 simplified : !G(XX"(haveB<=resA)" & F"(haveB<=resA)")
Detected timeout of ITS tools.
[2022-05-22 06:39:14] [INFO ] Flatten gal took : 2 ms
[2022-05-22 06:39:14] [INFO ] Applying decomposition
[2022-05-22 06:39:14] [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/graph11646579674932334144.txt' '-o' '/tmp/graph11646579674932334144.bin' '-w' '/tmp/graph11646579674932334144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11646579674932334144.bin' '-l' '-1' '-v' '-w' '/tmp/graph11646579674932334144.weights' '-q' '0' '-e' '0.001'
[2022-05-22 06:39:14] [INFO ] Decomposing Gal with order
[2022-05-22 06:39:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 06:39:14] [INFO ] Flatten gal took : 26 ms
[2022-05-22 06:39:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 06:39:14] [INFO ] Time to serialize gal into /tmp/LTL17630604323515741530.gal : 1 ms
[2022-05-22 06:39:14] [INFO ] Time to serialize properties into /tmp/LTL13863888655137165202.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/LTL17630604323515741530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13863888655137165202.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/LTL1763060...268
Read 1 LTL properties
Checking formula 0 : !((G((X(X("(gu1.haveB<=gu1.resA)")))&&(F("(gu1.haveB<=gu1.resA)")))))
Formula 0 simplified : !G(XX"(gu1.haveB<=gu1.resA)" & F"(gu1.haveB<=gu1.resA)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10097655985843356507
[2022-05-22 06:39:29] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10097655985843356507
Running compilation step : cd /tmp/ltsmin10097655985843356507;'/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 71 ms.
Running link step : cd /tmp/ltsmin10097655985843356507;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10097655985843356507;'/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(X((LTLAPp0==true)))&&<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLCardinality-05 finished in 78142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U !p0) U X(F(X(F(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 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 06:39:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:39:44] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:39:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:39:44] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:39:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:39:44] [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 167 ms :[(NOT p1), (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 3 s1), p0:(LEQ 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLCardinality-06 finished in 511 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U F(p0))||F((X(p1)&&p2)))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 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 06:39:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:39:45] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:39:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:39:45] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:39:45] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:39:45] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s7), p2:(GT s4 s2), p1:(LEQ 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10137 reset in 78 ms.
Product exploration explored 100000 steps with 10064 reset in 218 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 p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 282 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 4) seen :0
Finished Best-First random walk after 14 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 9 factoid took 353 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:39:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:39:46] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 06:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:39:46] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 06:39:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 06:39:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:39:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 06:39:46] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-22 06:39:46] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 06:39:46] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:39:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:39:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:39:46] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 06:39:46] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 06:39:46] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in 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 06:39:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:39:46] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:39:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:39:46] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:39:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:39:46] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 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 p2) (NOT p1)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 284 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 4) seen :0
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 9 factoid took 383 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:39:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:39:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:39:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:39:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 06:39:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 06:39:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 06:39:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 06:39:48] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 06:39:48] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 06:39:48] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:39:48] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:39:48] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 06:39:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:39:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 06:39:48] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 06:39:48] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10010 reset in 74 ms.
Product exploration explored 100000 steps with 10001 reset in 78 ms.
Built C files in :
/tmp/ltsmin14809031493185450823
[2022-05-22 06:39:48] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14809031493185450823
Running compilation step : cd /tmp/ltsmin14809031493185450823;'/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 82 ms.
Running link step : cd /tmp/ltsmin14809031493185450823;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14809031493185450823;'/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/stateBased8498890306104584713.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 2 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 06:40:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:40:03] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:40:03] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:40:03] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin2797013267300372056
[2022-05-22 06:40:03] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2797013267300372056
Running compilation step : cd /tmp/ltsmin2797013267300372056;'/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 72 ms.
Running link step : cd /tmp/ltsmin2797013267300372056;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin2797013267300372056;'/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/stateBased5960259101576647769.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 06:40:18] [INFO ] Flatten gal took : 4 ms
[2022-05-22 06:40:18] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:40:18] [INFO ] Time to serialize gal into /tmp/LTL14402620283067427147.gal : 1 ms
[2022-05-22 06:40:18] [INFO ] Time to serialize properties into /tmp/LTL9904171842998137072.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/LTL14402620283067427147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9904171842998137072.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/LTL1440262...267
Read 1 LTL properties
Checking formula 0 : !((G((("(haveA2andB>=1)")U(F("(haveA2andB>=1)")))||(F((X("(haveA2>=3)"))&&("(haveB>haveA2)"))))))
Formula 0 simplified : !G(("(haveA2andB>=1)" U F"(haveA2andB>=1)") | F("(haveB>haveA2)" & X"(haveA2>=3)"))
Detected timeout of ITS tools.
[2022-05-22 06:40:33] [INFO ] Flatten gal took : 3 ms
[2022-05-22 06:40:33] [INFO ] Applying decomposition
[2022-05-22 06:40:33] [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/graph10596569140667946619.txt' '-o' '/tmp/graph10596569140667946619.bin' '-w' '/tmp/graph10596569140667946619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10596569140667946619.bin' '-l' '-1' '-v' '-w' '/tmp/graph10596569140667946619.weights' '-q' '0' '-e' '0.001'
[2022-05-22 06:40:33] [INFO ] Decomposing Gal with order
[2022-05-22 06:40:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 06:40:33] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-22 06:40:33] [INFO ] Flatten gal took : 2 ms
[2022-05-22 06:40:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 06:40:33] [INFO ] Time to serialize gal into /tmp/LTL10153812034878589664.gal : 1 ms
[2022-05-22 06:40:33] [INFO ] Time to serialize properties into /tmp/LTL12573280795298228471.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/LTL10153812034878589664.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12573280795298228471.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/LTL1015381...268
Read 1 LTL properties
Checking formula 0 : !((G((("(gi0.gu3.haveA2andB>=1)")U(F("(gi0.gu3.haveA2andB>=1)")))||(F((X("(gu2.haveA2>=3)"))&&("(gu2.haveB>gu2.haveA2)"))))))
Formula 0 simplified : !G(("(gi0.gu3.haveA2andB>=1)" U F"(gi0.gu3.haveA2andB>=1)") | F("(gu2.haveB>gu2.haveA2)" & X"(gu2.haveA2>=3)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8816694212456753076
[2022-05-22 06:40:48] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8816694212456753076
Running compilation step : cd /tmp/ltsmin8816694212456753076;'/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 67 ms.
Running link step : cd /tmp/ltsmin8816694212456753076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8816694212456753076;'/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' '[]((((LTLAPp0==true) U <>((LTLAPp0==true)))||<>((X((LTLAPp1==true))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLCardinality-08 finished in 78677 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 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 06:41:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:04] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:41:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:04] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-22 06:41:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:41:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:04] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s5)], 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 55 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLCardinality-09 finished in 204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(p0)))&&F(p1)))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 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 06:41:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:04] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:04] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:04] [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 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT 3 s0), p0:(GT s1 s6)], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLCardinality-11 finished in 252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X((!X(p0) U X(p0))) U p1))&&!p0)))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 2 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 06:41:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:41:04] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:41:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:04] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-22 06:41:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:41:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:41:04] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s0 s6), p1:(GT 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLCardinality-15 finished in 325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))&&F(p0))))'
Found a SL insensitive property : TwoPhaseLocking-PT-nC05000vN-LTLCardinality-05
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 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 06:41:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:41:04] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:41:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:04] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:41:05] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-22 06:41:05] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s4 s3)], 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 99 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 53611 steps, run visited all 1 properties in 43 ms. (steps per millisecond=1246 )
Probabilistic random walk after 53611 steps, saw 28166 distinct states, run finished after 43 ms. (steps per millisecond=1246 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:41:05] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:41:05] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:41:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:05] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:41:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:05] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 53611 steps, run visited all 1 properties in 43 ms. (steps per millisecond=1246 )
Probabilistic random walk after 53611 steps, saw 28166 distinct states, run finished after 43 ms. (steps per millisecond=1246 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 64 ms.
Product exploration explored 100000 steps with 0 reset in 81 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2022-05-22 06:41:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:41:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:07] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 transitions.
Product exploration explored 100000 steps with 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Built C files in :
/tmp/ltsmin13024885966366271707
[2022-05-22 06:41:07] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13024885966366271707
Running compilation step : cd /tmp/ltsmin13024885966366271707;'/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 66 ms.
Running link step : cd /tmp/ltsmin13024885966366271707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin13024885966366271707;'/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/stateBased17199876211494872453.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:41:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:41:22] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:41:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:22] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:41:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:22] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 transitions.
Built C files in :
/tmp/ltsmin14388399049030246229
[2022-05-22 06:41:22] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14388399049030246229
Running compilation step : cd /tmp/ltsmin14388399049030246229;'/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 73 ms.
Running link step : cd /tmp/ltsmin14388399049030246229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14388399049030246229;'/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/stateBased5251123835605540448.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 06:41:37] [INFO ] Flatten gal took : 2 ms
[2022-05-22 06:41:37] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:41:37] [INFO ] Time to serialize gal into /tmp/LTL5438847232296591928.gal : 1 ms
[2022-05-22 06:41:37] [INFO ] Time to serialize properties into /tmp/LTL12765543354408985163.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/LTL5438847232296591928.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12765543354408985163.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/LTL5438847...267
Read 1 LTL properties
Checking formula 0 : !((G((X(X("(haveB<=resA)")))&&(F("(haveB<=resA)")))))
Formula 0 simplified : !G(XX"(haveB<=resA)" & F"(haveB<=resA)")
Detected timeout of ITS tools.
[2022-05-22 06:41:52] [INFO ] Flatten gal took : 2 ms
[2022-05-22 06:41:52] [INFO ] Applying decomposition
[2022-05-22 06:41:52] [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/graph7292305163137086081.txt' '-o' '/tmp/graph7292305163137086081.bin' '-w' '/tmp/graph7292305163137086081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7292305163137086081.bin' '-l' '-1' '-v' '-w' '/tmp/graph7292305163137086081.weights' '-q' '0' '-e' '0.001'
[2022-05-22 06:41:52] [INFO ] Decomposing Gal with order
[2022-05-22 06:41:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 06:41:52] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:41:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 06:41:52] [INFO ] Time to serialize gal into /tmp/LTL2255102542762910448.gal : 0 ms
[2022-05-22 06:41:52] [INFO ] Time to serialize properties into /tmp/LTL6344789882178902683.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/LTL2255102542762910448.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6344789882178902683.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/LTL2255102...266
Read 1 LTL properties
Checking formula 0 : !((G((X(X("(gu1.haveB<=gu1.resA)")))&&(F("(gu1.haveB<=gu1.resA)")))))
Formula 0 simplified : !G(XX"(gu1.haveB<=gu1.resA)" & F"(gu1.haveB<=gu1.resA)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8833103653306025507
[2022-05-22 06:42:07] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8833103653306025507
Running compilation step : cd /tmp/ltsmin8833103653306025507;'/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 68 ms.
Running link step : cd /tmp/ltsmin8833103653306025507;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8833103653306025507;'/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(X((LTLAPp0==true)))&&<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLCardinality-05 finished in 77937 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U F(p0))||F((X(p1)&&p2)))))'
Found a CL insensitive property : TwoPhaseLocking-PT-nC05000vN-LTLCardinality-08
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 2 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 06:42:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:22] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:22] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:22] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s6), p2:(GT s4 s2), p1:(LEQ 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13885 reset in 64 ms.
Product exploration explored 100000 steps with 13413 reset in 97 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 p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 5 factoid took 400 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Finished random walk after 2502 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=1251 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 402 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:24] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:42:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:42:24] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 06:42:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 06:42:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 06:42:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 06:42:24] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 06:42:24] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 06:42:24] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:24] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 06:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:42:24] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 06:42:24] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 06:42:24] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:24] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:24] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:24] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 5 factoid took 295 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 89 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Finished random walk after 2502 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=1251 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 448 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:42:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:42:25] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 06:42:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 06:42:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 06:42:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 06:42:25] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 06:42:25] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 06:42:25] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:25] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:42:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:42:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:42:25] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 06:42:25] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 06:42:25] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13842 reset in 72 ms.
Product exploration explored 100000 steps with 13889 reset in 106 ms.
Built C files in :
/tmp/ltsmin13631802165258460481
[2022-05-22 06:42:26] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13631802165258460481
Running compilation step : cd /tmp/ltsmin13631802165258460481;'/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/ltsmin13631802165258460481;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13631802165258460481;'/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/stateBased5402003364192529865.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, 5/5 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:42:41] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:41] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:41] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 transitions.
Built C files in :
/tmp/ltsmin15792992190745261512
[2022-05-22 06:42:41] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15792992190745261512
Running compilation step : cd /tmp/ltsmin15792992190745261512;'/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 74 ms.
Running link step : cd /tmp/ltsmin15792992190745261512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15792992190745261512;'/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/stateBased4353189554789686805.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 06:42:56] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:42:56] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:42:56] [INFO ] Time to serialize gal into /tmp/LTL10047787327136923361.gal : 1 ms
[2022-05-22 06:42:56] [INFO ] Time to serialize properties into /tmp/LTL9409026258858082948.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/LTL10047787327136923361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9409026258858082948.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/LTL1004778...267
Read 1 LTL properties
Checking formula 0 : !((G((("(haveA2andB>=1)")U(F("(haveA2andB>=1)")))||(F((X("(haveA2>=3)"))&&("(haveB>haveA2)"))))))
Formula 0 simplified : !G(("(haveA2andB>=1)" U F"(haveA2andB>=1)") | F("(haveB>haveA2)" & X"(haveA2>=3)"))
Detected timeout of ITS tools.
[2022-05-22 06:43:11] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:43:11] [INFO ] Applying decomposition
[2022-05-22 06:43:11] [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/graph7869513215728003640.txt' '-o' '/tmp/graph7869513215728003640.bin' '-w' '/tmp/graph7869513215728003640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7869513215728003640.bin' '-l' '-1' '-v' '-w' '/tmp/graph7869513215728003640.weights' '-q' '0' '-e' '0.001'
[2022-05-22 06:43:11] [INFO ] Decomposing Gal with order
[2022-05-22 06:43:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 06:43:11] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:43:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-22 06:43:11] [INFO ] Time to serialize gal into /tmp/LTL17813058697477907056.gal : 1 ms
[2022-05-22 06:43:11] [INFO ] Time to serialize properties into /tmp/LTL1596698881197175483.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/LTL17813058697477907056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1596698881197175483.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/LTL1781305...267
Read 1 LTL properties
Checking formula 0 : !((G((("(gi0.gu0.haveA2andB>=1)")U(F("(gi0.gu0.haveA2andB>=1)")))||(F((X("(gu2.haveA2>=3)"))&&("(gu2.haveB>gu2.haveA2)"))))))
Formula 0 simplified : !G(("(gi0.gu0.haveA2andB>=1)" U F"(gi0.gu0.haveA2andB>=1)") | F("(gu2.haveB>gu2.haveA2)" & X"(gu2.haveA2>=3)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11717899891079319240
[2022-05-22 06:43:26] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11717899891079319240
Running compilation step : cd /tmp/ltsmin11717899891079319240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin11717899891079319240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11717899891079319240;'/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' '[]((((LTLAPp0==true) U <>((LTLAPp0==true)))||<>((X((LTLAPp1==true))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLCardinality-08 finished in 78813 ms.
[2022-05-22 06:43:41] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13559861141001899247
[2022-05-22 06:43:41] [INFO ] Applying decomposition
[2022-05-22 06:43:41] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-22 06:43:41] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:43:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:43:41] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-22 06:43:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:43:41] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-22 06:43:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:43:41] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13559861141001899247
Running compilation step : cd /tmp/ltsmin13559861141001899247;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
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/graph9521247194715064812.txt' '-o' '/tmp/graph9521247194715064812.bin' '-w' '/tmp/graph9521247194715064812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9521247194715064812.bin' '-l' '-1' '-v' '-w' '/tmp/graph9521247194715064812.weights' '-q' '0' '-e' '0.001'
[2022-05-22 06:43:41] [INFO ] Decomposing Gal with order
[2022-05-22 06:43:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 06:43:41] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:43:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 06:43:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality17174329113177652847.gal : 1 ms
[2022-05-22 06:43:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality1772827510880640984.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/LTLCardinality17174329113177652847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1772827510880640984.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/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !((G((X(X("(gu1.haveB<=gu1.resA)")))&&(F("(gu1.haveB<=gu1.resA)")))))
Formula 0 simplified : !G(XX"(gu1.haveB<=gu1.resA)" & F"(gu1.haveB<=gu1.resA)")
Compilation finished in 91 ms.
Running link step : cd /tmp/ltsmin13559861141001899247;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin13559861141001899247;'/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(X((LTLAPp0==true)))&&<>((LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: LTL layer: formula: []((X(X((LTLAPp0==true)))&&<>((LTLAPp0==true))))
pins2lts-mc-linux64( 2/ 8), 0.002: "[]((X(X((LTLAPp0==true)))&&<>((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.082: DFS-FIFO for weak LTL, using special progress label 11
pins2lts-mc-linux64( 0/ 8), 0.083: There are 12 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.083: State length is 9, there are 11 groups
pins2lts-mc-linux64( 0/ 8), 0.083: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.083: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.083: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.083: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.093: ~1 levels ~960 states ~2904 transitions
pins2lts-mc-linux64( 0/ 8), 0.122: ~1 levels ~1920 states ~6392 transitions
pins2lts-mc-linux64( 0/ 8), 0.146: ~1 levels ~3840 states ~13872 transitions
pins2lts-mc-linux64( 0/ 8), 0.194: ~1 levels ~7680 states ~29168 transitions
pins2lts-mc-linux64( 6/ 8), 0.251: ~1 levels ~15360 states ~69008 transitions
pins2lts-mc-linux64( 4/ 8), 0.336: ~1 levels ~30720 states ~149432 transitions
pins2lts-mc-linux64( 4/ 8), 0.513: ~1 levels ~61440 states ~306984 transitions
pins2lts-mc-linux64( 7/ 8), 0.823: ~1 levels ~122880 states ~628464 transitions
pins2lts-mc-linux64( 7/ 8), 1.266: ~1 levels ~245760 states ~1278288 transitions
pins2lts-mc-linux64( 4/ 8), 1.940: ~1 levels ~491520 states ~2674504 transitions
pins2lts-mc-linux64( 2/ 8), 2.686: ~1 levels ~983040 states ~5335344 transitions
pins2lts-mc-linux64( 2/ 8), 3.697: ~1 levels ~1966080 states ~10766664 transitions
pins2lts-mc-linux64( 0/ 8), 5.580: ~1 levels ~3932160 states ~20634992 transitions
pins2lts-mc-linux64( 2/ 8), 9.444: ~1 levels ~7864320 states ~43888464 transitions
pins2lts-mc-linux64( 3/ 8), 17.363: ~1 levels ~15728640 states ~88921512 transitions
pins2lts-mc-linux64( 3/ 8), 34.014: ~1 levels ~31457280 states ~179684288 transitions
pins2lts-mc-linux64( 4/ 8), 68.775: ~1 levels ~62914560 states ~363384680 transitions
pins2lts-mc-linux64( 4/ 8), 141.652: ~1 levels ~125829120 states ~728670544 transitions
pins2lts-mc-linux64( 0/ 8), 175.102: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 175.130:
pins2lts-mc-linux64( 0/ 8), 175.130: mean standard work distribution: 2.0% (states) 3.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 175.130:
pins2lts-mc-linux64( 0/ 8), 175.130: Explored 131778157 states 756989194 transitions, fanout: 5.744
pins2lts-mc-linux64( 0/ 8), 175.130: Total exploration time 175.030 sec (174.990 sec minimum, 175.006 sec on average)
pins2lts-mc-linux64( 0/ 8), 175.130: States per second: 752889, Transitions per second: 4324911
pins2lts-mc-linux64( 0/ 8), 175.130:
pins2lts-mc-linux64( 0/ 8), 175.130: Progress states detected: 134217101
pins2lts-mc-linux64( 0/ 8), 175.130: Redundant explorations: -1.8173
pins2lts-mc-linux64( 0/ 8), 175.130:
pins2lts-mc-linux64( 0/ 8), 175.130: Queue width: 8B, total height: 5353506, memory: 40.84MB
pins2lts-mc-linux64( 0/ 8), 175.130: Tree memory: 1112.3MB, 8.7 B/state, compr.: 22.9%
pins2lts-mc-linux64( 0/ 8), 175.130: Tree fill ratio (roots/leafs): 99.0%/34.0%
pins2lts-mc-linux64( 0/ 8), 175.130: Stored 6 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 175.130: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 175.130: Est. total memory use: 1153.1MB (~1064.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13559861141001899247;'/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(X((LTLAPp0==true)))&&<>((LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13559861141001899247;'/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(X((LTLAPp0==true)))&&<>((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 07:05:29] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:05:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality18155844195750740373.gal : 0 ms
[2022-05-22 07:05:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality4681433949769025727.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/LTLCardinality18155844195750740373.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4681433949769025727.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/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !((G((X(X("(haveB<=resA)")))&&(F("(haveB<=resA)")))))
Formula 0 simplified : !G(XX"(haveB<=resA)" & F"(haveB<=resA)")
Detected timeout of ITS tools.
[2022-05-22 07:27:17] [INFO ] Flatten gal took : 3 ms
[2022-05-22 07:27:17] [INFO ] Input system was already deterministic with 6 transitions.
[2022-05-22 07:27:17] [INFO ] Transformed 8 places.
[2022-05-22 07:27:17] [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 07:27:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality8202971157655730435.gal : 1 ms
[2022-05-22 07:27:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality9248178299603710304.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/LTLCardinality8202971157655730435.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9248178299603710304.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/LTLCardina...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((X(X("(haveB<=resA)")))&&(F("(haveB<=resA)")))))
Formula 0 simplified : !G(XX"(haveB<=resA)" & F"(haveB<=resA)")
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-nC05000vN"
export BK_EXAMINATION="LTLCardinality"
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-nC05000vN, examination is LTLCardinality"
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-165303546300867"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC05000vN.tgz
mv TwoPhaseLocking-PT-nC05000vN execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;