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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
614.163 30427.00 46939.00 79.80 FTTFFFTTFTFFTFFF 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-162038143700324.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-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143700324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 152K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K 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 22K 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 16K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K 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 47K 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-01-00
FORMULA_NAME BusinessProcesses-PT-01-01
FORMULA_NAME BusinessProcesses-PT-01-02
FORMULA_NAME BusinessProcesses-PT-01-03
FORMULA_NAME BusinessProcesses-PT-01-04
FORMULA_NAME BusinessProcesses-PT-01-05
FORMULA_NAME BusinessProcesses-PT-01-06
FORMULA_NAME BusinessProcesses-PT-01-07
FORMULA_NAME BusinessProcesses-PT-01-08
FORMULA_NAME BusinessProcesses-PT-01-09
FORMULA_NAME BusinessProcesses-PT-01-10
FORMULA_NAME BusinessProcesses-PT-01-11
FORMULA_NAME BusinessProcesses-PT-01-12
FORMULA_NAME BusinessProcesses-PT-01-13
FORMULA_NAME BusinessProcesses-PT-01-14
FORMULA_NAME BusinessProcesses-PT-01-15

=== Now, execution of the tool begins

BK_START 1620542266772

Running Version 0
[2021-05-09 06:37:49] [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:37:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:37:49] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-09 06:37:49] [INFO ] Transformed 200 places.
[2021-05-09 06:37:49] [INFO ] Transformed 178 transitions.
[2021-05-09 06:37:49] [INFO ] Found NUPN structural information;
[2021-05-09 06:37:49] [INFO ] Parsed PT model containing 200 places and 178 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 06:37:49] [INFO ] Initial state test concluded for 4 properties.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 199 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 30 place count 169 transition count 149
Iterating global reduction 1 with 28 rules applied. Total rules applied 58 place count 169 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 169 transition count 148
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 75 place count 153 transition count 132
Iterating global reduction 2 with 16 rules applied. Total rules applied 91 place count 153 transition count 132
Applied a total of 91 rules in 93 ms. Remains 153 /199 variables (removed 46) and now considering 132/177 (removed 45) transitions.
// Phase 1: matrix 132 rows 153 cols
[2021-05-09 06:37:49] [INFO ] Computed 28 place invariants in 16 ms
[2021-05-09 06:37:49] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 132 rows 153 cols
[2021-05-09 06:37:49] [INFO ] Computed 28 place invariants in 10 ms
[2021-05-09 06:37:49] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
// Phase 1: matrix 132 rows 153 cols
[2021-05-09 06:37:49] [INFO ] Computed 28 place invariants in 2 ms
[2021-05-09 06:37:49] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Finished structural reductions, in 1 iterations. Remains : 153/199 places, 132/177 transitions.
[2021-05-09 06:37:50] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 06:37:50] [INFO ] Flatten gal took : 61 ms
FORMULA BusinessProcesses-PT-01-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 06:37:50] [INFO ] Flatten gal took : 23 ms
[2021-05-09 06:37:50] [INFO ] Input system was already deterministic with 132 transitions.
Finished random walk after 1187 steps, including 13 resets, run visited all 12 properties in 12 ms. (steps per millisecond=98 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 132/132 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 149 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 149 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 147 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 147 transition count 126
Applied a total of 12 rules in 11 ms. Remains 147 /153 variables (removed 6) and now considering 126/132 (removed 6) transitions.
// Phase 1: matrix 126 rows 147 cols
[2021-05-09 06:37:50] [INFO ] Computed 28 place invariants in 17 ms
[2021-05-09 06:37:50] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 126 rows 147 cols
[2021-05-09 06:37:50] [INFO ] Computed 28 place invariants in 3 ms
[2021-05-09 06:37:50] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 147 cols
[2021-05-09 06:37:50] [INFO ] Computed 28 place invariants in 5 ms
[2021-05-09 06:37:51] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 147/153 places, 126/132 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-01-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s131 1) (OR (EQ s34 0) (EQ s79 1))), p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 4 ms.
FORMULA BusinessProcesses-PT-01-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-00 finished in 915 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0)&&G(p1)) U X(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 132/132 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 150 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 150 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 149 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 149 transition count 128
Applied a total of 8 rules in 25 ms. Remains 149 /153 variables (removed 4) and now considering 128/132 (removed 4) transitions.
// Phase 1: matrix 128 rows 149 cols
[2021-05-09 06:37:51] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:37:51] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 128 rows 149 cols
[2021-05-09 06:37:51] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:37:51] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 149 cols
[2021-05-09 06:37:51] [INFO ] Computed 28 place invariants in 2 ms
[2021-05-09 06:37:51] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 149/153 places, 128/132 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s125 0) (EQ s94 1)), p2:(OR (EQ s45 0) (EQ s22 1)), p0:(OR (EQ s125 0) (EQ s134 1))], nbAcceptance=1, 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 50000 reset in 276 ms.
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Graph (complete) has 320 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Knowledge obtained : [p1, p2, p0]
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Support contains 5 out of 149 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 149/149 places, 128/128 transitions.
Graph (trivial) has 68 edges and 149 vertex of which 6 / 149 are part of one of the 1 SCC in 7 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 144 transition count 122
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 16 place count 144 transition count 166
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 42 place count 144 transition count 166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 139 transition count 153
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 139 transition count 153
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 89 place count 139 transition count 153
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 99 place count 129 transition count 143
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 109 place count 129 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 129 transition count 157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 128 transition count 155
Deduced a syphon composed of 63 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 128 transition count 155
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 112 rules in 73 ms. Remains 128 /149 variables (removed 21) and now considering 155/128 (removed -27) transitions.
[2021-05-09 06:37:53] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 155 rows 128 cols
[2021-05-09 06:37:53] [INFO ] Computed 28 place invariants in 2 ms
[2021-05-09 06:37:53] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/149 places, 155/128 transitions.
Product exploration explored 100000 steps with 50000 reset in 524 ms.
Product exploration explored 100000 steps with 50000 reset in 466 ms.
[2021-05-09 06:37:54] [INFO ] Flatten gal took : 23 ms
[2021-05-09 06:37:54] [INFO ] Flatten gal took : 24 ms
[2021-05-09 06:37:54] [INFO ] Time to serialize gal into /tmp/LTL1701572319230503580.gal : 5 ms
[2021-05-09 06:37:54] [INFO ] Time to serialize properties into /tmp/LTL4047134819781633979.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/LTL1701572319230503580.gal, -t, CGAL, -LTL, /tmp/LTL4047134819781633979.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/LTL1701572319230503580.gal -t CGAL -LTL /tmp/LTL4047134819781633979.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((X("((p157==0)||(p176==1))"))&&(G("((p157==0)||(p111==1))")))U(X("((p53==0)||(p24==1))"))))
Formula 0 simplified : !((X"((p157==0)||(p176==1))" & G"((p157==0)||(p111==1))") U X"((p53==0)||(p24==1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t16, t26, t29, t32, t35, t38, t41, t45, t48, t52, t57, t60, t63, t67, t68, t71, t72, t75, t76, t79, t82, t89, t90, t93, t96, t122, t123, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :4/95/29/128
Computing Next relation with stutter on 105 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
926 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,9.28973,242640,1,0,266,837430,290,124,4259,915963,269
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-01-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-01-02 finished in 13651 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 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 132/132 transitions.
Graph (trivial) has 79 edges and 153 vertex of which 6 / 153 are part of one of the 1 SCC in 6 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 147 transition count 105
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 127 transition count 105
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 41 place count 127 transition count 76
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 105 place count 92 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 88 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 88 transition count 72
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 187 place count 51 transition count 35
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 189 place count 50 transition count 38
Applied a total of 189 rules in 36 ms. Remains 50 /153 variables (removed 103) and now considering 38/132 (removed 94) transitions.
// Phase 1: matrix 38 rows 50 cols
[2021-05-09 06:38:04] [INFO ] Computed 22 place invariants in 6 ms
[2021-05-09 06:38:05] [INFO ] Implicit Places using invariants in 81 ms returned [1, 2, 5, 6, 7, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 85 ms to find 6 implicit places.
[2021-05-09 06:38:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 38 rows 44 cols
[2021-05-09 06:38:05] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-09 06:38:05] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 44/153 places, 38/132 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2021-05-09 06:38:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 38 rows 44 cols
[2021-05-09 06:38:05] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-09 06:38:05] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 44/153 places, 38/132 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s30 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 1 ms.
FORMULA BusinessProcesses-PT-01-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-03 finished in 250 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 132/132 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 148 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 148 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 145 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 145 transition count 124
Applied a total of 16 rules in 8 ms. Remains 145 /153 variables (removed 8) and now considering 124/132 (removed 8) transitions.
// Phase 1: matrix 124 rows 145 cols
[2021-05-09 06:38:05] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:38:05] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 124 rows 145 cols
[2021-05-09 06:38:05] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:38:05] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 145 cols
[2021-05-09 06:38:05] [INFO ] Computed 28 place invariants in 9 ms
[2021-05-09 06:38:05] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/153 places, 124/132 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-01-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s120 1)), p1:(AND (NEQ s47 0) (NEQ s92 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-11 finished in 392 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 132/132 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 149 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 149 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 146 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 146 transition count 125
Applied a total of 14 rules in 9 ms. Remains 146 /153 variables (removed 7) and now considering 125/132 (removed 7) transitions.
// Phase 1: matrix 125 rows 146 cols
[2021-05-09 06:38:05] [INFO ] Computed 28 place invariants in 2 ms
[2021-05-09 06:38:05] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 125 rows 146 cols
[2021-05-09 06:38:05] [INFO ] Computed 28 place invariants in 2 ms
[2021-05-09 06:38:05] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 146 cols
[2021-05-09 06:38:05] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:38:05] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 146/153 places, 125/132 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-01-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s6 0) (EQ s96 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Graph (complete) has 315 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0), true]
Support contains 2 out of 146 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 146/146 places, 125/125 transitions.
Graph (trivial) has 70 edges and 146 vertex of which 6 / 146 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 141 transition count 119
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 16 place count 141 transition count 165
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 42 place count 141 transition count 165
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 136 transition count 150
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 136 transition count 150
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 90 place count 136 transition count 150
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 101 place count 125 transition count 139
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 112 place count 125 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 125 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 124 transition count 146
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 124 transition count 146
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 115 rules in 24 ms. Remains 124 /146 variables (removed 22) and now considering 146/125 (removed -21) transitions.
[2021-05-09 06:38:06] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 146 rows 124 cols
[2021-05-09 06:38:06] [INFO ] Computed 28 place invariants in 2 ms
[2021-05-09 06:38:06] [INFO ] Dead Transitions using invariants and state equation in 267 ms returned []
Finished structural reductions, in 1 iterations. Remains : 124/146 places, 146/125 transitions.
Product exploration explored 100000 steps with 50000 reset in 597 ms.
Product exploration explored 100000 steps with 50000 reset in 625 ms.
[2021-05-09 06:38:08] [INFO ] Flatten gal took : 7 ms
[2021-05-09 06:38:08] [INFO ] Flatten gal took : 7 ms
[2021-05-09 06:38:08] [INFO ] Time to serialize gal into /tmp/LTL8927599847623052346.gal : 9 ms
[2021-05-09 06:38:08] [INFO ] Time to serialize properties into /tmp/LTL741542346325124816.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/LTL8927599847623052346.gal, -t, CGAL, -LTL, /tmp/LTL741542346325124816.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/LTL8927599847623052346.gal -t CGAL -LTL /tmp/LTL741542346325124816.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("((p6==0)||(p115==1))")))
Formula 0 simplified : !X"((p6==0)||(p115==1))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t26, t29, t32, t35, t38, t42, t43, t45, t48, t52, t57, t60, t63, t67, t68, t71, t72, t75, t76, t79, t80, t89, t90, t93, t96, t123, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :4/93/28/125
Computing Next relation with stutter on 105 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
730 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,7.31555,212976,1,0,259,737323,266,121,4157,799513,257
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-01-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-01-12 finished in 10709 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 132/132 transitions.
Graph (trivial) has 76 edges and 153 vertex of which 6 / 153 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 147 transition count 108
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 130 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 128 transition count 106
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 39 place count 128 transition count 77
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 102 place count 94 transition count 77
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 105 place count 91 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 108 place count 91 transition count 74
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 176 place count 57 transition count 40
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 3 with 2 rules applied. Total rules applied 178 place count 56 transition count 43
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 180 place count 56 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 55 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 182 place count 54 transition count 42
Applied a total of 182 rules in 24 ms. Remains 54 /153 variables (removed 99) and now considering 42/132 (removed 90) transitions.
// Phase 1: matrix 42 rows 54 cols
[2021-05-09 06:38:16] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-09 06:38:16] [INFO ] Implicit Places using invariants in 66 ms returned [8, 11, 42]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 68 ms to find 3 implicit places.
[2021-05-09 06:38:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 51 cols
[2021-05-09 06:38:16] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 06:38:16] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 51/153 places, 42/132 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2021-05-09 06:38:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 51 cols
[2021-05-09 06:38:16] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-09 06:38:16] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 51/153 places, 42/132 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s9 0) (EQ s43 1)), p0:(OR (EQ s5 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-14 finished in 426 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 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 132/132 transitions.
Graph (trivial) has 77 edges and 153 vertex of which 6 / 153 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 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 147 transition count 106
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 128 transition count 106
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 39 place count 128 transition count 78
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 101 place count 94 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 91 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 91 transition count 75
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 181 place count 54 transition count 38
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 183 place count 53 transition count 41
Applied a total of 183 rules in 17 ms. Remains 53 /153 variables (removed 100) and now considering 41/132 (removed 91) transitions.
// Phase 1: matrix 41 rows 53 cols
[2021-05-09 06:38:16] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-09 06:38:16] [INFO ] Implicit Places using invariants in 90 ms returned [1, 2, 5, 6, 7, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 92 ms to find 6 implicit places.
[2021-05-09 06:38:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 41 rows 47 cols
[2021-05-09 06:38:16] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-09 06:38:16] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 47/153 places, 41/132 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2021-05-09 06:38:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 41 rows 47 cols
[2021-05-09 06:38:16] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-09 06:38:16] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/153 places, 41/132 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-15 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 (NEQ s18 0) (NEQ s11 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-15 finished in 269 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620542297199

--------------------
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-01"
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-01, 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-162038143700324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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