fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r311-tall-162132108100285
Last Updated
Jun 28, 2021

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
686.239 83660.00 96194.00 212.60 TTFFFTFFFFFFTFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.2K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 11 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 10 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.6K May 12 08:13 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-nC00100vN-00
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-01
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-02
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-03
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-04
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-05
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-06
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-07
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-08
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-09
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-10
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-11
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-12
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-13
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-14
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-15

=== Now, execution of the tool begins

BK_START 1621453330033

Running Version 0
[2021-05-19 19:42:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-19 19:42:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:42:11] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-19 19:42:11] [INFO ] Transformed 8 places.
[2021-05-19 19:42:11] [INFO ] Transformed 6 transitions.
[2021-05-19 19:42:11] [INFO ] Parsed PT model containing 8 places and 6 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 19:42:11] [INFO ] Initial state test concluded for 1 properties.
FORMULA TwoPhaseLocking-PT-nC00100vN-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 7 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:42:11] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-19 19:42:11] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:42:11] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-19 19:42:11] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:42:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:42:11] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
[2021-05-19 19:42:12] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-19 19:42:12] [INFO ] Flatten gal took : 15 ms
FORMULA TwoPhaseLocking-PT-nC00100vN-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00100vN-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00100vN-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:42:12] [INFO ] Flatten gal took : 3 ms
[2021-05-19 19:42:12] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 204 steps, including 0 resets, run visited all 7 properties in 1 ms. (steps per millisecond=204 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:42:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:42:12] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:42:12] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-19 19:42:12] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:42:12] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:42:12] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00100vN-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 25029 reset in 221 ms.
Product exploration explored 100000 steps with 24994 reset in 126 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24947 reset in 84 ms.
Product exploration explored 100000 steps with 24989 reset in 105 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:42:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:42:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:42:13] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 24967 reset in 212 ms.
Product exploration explored 100000 steps with 24916 reset in 173 ms.
[2021-05-19 19:42:13] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:42:13] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:42:13] [INFO ] Time to serialize gal into /tmp/LTL9351017121083389380.gal : 1 ms
[2021-05-19 19:42:13] [INFO ] Time to serialize properties into /tmp/LTL12125431840741639597.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9351017121083389380.gal, -t, CGAL, -LTL, /tmp/LTL12125431840741639597.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9351017121083389380.gal -t CGAL -LTL /tmp/LTL12125431840741639597.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(haveAandB>=1)"))))
Formula 0 simplified : !XF"(haveAandB>=1)"
Detected timeout of ITS tools.
[2021-05-19 19:42:28] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:42:28] [INFO ] Applying decomposition
[2021-05-19 19:42:28] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11445795005916578985.txt, -o, /tmp/graph11445795005916578985.bin, -w, /tmp/graph11445795005916578985.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11445795005916578985.bin, -l, -1, -v, -w, /tmp/graph11445795005916578985.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:42:28] [INFO ] Decomposing Gal with order
[2021-05-19 19:42:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:42:28] [INFO ] Flatten gal took : 21 ms
[2021-05-19 19:42:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-19 19:42:28] [INFO ] Time to serialize gal into /tmp/LTL17562365451505881857.gal : 1 ms
[2021-05-19 19:42:28] [INFO ] Time to serialize properties into /tmp/LTL12518501438449033594.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17562365451505881857.gal, -t, CGAL, -LTL, /tmp/LTL12518501438449033594.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17562365451505881857.gal -t CGAL -LTL /tmp/LTL12518501438449033594.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(u2.haveAandB>=1)"))))
Formula 0 simplified : !XF"(u2.haveAandB>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6891829316279995218
[2021-05-19 19:42:43] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6891829316279995218
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6891829316279995218]
Compilation finished in 157 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6891829316279995218]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6891829316279995218]
LTSmin run took 254 ms.
FORMULA TwoPhaseLocking-PT-nC00100vN-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC00100vN-00 finished in 32087 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 5 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:42:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:42:44] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:42:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:42:44] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-19 19:42:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:42:44] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:42:44] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00100vN-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13231 reset in 130 ms.
Product exploration explored 100000 steps with 13313 reset in 133 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12282 reset in 86 ms.
Product exploration explored 100000 steps with 13087 reset in 175 ms.
[2021-05-19 19:42:44] [INFO ] Flatten gal took : 0 ms
[2021-05-19 19:42:44] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:42:44] [INFO ] Time to serialize gal into /tmp/LTL10626460974386625050.gal : 1 ms
[2021-05-19 19:42:44] [INFO ] Time to serialize properties into /tmp/LTL3378987946942184209.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10626460974386625050.gal, -t, CGAL, -LTL, /tmp/LTL3378987946942184209.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10626460974386625050.gal -t CGAL -LTL /tmp/LTL3378987946942184209.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((resA>=1)&&(haveB>=1))"))))
Formula 0 simplified : !GF"((resA>=1)&&(haveB>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1363 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.6403,128832,1,0,207,339474,24,1,491,523639,519
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA TwoPhaseLocking-PT-nC00100vN-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property TwoPhaseLocking-PT-nC00100vN-01 finished in 14867 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:42:59] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-19 19:42:59] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:42:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:42:59] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:42:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:42:59] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, p0, p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC00100vN-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00100vN-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00100vN-02 finished in 98 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(((G(p1) U p2)&&p0)))||G(!p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:42:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:42:59] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:42:59] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-19 19:42:59] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-19 19:42:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:42:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:42:59] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) p2), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00100vN-04 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p0) p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s5 1)), p1:(OR (LT s0 1) (LT s1 1)), p0:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 179 ms.
Stack based approach found an accepted trace after 1612 steps with 0 reset with depth 1613 and stack size 1556 in 3 ms.
FORMULA TwoPhaseLocking-PT-nC00100vN-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00100vN-04 finished in 423 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:42:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:42:59] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:42:59] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-19 19:42:59] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:42:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:42:59] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00100vN-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10216 reset in 94 ms.
Product exploration explored 100000 steps with 10202 reset in 119 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10269 reset in 75 ms.
Product exploration explored 100000 steps with 10233 reset in 111 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:43:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:43:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:43:00] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 15053 reset in 102 ms.
Product exploration explored 100000 steps with 15154 reset in 118 ms.
[2021-05-19 19:43:00] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:43:00] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:43:00] [INFO ] Time to serialize gal into /tmp/LTL5994405900909003935.gal : 0 ms
[2021-05-19 19:43:00] [INFO ] Time to serialize properties into /tmp/LTL11067245453718688508.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5994405900909003935.gal, -t, CGAL, -LTL, /tmp/LTL11067245453718688508.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5994405900909003935.gal -t CGAL -LTL /tmp/LTL11067245453718688508.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(haveA2andB>=1)"))))
Formula 0 simplified : !XF"(haveA2andB>=1)"
Detected timeout of ITS tools.
[2021-05-19 19:43:15] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:43:15] [INFO ] Applying decomposition
[2021-05-19 19:43:15] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17351154615188920132.txt, -o, /tmp/graph17351154615188920132.bin, -w, /tmp/graph17351154615188920132.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17351154615188920132.bin, -l, -1, -v, -w, /tmp/graph17351154615188920132.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:43:15] [INFO ] Decomposing Gal with order
[2021-05-19 19:43:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:43:15] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:43:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-19 19:43:15] [INFO ] Time to serialize gal into /tmp/LTL14885497679045449952.gal : 1 ms
[2021-05-19 19:43:15] [INFO ] Time to serialize properties into /tmp/LTL9724168962791045468.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14885497679045449952.gal, -t, CGAL, -LTL, /tmp/LTL9724168962791045468.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14885497679045449952.gal -t CGAL -LTL /tmp/LTL9724168962791045468.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(u1.haveA2andB>=1)"))))
Formula 0 simplified : !XF"(u1.haveA2andB>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10737130448331387091
[2021-05-19 19:43:30] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10737130448331387091
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10737130448331387091]
Compilation finished in 91 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10737130448331387091]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin10737130448331387091]
LTSmin run took 305 ms.
FORMULA TwoPhaseLocking-PT-nC00100vN-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC00100vN-05 finished in 31466 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:43:31] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-19 19:43:31] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-19 19:43:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:43:31] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : TwoPhaseLocking-PT-nC00100vN-06 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s6 1) (OR (LT s3 1) (LT s4 1))), p0:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2473 steps with 0 reset in 2 ms.
FORMULA TwoPhaseLocking-PT-nC00100vN-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00100vN-06 finished in 108 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(!p0) U X(!p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:43:31] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-19 19:43:31] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:43:31] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 132 ms :[p1, p1, p1, (AND p0 p1), p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC00100vN-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s7 1), p1:(GEQ s6 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18868 reset in 173 ms.
Stack based approach found an accepted trace after 134 steps with 25 reset with depth 13 and stack size 13 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00100vN-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00100vN-07 finished in 352 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&F(G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:43:31] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:43:31] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:43:31] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : TwoPhaseLocking-PT-nC00100vN-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1)), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00100vN-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00100vN-08 finished in 130 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((G(!p0)||(!p0&&F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:43:31] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:43:31] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:43:31] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 103 ms :[p0, (AND p0 (NOT p1)), p0, p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC00100vN-10 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s6 1), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6512 reset in 146 ms.
Stack based approach found an accepted trace after 145 steps with 11 reset with depth 39 and stack size 39 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00100vN-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00100vN-10 finished in 304 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((!p0 U (F(p1)&&X(X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:43:31] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:43:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:43:32] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:43:32] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:43:32] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00100vN-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s4 1)), p0:(OR (LT s0 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 1 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00100vN-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00100vN-11 finished in 392 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 1 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:43:32] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:43:32] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:43:32] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:43:32] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-19 19:43:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:43:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:43:32] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC00100vN-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00100vN-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00100vN-13 finished in 153 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(G((!p0 U p1)))&&(!p0||X(!p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:43:32] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:43:32] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:43:32] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:43:32] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:43:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:43:32] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1), (NOT p1), true]
Running random walk in product with property : TwoPhaseLocking-PT-nC00100vN-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(OR p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1)), p1:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1027 steps with 3 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00100vN-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00100vN-15 finished in 195 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621453413693

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-nC00100vN"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is TwoPhaseLocking-PT-nC00100vN, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-162132108100285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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