fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r026-tajo-162038143800348
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BusinessProcesses-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
661.399 40501.00 64275.00 67.90 FFTFTFFFFTFFFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143800348.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BusinessProcesses-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 79K May 5 16:51 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 BusinessProcesses-PT-04-00
FORMULA_NAME BusinessProcesses-PT-04-01
FORMULA_NAME BusinessProcesses-PT-04-02
FORMULA_NAME BusinessProcesses-PT-04-03
FORMULA_NAME BusinessProcesses-PT-04-04
FORMULA_NAME BusinessProcesses-PT-04-05
FORMULA_NAME BusinessProcesses-PT-04-06
FORMULA_NAME BusinessProcesses-PT-04-07
FORMULA_NAME BusinessProcesses-PT-04-08
FORMULA_NAME BusinessProcesses-PT-04-09
FORMULA_NAME BusinessProcesses-PT-04-10
FORMULA_NAME BusinessProcesses-PT-04-11
FORMULA_NAME BusinessProcesses-PT-04-12
FORMULA_NAME BusinessProcesses-PT-04-13
FORMULA_NAME BusinessProcesses-PT-04-14
FORMULA_NAME BusinessProcesses-PT-04-15

=== Now, execution of the tool begins

BK_START 1620542569824

Running Version 0
[2021-05-09 06:42:51] [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]
[2021-05-09 06:42:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:42:51] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-09 06:42:51] [INFO ] Transformed 288 places.
[2021-05-09 06:42:51] [INFO ] Transformed 283 transitions.
[2021-05-09 06:42:51] [INFO ] Found NUPN structural information;
[2021-05-09 06:42:51] [INFO ] Parsed PT model containing 288 places and 283 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 06:42:51] [INFO ] Initial state test concluded for 2 properties.
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 286 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 43 place count 243 transition count 241
Iterating global reduction 1 with 40 rules applied. Total rules applied 83 place count 243 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 243 transition count 240
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 101 place count 226 transition count 223
Iterating global reduction 2 with 17 rules applied. Total rules applied 118 place count 226 transition count 223
Applied a total of 118 rules in 64 ms. Remains 226 /286 variables (removed 60) and now considering 223/281 (removed 58) transitions.
// Phase 1: matrix 223 rows 226 cols
[2021-05-09 06:42:51] [INFO ] Computed 41 place invariants in 26 ms
[2021-05-09 06:42:52] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 223 rows 226 cols
[2021-05-09 06:42:52] [INFO ] Computed 41 place invariants in 5 ms
[2021-05-09 06:42:52] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
// Phase 1: matrix 223 rows 226 cols
[2021-05-09 06:42:52] [INFO ] Computed 41 place invariants in 7 ms
[2021-05-09 06:42:52] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Finished structural reductions, in 1 iterations. Remains : 226/286 places, 223/281 transitions.
[2021-05-09 06:42:52] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 06:42:52] [INFO ] Flatten gal took : 65 ms
FORMULA BusinessProcesses-PT-04-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 06:42:52] [INFO ] Flatten gal took : 22 ms
[2021-05-09 06:42:52] [INFO ] Input system was already deterministic with 223 transitions.
Finished random walk after 16531 steps, including 188 resets, run visited all 12 properties in 70 ms. (steps per millisecond=236 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 226 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 226/226 places, 223/223 transitions.
Graph (trivial) has 94 edges and 226 vertex of which 6 / 226 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 220 transition count 200
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 204 transition count 200
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 33 place count 204 transition count 154
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 97 rules applied. Total rules applied 130 place count 153 transition count 154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 133 place count 150 transition count 151
Iterating global reduction 2 with 3 rules applied. Total rules applied 136 place count 150 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 136 place count 150 transition count 149
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 148 transition count 149
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 236 place count 100 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 238 place count 99 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 98 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 240 place count 97 transition count 103
Applied a total of 240 rules in 45 ms. Remains 97 /226 variables (removed 129) and now considering 103/223 (removed 120) transitions.
// Phase 1: matrix 103 rows 97 cols
[2021-05-09 06:42:53] [INFO ] Computed 35 place invariants in 1 ms
[2021-05-09 06:42:53] [INFO ] Implicit Places using invariants in 98 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
[2021-05-09 06:42:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 96 cols
[2021-05-09 06:42:53] [INFO ] Computed 34 place invariants in 6 ms
[2021-05-09 06:42:53] [INFO ] Dead Transitions using invariants and state equation in 169 ms returned []
Starting structural reductions, iteration 1 : 96/226 places, 103/223 transitions.
Applied a total of 0 rules in 15 ms. Remains 96 /96 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2021-05-09 06:42:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 103 rows 96 cols
[2021-05-09 06:42:53] [INFO ] Computed 34 place invariants in 8 ms
[2021-05-09 06:42:53] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 2 iterations. Remains : 96/226 places, 103/223 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-04-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s9 0) (NEQ s36 1)), p1:(AND (NEQ s45 0) (NEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-01 finished in 746 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 226/226 places, 223/223 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 221 transition count 218
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 221 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 220 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 220 transition count 217
Applied a total of 12 rules in 8 ms. Remains 220 /226 variables (removed 6) and now considering 217/223 (removed 6) transitions.
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:42:53] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:42:53] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:42:53] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:42:53] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 220 cols
[2021-05-09 06:42:53] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:42:54] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 220/226 places, 217/223 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s174 0) (NEQ s203 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 50000 reset in 365 ms.
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Graph (complete) has 557 edges and 220 vertex of which 219 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 220 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 220/220 places, 217/217 transitions.
Graph (trivial) has 90 edges and 220 vertex of which 6 / 220 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 215 transition count 211
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 45 Pre rules applied. Total rules applied 16 place count 215 transition count 322
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 61 place count 215 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 210 transition count 309
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 210 transition count 309
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 123 place count 210 transition count 309
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 135 place count 198 transition count 297
Deduced a syphon composed of 95 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 147 place count 198 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 198 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 149 place count 197 transition count 310
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 150 place count 197 transition count 310
Deduced a syphon composed of 95 places in 0 ms
Applied a total of 150 rules in 40 ms. Remains 197 /220 variables (removed 23) and now considering 310/217 (removed -93) transitions.
[2021-05-09 06:42:55] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 310 rows 197 cols
[2021-05-09 06:42:55] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-09 06:42:55] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 1 iterations. Remains : 197/220 places, 310/217 transitions.
Product exploration explored 100000 steps with 50000 reset in 1023 ms.
Product exploration explored 100000 steps with 50000 reset in 876 ms.
[2021-05-09 06:42:57] [INFO ] Flatten gal took : 22 ms
[2021-05-09 06:42:57] [INFO ] Flatten gal took : 20 ms
[2021-05-09 06:42:57] [INFO ] Time to serialize gal into /tmp/LTL3285275714779901439.gal : 9 ms
[2021-05-09 06:42:57] [INFO ] Time to serialize properties into /tmp/LTL1149748829439207742.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/LTL3285275714779901439.gal, -t, CGAL, -LTL, /tmp/LTL1149748829439207742.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/LTL3285275714779901439.gal -t CGAL -LTL /tmp/LTL1149748829439207742.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p230!=0)||(p271!=1))"))))
Formula 0 simplified : !XF"((p230!=0)||(p271!=1))"
Detected timeout of ITS tools.
[2021-05-09 06:43:12] [INFO ] Flatten gal took : 14 ms
[2021-05-09 06:43:12] [INFO ] Applying decomposition
[2021-05-09 06:43:12] [INFO ] Flatten gal took : 12 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/graph3497783962223075472.txt, -o, /tmp/graph3497783962223075472.bin, -w, /tmp/graph3497783962223075472.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/graph3497783962223075472.bin, -l, -1, -v, -w, /tmp/graph3497783962223075472.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:43:12] [INFO ] Decomposing Gal with order
[2021-05-09 06:43:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:43:12] [INFO ] Removed a total of 236 redundant transitions.
[2021-05-09 06:43:12] [INFO ] Flatten gal took : 61 ms
[2021-05-09 06:43:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2021-05-09 06:43:12] [INFO ] Time to serialize gal into /tmp/LTL12935144132232055271.gal : 7 ms
[2021-05-09 06:43:12] [INFO ] Time to serialize properties into /tmp/LTL1270765581310482981.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/LTL12935144132232055271.gal, -t, CGAL, -LTL, /tmp/LTL1270765581310482981.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/LTL12935144132232055271.gal -t CGAL -LTL /tmp/LTL1270765581310482981.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i10.u68.p230!=0)||(i11.u74.p271!=1))"))))
Formula 0 simplified : !XF"((i10.u68.p230!=0)||(i11.u74.p271!=1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t6, t7, t8, t92, t114, t125, t205, i0.i0.u14.t113, i0.i1.u32.t91, i1.t0, i1.u6.t127, i1.u6.t131, i1.u45.t72, i1.u46.t69, i2.u4.t134, i3.t124, i4.i0.u53.t50, i5.t4, i5.i1.u52.t53, i5.i2.t2, i5.i2.u16.t94, i5.i2.u16.t109, i6.u34.t87, i6.u36.t83, i7.u38.t80, i7.u54.t47, i8.u49.t63, i8.u50.t60, i8.u51.t57, i10.u68.t19, i11.u48.t66, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :40/142/34/216
Computing Next relation with stutter on 460 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
506 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,5.0997,135308,1,0,250560,481,3524,364529,249,1529,762604
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-04-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-04-02 finished in 24998 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0&&X((X((p0 U (X(p2)||G(p0))))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 226 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 226/226 places, 223/223 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 220 transition count 217
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 220 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 219 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 219 transition count 216
Applied a total of 14 rules in 23 ms. Remains 219 /226 variables (removed 7) and now considering 216/223 (removed 7) transitions.
// Phase 1: matrix 216 rows 219 cols
[2021-05-09 06:43:18] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-09 06:43:18] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 216 rows 219 cols
[2021-05-09 06:43:18] [INFO ] Computed 41 place invariants in 10 ms
[2021-05-09 06:43:19] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 219 cols
[2021-05-09 06:43:19] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:43:19] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Finished structural reductions, in 1 iterations. Remains : 219/226 places, 216/223 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-04-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p2:(NEQ s92 1), p0:(AND (NEQ s195 0) (NEQ s110 1)), p1:(AND (NEQ s195 0) (NEQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-05 finished in 1083 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 226/226 places, 223/223 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 220 transition count 217
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 220 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 219 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 219 transition count 216
Applied a total of 14 rules in 25 ms. Remains 219 /226 variables (removed 7) and now considering 216/223 (removed 7) transitions.
// Phase 1: matrix 216 rows 219 cols
[2021-05-09 06:43:19] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:43:19] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 216 rows 219 cols
[2021-05-09 06:43:19] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:43:20] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 219 cols
[2021-05-09 06:43:20] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-09 06:43:20] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Finished structural reductions, in 1 iterations. Remains : 219/226 places, 216/223 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-04-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s211 0) (EQ s106 1)), p0:(AND (EQ s106 0) (EQ s211 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2596 steps with 25 reset in 10 ms.
FORMULA BusinessProcesses-PT-04-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-08 finished in 768 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(G(p0))||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 226 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 226/226 places, 223/223 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 220 transition count 217
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 220 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 219 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 219 transition count 216
Applied a total of 14 rules in 11 ms. Remains 219 /226 variables (removed 7) and now considering 216/223 (removed 7) transitions.
// Phase 1: matrix 216 rows 219 cols
[2021-05-09 06:43:20] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:43:20] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 216 rows 219 cols
[2021-05-09 06:43:20] [INFO ] Computed 41 place invariants in 11 ms
[2021-05-09 06:43:20] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 219 cols
[2021-05-09 06:43:20] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-09 06:43:21] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 219/226 places, 216/223 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-04-10 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (OR (EQ s2 0) (EQ s180 1)) (EQ s60 1)), p0:(AND (EQ s141 0) (EQ s167 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-04-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-10 finished in 664 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 226/226 places, 223/223 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 222 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 222 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 221 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 221 transition count 218
Applied a total of 10 rules in 5 ms. Remains 221 /226 variables (removed 5) and now considering 218/223 (removed 5) transitions.
// Phase 1: matrix 218 rows 221 cols
[2021-05-09 06:43:21] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:43:21] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 218 rows 221 cols
[2021-05-09 06:43:21] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:43:28] [INFO ] Implicit Places using invariants and state equation in 7139 ms returned []
Implicit Place search using SMT with State Equation took 7351 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 221 cols
[2021-05-09 06:43:28] [INFO ] Computed 41 place invariants in 9 ms
[2021-05-09 06:43:28] [INFO ] Dead Transitions using invariants and state equation in 205 ms returned []
Finished structural reductions, in 1 iterations. Remains : 221/226 places, 218/223 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s175 0) (NEQ s162 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-11 finished in 7800 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 226/226 places, 223/223 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 220 transition count 217
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 220 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 219 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 219 transition count 216
Applied a total of 14 rules in 12 ms. Remains 219 /226 variables (removed 7) and now considering 216/223 (removed 7) transitions.
// Phase 1: matrix 216 rows 219 cols
[2021-05-09 06:43:29] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-09 06:43:29] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 216 rows 219 cols
[2021-05-09 06:43:29] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:43:29] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 219 cols
[2021-05-09 06:43:29] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-09 06:43:29] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Finished structural reductions, in 1 iterations. Remains : 219/226 places, 216/223 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s89 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-12 finished in 620 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 226/226 places, 223/223 transitions.
Graph (trivial) has 96 edges and 226 vertex of which 6 / 226 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 220 transition count 199
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 203 transition count 199
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 35 place count 203 transition count 152
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 135 place count 150 transition count 152
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 147 transition count 149
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 147 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 141 place count 147 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 145 transition count 147
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 245 place count 95 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 247 place count 94 transition count 100
Applied a total of 247 rules in 23 ms. Remains 94 /226 variables (removed 132) and now considering 100/223 (removed 123) transitions.
// Phase 1: matrix 100 rows 94 cols
[2021-05-09 06:43:29] [INFO ] Computed 35 place invariants in 1 ms
[2021-05-09 06:43:29] [INFO ] Implicit Places using invariants in 77 ms returned [1, 11, 35, 36, 37]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 78 ms to find 5 implicit places.
[2021-05-09 06:43:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 89 cols
[2021-05-09 06:43:29] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 06:43:29] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Starting structural reductions, iteration 1 : 89/226 places, 100/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2021-05-09 06:43:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 89 cols
[2021-05-09 06:43:29] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 06:43:29] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 2 iterations. Remains : 89/226 places, 100/223 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-04-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s22 0) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-04-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-04-14 finished in 332 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620542610325

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

+ 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
+ [[ -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 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=/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="BusinessProcesses-PT-04"
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 BusinessProcesses-PT-04, 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 r026-tajo-162038143800348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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