fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r258-tall-165303546300851
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for TwoPhaseLocking-PT-nC02000vN

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5216.243 3600000.00 4108694.00 8360.60 FFFF?TFTFTTFFTFF 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-165303546300851.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-nC02000vN, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303546300851
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 8.0K Apr 30 10:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 10:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 10:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 10:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 9 09:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K 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-nC02000vN-LTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653196004715

Running Version 202205111006
[2022-05-22 05:06:45] [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 05:06:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 05:06:45] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2022-05-22 05:06:45] [INFO ] Transformed 8 places.
[2022-05-22 05:06:45] [INFO ] Transformed 6 transitions.
[2022-05-22 05:06:45] [INFO ] Parsed PT model containing 8 places and 6 transitions in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-10 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 05:06:46] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-22 05:06:46] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:06:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:06:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:06:46] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 05:06:46] [INFO ] Dead Transitions using invariants and state equation in 30 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 05:06:46] [INFO ] Flatten gal took : 12 ms
[2022-05-22 05:06:46] [INFO ] Flatten gal took : 3 ms
[2022-05-22 05:06:46] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=435 ) properties (out of 25) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:06:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:06:46] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-22 05:06:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-22 05:06:46] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-22 05:06:46] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-22 05:06:46] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 4002 steps, including 0 resets, run visited all 2 properties in 45 ms. (steps per millisecond=88 )
Parikh walk visited 4 properties in 152 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)&&(G(X(p1))||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 05:06:47] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 05:06:47] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:06:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:06:47] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:06:47] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:06:47] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 2 s7), p1:(GT 1 s2)], 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 34 steps with 0 reset in 2 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLCardinality-01 finished in 458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X(G(p0)))||F(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 05:06:47] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:06:47] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:06:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:06:47] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:06:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:06:47] [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 306 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(GT 1 s4), p0:(GT 2 s6)], 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19046 reset in 201 ms.
Stack based approach found an accepted trace after 1308 steps with 255 reset with depth 56 and stack size 55 in 3 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLCardinality-03 finished in 615 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||((p1 U F(!p0))&&F(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 05:06:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:06:48] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:06:48] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:06:48] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:06:48] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:06:48] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 1 s2), p0:(GT s4 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 7461 reset in 98 ms.
Product exploration explored 100000 steps with 7426 reset in 118 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p2))]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2503 ) properties (out of 1) seen :0
Finished Best-First random walk after 48 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:06:49] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 05:06:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 05:06:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-22 05:06:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 05:06:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 05:06:49] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 05:06:49] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 05:06:49] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
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 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 1 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 4 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 05:06:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:06:49] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:06:49] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:06:49] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-22 05:06:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:06:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:06:49] [INFO ] Dead Transitions using invariants and state equation in 27 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.
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)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 3004 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1001 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:06:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:06:49] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 05:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 05:06:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 05:06:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 05:06:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 05:06:49] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 05:06:49] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 05:06:49] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10222 reset in 75 ms.
Product exploration explored 100000 steps with 10230 reset in 93 ms.
Built C files in :
/tmp/ltsmin14080097111729688353
[2022-05-22 05:06:49] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-22 05:06:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:06:49] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-22 05:06:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:06:49] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-22 05:06:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:06:49] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14080097111729688353
Running compilation step : cd /tmp/ltsmin14080097111729688353;'/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 167 ms.
Running link step : cd /tmp/ltsmin14080097111729688353;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin14080097111729688353;'/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/stateBased15155452459252975478.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 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 05:07:05] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:07:05] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:07:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:07:05] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-22 05:07:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:07:05] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:07:05] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 transitions.
Built C files in :
/tmp/ltsmin12724880118762042362
[2022-05-22 05:07:05] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-22 05:07:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:07:05] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-22 05:07:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:07:05] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-22 05:07:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:07:05] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12724880118762042362
Running compilation step : cd /tmp/ltsmin12724880118762042362;'/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 64 ms.
Running link step : cd /tmp/ltsmin12724880118762042362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12724880118762042362;'/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/stateBased35229357288170791.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 05:07:20] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:07:20] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:07:20] [INFO ] Time to serialize gal into /tmp/LTL8153800009115669803.gal : 1 ms
[2022-05-22 05:07:20] [INFO ] Time to serialize properties into /tmp/LTL9741145701595490367.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/LTL8153800009115669803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9741145701595490367.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/LTL8153800...266
Read 1 LTL properties
Checking formula 0 : !(((X(F("(haveB>Clients)")))||((("(Clients>=1)")U(F("(haveB<=Clients)")))&&(F("(haveA2>=1)")))))
Formula 0 simplified : !(XF"(haveB>Clients)" | (("(Clients>=1)" U F"(haveB<=Clients)") & F"(haveA2>=1)"))
Detected timeout of ITS tools.
[2022-05-22 05:07:35] [INFO ] Flatten gal took : 5 ms
[2022-05-22 05:07:35] [INFO ] Applying decomposition
[2022-05-22 05:07:35] [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/graph3238562504579299939.txt' '-o' '/tmp/graph3238562504579299939.bin' '-w' '/tmp/graph3238562504579299939.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3238562504579299939.bin' '-l' '-1' '-v' '-w' '/tmp/graph3238562504579299939.weights' '-q' '0' '-e' '0.001'
[2022-05-22 05:07:35] [INFO ] Decomposing Gal with order
[2022-05-22 05:07:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 05:07:35] [INFO ] Flatten gal took : 52 ms
[2022-05-22 05:07:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 05:07:35] [INFO ] Time to serialize gal into /tmp/LTL17254181456153355518.gal : 0 ms
[2022-05-22 05:07:35] [INFO ] Time to serialize properties into /tmp/LTL697673181571426490.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/LTL17254181456153355518.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL697673181571426490.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/LTL1725418...266
Read 1 LTL properties
Checking formula 0 : !(((X(F("(gu1.haveB>gu1.Clients)")))||((("(gu1.Clients>=1)")U(F("(gu1.haveB<=gu1.Clients)")))&&(F("(gu0.haveA2>=1)")))))
Formula 0 simplified : !(XF"(gu1.haveB>gu1.Clients)" | (("(gu1.Clients>=1)" U F"(gu1.haveB<=gu1.Clients)") & F"(gu0.haveA2>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8920807129924474441
[2022-05-22 05:07:50] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8920807129924474441
Running compilation step : cd /tmp/ltsmin8920807129924474441;'/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 63 ms.
Running link step : cd /tmp/ltsmin8920807129924474441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin8920807129924474441;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||(((LTLAPp1==true) U <>(!(LTLAPp0==true)))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLCardinality-04 finished in 77169 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(G((!X(p0)||p1))) U G(p2)))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:05] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:05] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:05] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:05] [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 179 ms :[(NOT p2), (OR (NOT p0) p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s3 s4), p1:(LEQ 2 s6), p0:(LEQ 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29667 reset in 94 ms.
Stack based approach found an accepted trace after 11367 steps with 3381 reset with depth 30 and stack size 30 in 12 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLCardinality-06 finished in 396 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(p0)||G((p1 U p2)))))))'
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 05:08:06] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:06] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:06] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:06] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-22 05:08:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:06] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:06] [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 90 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT s2 s6) (GT s4 s2)), p2:(LEQ s1 s2), p1:(LEQ s1 s0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 819 reset in 278 ms.
Stack based approach found an accepted trace after 197 steps with 13 reset with depth 46 and stack size 44 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLCardinality-08 finished in 467 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||X(X(((p1 U !p1)||p2)))))'
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 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 05:08:06] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:06] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:06] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:06] [INFO ] Implicit Places using invariants and state equation in 17 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 05:08:06] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:06] [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.
Stuttering acceptance computed with spot in 273 ms :[p1, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(LEQ s0 s7), p2:(LEQ s5 s2), p0:(GT 3 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 57 ms.
Product exploration explored 100000 steps with 33333 reset in 63 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p0), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p2) p1))))
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLCardinality-09 finished in 586 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((!G(X(p0)) U G(p1)))||p2)))'
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.
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 05:08:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:07] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-22 05:08:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:07] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (LEQ 3 s3) (LEQ 2 s3)), p1:(LEQ 1 s0), p0:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 152 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 p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 336 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 120 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1430 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:08] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:08:08] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-22 05:08:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 05:08:08] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-22 05:08:08] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-22 05:08:08] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2009 steps, including 0 resets, run visited all 2 properties in 26 ms. (steps per millisecond=77 )
Parikh walk visited 2 properties in 25 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 9 factoid took 360 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 91 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1)]
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.
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 05:08:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:08] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:08] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-22 05:08:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:08] [INFO ] Dead Transitions using invariants and state equation in 27 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 p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 264 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 112 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:08:09] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-22 05:08:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:08:09] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-22 05:08:09] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-22 05:08:09] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2009 steps, including 0 resets, run visited all 2 properties in 25 ms. (steps per millisecond=80 )
Parikh walk visited 2 properties in 24 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 9 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 121 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 189 ms.
Built C files in :
/tmp/ltsmin16093711246801598769
[2022-05-22 05:08:10] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-22 05:08:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:10] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-22 05:08:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:10] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-22 05:08:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16093711246801598769
Running compilation step : cd /tmp/ltsmin16093711246801598769;'/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 92 ms.
Running link step : cd /tmp/ltsmin16093711246801598769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16093711246801598769;'/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/stateBased1047243807405485374.hoa' '--buchi-type=spotba'
LTSmin run took 798 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLCardinality-11 finished in 4228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(G((p0&&(G(p0)||p1)))))))'
Support contains 2 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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 05:08:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:11] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-22 05:08:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:11] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLCardinality-12 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 s7 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 69 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLCardinality-12 finished in 186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))||p1)))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:11] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:11] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:11] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s6 s3), p0:(GT s5 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 52 ms.
Product exploration explored 100000 steps with 50000 reset in 55 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 p0), (X p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLCardinality-13 finished in 390 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)&&(G(p1)||p2)))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 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 05:08:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:11] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:08:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:11] [INFO ] Implicit Places using invariants and state equation in 22 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 05:08:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:11] [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 175 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND p2 (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s4 s7), p1:(AND (GT s3 s0) (GT s4 s7)), p0:(LEQ 3 s4)], 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 768 steps with 20 reset in 3 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLCardinality-14 finished in 258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 1 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 05:08:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:12] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:08:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:12] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-22 05:08:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:08:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:12] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 2 s5), p1:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5232 reset in 81 ms.
Product exploration explored 100000 steps with 5267 reset in 95 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 212 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 69 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 3003 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1501 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 317 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 :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
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.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:08:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:13] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:08:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:13] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-22 05:08:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:08:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:13] [INFO ] Dead Transitions using invariants and state equation in 15 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 : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 225 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 61 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 3010 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=1003 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 315 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 56 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5255 reset in 83 ms.
Product exploration explored 100000 steps with 5301 reset in 85 ms.
Built C files in :
/tmp/ltsmin16074764767662597936
[2022-05-22 05:08:14] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-22 05:08:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:14] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-22 05:08:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:14] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-22 05:08:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:14] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16074764767662597936
Running compilation step : cd /tmp/ltsmin16074764767662597936;'/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 63 ms.
Running link step : cd /tmp/ltsmin16074764767662597936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16074764767662597936;'/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/stateBased3606406088912536853.hoa' '--buchi-type=spotba'
LTSmin run took 322 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLCardinality-15 finished in 2611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||((p1 U F(!p0))&&F(p2))))'
Found a CL insensitive property : TwoPhaseLocking-PT-nC02000vN-LTLCardinality-04
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
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 1 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:08:15] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:15] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:08:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:15] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:08:15] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:15] [INFO ] Dead Transitions using invariants and state equation in 19 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-nC02000vN-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 1 s2), p0:(GT s4 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10241 reset in 64 ms.
Product exploration explored 100000 steps with 10203 reset in 74 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 3004 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1502 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:08:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:15] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 05:08:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 05:08:15] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 05:08:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 05:08:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 05:08:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 05:08:15] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 05:08:15] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 05:08:15] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
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 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 05:08:15] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:15] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:08:15] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:15] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-22 05:08:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:08:15] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:15] [INFO ] Dead Transitions using invariants and state equation in 16 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)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 3004 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1001 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:08:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:16] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 05:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 05:08:16] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2022-05-22 05:08:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 05:08:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 05:08:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 05:08:16] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 05:08:16] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 05:08:16] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10213 reset in 71 ms.
Product exploration explored 100000 steps with 10281 reset in 70 ms.
Built C files in :
/tmp/ltsmin10973558773626604417
[2022-05-22 05:08:16] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-22 05:08:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:16] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-22 05:08:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:16] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-22 05:08:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:16] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10973558773626604417
Running compilation step : cd /tmp/ltsmin10973558773626604417;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 65 ms.
Running link step : cd /tmp/ltsmin10973558773626604417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10973558773626604417;'/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/stateBased419828188539537437.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 SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 4 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 05:08:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:31] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:08:31] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:31] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-22 05:08:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:08:31] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:31] [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.
Built C files in :
/tmp/ltsmin11092718899803291431
[2022-05-22 05:08:31] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-22 05:08:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:31] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-22 05:08:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:31] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-22 05:08:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11092718899803291431
Running compilation step : cd /tmp/ltsmin11092718899803291431;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin11092718899803291431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11092718899803291431;'/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/stateBased6157347286103390475.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 05:08:46] [INFO ] Flatten gal took : 3 ms
[2022-05-22 05:08:46] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:08:46] [INFO ] Time to serialize gal into /tmp/LTL15965272917539568419.gal : 1 ms
[2022-05-22 05:08:46] [INFO ] Time to serialize properties into /tmp/LTL7588796835317599862.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/LTL15965272917539568419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7588796835317599862.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/LTL1596527...267
Read 1 LTL properties
Checking formula 0 : !(((X(F("(haveB>Clients)")))||((("(Clients>=1)")U(F("(haveB<=Clients)")))&&(F("(haveA2>=1)")))))
Formula 0 simplified : !(XF"(haveB>Clients)" | (("(Clients>=1)" U F"(haveB<=Clients)") & F"(haveA2>=1)"))
Detected timeout of ITS tools.
[2022-05-22 05:09:01] [INFO ] Flatten gal took : 4 ms
[2022-05-22 05:09:01] [INFO ] Applying decomposition
[2022-05-22 05:09:01] [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/graph10712725631026532209.txt' '-o' '/tmp/graph10712725631026532209.bin' '-w' '/tmp/graph10712725631026532209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10712725631026532209.bin' '-l' '-1' '-v' '-w' '/tmp/graph10712725631026532209.weights' '-q' '0' '-e' '0.001'
[2022-05-22 05:09:01] [INFO ] Decomposing Gal with order
[2022-05-22 05:09:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 05:09:01] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:09:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 05:09:01] [INFO ] Time to serialize gal into /tmp/LTL6975477948334211138.gal : 0 ms
[2022-05-22 05:09:01] [INFO ] Time to serialize properties into /tmp/LTL6206727017474959071.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/LTL6975477948334211138.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6206727017474959071.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/LTL6975477...266
Read 1 LTL properties
Checking formula 0 : !(((X(F("(gu1.haveB>gu1.Clients)")))||((("(gu1.Clients>=1)")U(F("(gu1.haveB<=gu1.Clients)")))&&(F("(gu0.haveA2>=1)")))))
Formula 0 simplified : !(XF"(gu1.haveB>gu1.Clients)" | (("(gu1.Clients>=1)" U F"(gu1.haveB<=gu1.Clients)") & F"(gu0.haveA2>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12686671414333840100
[2022-05-22 05:09:16] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12686671414333840100
Running compilation step : cd /tmp/ltsmin12686671414333840100;'/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 62 ms.
Running link step : cd /tmp/ltsmin12686671414333840100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12686671414333840100;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||(((LTLAPp1==true) U <>(!(LTLAPp0==true)))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLCardinality-04 finished in 76995 ms.
[2022-05-22 05:09:31] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4044899725965187437
[2022-05-22 05:09:31] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-22 05:09:31] [INFO ] Applying decomposition
[2022-05-22 05:09:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:09:31] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-22 05:09:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:09:31] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-22 05:09:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:09:31] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:09:31] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4044899725965187437
Running compilation step : cd /tmp/ltsmin4044899725965187437;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph7606827467315772598.txt' '-o' '/tmp/graph7606827467315772598.bin' '-w' '/tmp/graph7606827467315772598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7606827467315772598.bin' '-l' '-1' '-v' '-w' '/tmp/graph7606827467315772598.weights' '-q' '0' '-e' '0.001'
[2022-05-22 05:09:31] [INFO ] Decomposing Gal with order
[2022-05-22 05:09:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 05:09:31] [INFO ] Flatten gal took : 2 ms
[2022-05-22 05:09:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 05:09:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality51298348425363725.gal : 1 ms
[2022-05-22 05:09:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality2428953170190923533.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/LTLCardinality51298348425363725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2428953170190923533.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...286
Read 1 LTL properties
Checking formula 0 : !(((X(F("(gu2.haveB>gu2.Clients)")))||((("(gu2.Clients>=1)")U(F("(gu2.haveB<=gu2.Clients)")))&&(F("(gi0.gu1.haveA2>=1)")))))
Formula 0 simplified : !(XF"(gu2.haveB>gu2.Clients)" | (("(gu2.Clients>=1)" U F"(gu2.haveB<=gu2.Clients)") & F"(gi0.gu1.haveA2>=1)"))
Compilation finished in 67 ms.
Running link step : cd /tmp/ltsmin4044899725965187437;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 20 ms.
Running LTSmin : cd /tmp/ltsmin4044899725965187437;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||(((LTLAPp1==true) U <>(!(LTLAPp0==true)))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: LTL layer: formula: (X(<>((LTLAPp0==true)))||(((LTLAPp1==true) U <>(!(LTLAPp0==true)))&&<>((LTLAPp2==true))))
pins2lts-mc-linux64( 3/ 8), 0.001: "(X(<>((LTLAPp0==true)))||(((LTLAPp1==true) U <>(!(LTLAPp0==true)))&&<>((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.053: DFS-FIFO for weak LTL, using special progress label 10
pins2lts-mc-linux64( 0/ 8), 0.053: There are 11 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.053: State length is 9, there are 8 groups
pins2lts-mc-linux64( 0/ 8), 0.053: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.053: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.053: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.053: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.102: ~110 levels ~960 states ~3832 transitions
pins2lts-mc-linux64( 4/ 8), 0.162: ~193 levels ~1920 states ~6824 transitions
pins2lts-mc-linux64( 4/ 8), 0.272: ~392 levels ~3840 states ~14480 transitions
pins2lts-mc-linux64( 5/ 8), 0.481: ~802 levels ~7680 states ~30512 transitions
pins2lts-mc-linux64( 5/ 8), 0.792: ~1610 levels ~15360 states ~62704 transitions
pins2lts-mc-linux64( 4/ 8), 1.358: ~3197 levels ~30720 states ~125376 transitions
pins2lts-mc-linux64( 2/ 8), 1.677: ~4005 levels ~61440 states ~197392 transitions
pins2lts-mc-linux64( 2/ 8), 1.986: ~4005 levels ~122880 states ~318600 transitions
pins2lts-mc-linux64( 5/ 8), 3.592: ~4002 levels ~245760 states ~624048 transitions
pins2lts-mc-linux64( 2/ 8), 4.604: ~4005 levels ~491520 states ~1203104 transitions
pins2lts-mc-linux64( 2/ 8), 7.453: ~4005 levels ~983040 states ~2393576 transitions
pins2lts-mc-linux64( 3/ 8), 9.784: ~4005 levels ~1966080 states ~4835056 transitions
pins2lts-mc-linux64( 3/ 8), 11.512: ~4005 levels ~3932160 states ~9616232 transitions
pins2lts-mc-linux64( 0/ 8), 14.172: ~4005 levels ~7864320 states ~19266480 transitions
pins2lts-mc-linux64( 7/ 8), 20.086: ~4005 levels ~15728640 states ~38828240 transitions
pins2lts-mc-linux64( 3/ 8), 33.005: ~4005 levels ~31457280 states ~77029304 transitions
pins2lts-mc-linux64( 3/ 8), 56.940: ~4005 levels ~62914560 states ~154657208 transitions
pins2lts-mc-linux64( 0/ 8), 65.409: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 65.436:
pins2lts-mc-linux64( 0/ 8), 65.436: mean standard work distribution: 4.3% (states) 3.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 65.436:
pins2lts-mc-linux64( 0/ 8), 65.436: Explored 65568251 states 162687986 transitions, fanout: 2.481
pins2lts-mc-linux64( 0/ 8), 65.436: Total exploration time 65.360 sec (65.320 sec minimum, 65.341 sec on average)
pins2lts-mc-linux64( 0/ 8), 65.436: States per second: 1003186, Transitions per second: 2489106
pins2lts-mc-linux64( 0/ 8), 65.436:
pins2lts-mc-linux64( 0/ 8), 65.436: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 65.436: Redundant explorations: 1.3072
pins2lts-mc-linux64( 0/ 8), 65.436:
pins2lts-mc-linux64( 0/ 8), 65.436: Queue width: 8B, total height: 32045, memory: 0.24MB
pins2lts-mc-linux64( 0/ 8), 65.436: Tree memory: 749.8MB, 12.1 B/state, compr.: 32.0%
pins2lts-mc-linux64( 0/ 8), 65.436: Tree fill ratio (roots/leafs): 48.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 65.436: Stored 6 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 65.436: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 65.436: Est. total memory use: 750.0MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4044899725965187437;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||(((LTLAPp1==true) U <>(!(LTLAPp0==true)))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4044899725965187437;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp0==true)))||(((LTLAPp1==true) U <>(!(LTLAPp0==true)))&&<>((LTLAPp2==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 05:30:26] [INFO ] Flatten gal took : 4 ms
[2022-05-22 05:30:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality7191199379672357426.gal : 1 ms
[2022-05-22 05:30:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality14212399697716499393.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/LTLCardinality7191199379672357426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14212399697716499393.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 1 LTL properties
Checking formula 0 : !(((X(F("(haveB>Clients)")))||((("(Clients>=1)")U(F("(haveB<=Clients)")))&&(F("(haveA2>=1)")))))
Formula 0 simplified : !(XF"(haveB>Clients)" | (("(Clients>=1)" U F"(haveB<=Clients)") & F"(haveA2>=1)"))
Detected timeout of ITS tools.
[2022-05-22 05:51:22] [INFO ] Flatten gal took : 3 ms
[2022-05-22 05:51:22] [INFO ] Input system was already deterministic with 6 transitions.
[2022-05-22 05:51:22] [INFO ] Transformed 8 places.
[2022-05-22 05:51:22] [INFO ] Transformed 6 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-22 05:51:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality17603459156206541511.gal : 0 ms
[2022-05-22 05:51:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality16922205654378462999.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/LTLCardinality17603459156206541511.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16922205654378462999.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...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(F("(haveB>Clients)")))||((("(Clients>=1)")U(F("(haveB<=Clients)")))&&(F("(haveA2>=1)")))))
Formula 0 simplified : !(XF"(haveB>Clients)" | (("(Clients>=1)" U F"(haveB<=Clients)") & F"(haveA2>=1)"))

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-nC02000vN"
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-nC02000vN, 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-165303546300851"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC02000vN.tgz
mv TwoPhaseLocking-PT-nC02000vN 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;