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-162038143700340.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-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143700340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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.5K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 63K 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-03-00
FORMULA_NAME BusinessProcesses-PT-03-01
FORMULA_NAME BusinessProcesses-PT-03-02
FORMULA_NAME BusinessProcesses-PT-03-03
FORMULA_NAME BusinessProcesses-PT-03-04
FORMULA_NAME BusinessProcesses-PT-03-05
FORMULA_NAME BusinessProcesses-PT-03-06
FORMULA_NAME BusinessProcesses-PT-03-07
FORMULA_NAME BusinessProcesses-PT-03-08
FORMULA_NAME BusinessProcesses-PT-03-09
FORMULA_NAME BusinessProcesses-PT-03-10
FORMULA_NAME BusinessProcesses-PT-03-11
FORMULA_NAME BusinessProcesses-PT-03-12
FORMULA_NAME BusinessProcesses-PT-03-13
FORMULA_NAME BusinessProcesses-PT-03-14
FORMULA_NAME BusinessProcesses-PT-03-15

=== Now, execution of the tool begins

BK_START 1620542499424

Running Version 0
[2021-05-09 06:41:40] [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:41:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:41:41] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-09 06:41:41] [INFO ] Transformed 274 places.
[2021-05-09 06:41:41] [INFO ] Transformed 237 transitions.
[2021-05-09 06:41:41] [INFO ] Found NUPN structural information;
[2021-05-09 06:41:41] [INFO ] Parsed PT model containing 274 places and 237 transitions in 94 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:41:41] [INFO ] Initial state test concluded for 4 properties.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 233 transition count 198
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 233 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 233 transition count 197
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 98 place count 214 transition count 178
Iterating global reduction 2 with 19 rules applied. Total rules applied 117 place count 214 transition count 178
Applied a total of 117 rules in 54 ms. Remains 214 /273 variables (removed 59) and now considering 178/236 (removed 58) transitions.
// Phase 1: matrix 178 rows 214 cols
[2021-05-09 06:41:41] [INFO ] Computed 41 place invariants in 9 ms
[2021-05-09 06:41:41] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 178 rows 214 cols
[2021-05-09 06:41:41] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:41:41] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
// Phase 1: matrix 178 rows 214 cols
[2021-05-09 06:41:41] [INFO ] Computed 41 place invariants in 5 ms
[2021-05-09 06:41:41] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 1 iterations. Remains : 214/273 places, 178/236 transitions.
[2021-05-09 06:41:41] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 06:41:41] [INFO ] Flatten gal took : 35 ms
FORMULA BusinessProcesses-PT-03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 06:41:41] [INFO ] Flatten gal took : 13 ms
[2021-05-09 06:41:41] [INFO ] Input system was already deterministic with 178 transitions.
Incomplete random walk after 100000 steps, including 1203 resets, run finished after 165 ms. (steps per millisecond=606 ) properties (out of 9) seen :6
Running SMT prover for 3 properties.
// Phase 1: matrix 178 rows 214 cols
[2021-05-09 06:41:42] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-09 06:41:42] [INFO ] [Real]Absence check using 41 positive place invariants in 9 ms returned sat
[2021-05-09 06:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:42] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-09 06:41:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:41:42] [INFO ] [Nat]Absence check using 41 positive place invariants in 7 ms returned sat
[2021-05-09 06:41:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:42] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-09 06:41:42] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 4 ms to minimize.
[2021-05-09 06:41:42] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2021-05-09 06:41:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2021-05-09 06:41:42] [INFO ] Computed and/alt/rep : 176/322/176 causal constraints (skipped 1 transitions) in 9 ms.
[2021-05-09 06:41:42] [INFO ] Added : 142 causal constraints over 29 iterations in 326 ms. Result :sat
[2021-05-09 06:41:42] [INFO ] [Real]Absence check using 41 positive place invariants in 6 ms returned sat
[2021-05-09 06:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:42] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-09 06:41:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:41:42] [INFO ] [Nat]Absence check using 41 positive place invariants in 10 ms returned sat
[2021-05-09 06:41:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:42] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-09 06:41:42] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2021-05-09 06:41:42] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2021-05-09 06:41:42] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 1 ms to minimize.
[2021-05-09 06:41:43] [INFO ] Deduced a trap composed of 16 places in 12 ms of which 0 ms to minimize.
[2021-05-09 06:41:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 116 ms
[2021-05-09 06:41:43] [INFO ] Computed and/alt/rep : 176/322/176 causal constraints (skipped 1 transitions) in 11 ms.
[2021-05-09 06:41:43] [INFO ] Added : 144 causal constraints over 30 iterations in 359 ms. Result :sat
[2021-05-09 06:41:43] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned sat
[2021-05-09 06:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:43] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-09 06:41:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:41:43] [INFO ] [Nat]Absence check using 41 positive place invariants in 9 ms returned sat
[2021-05-09 06:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:43] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-09 06:41:43] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2021-05-09 06:41:43] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 2 ms to minimize.
[2021-05-09 06:41:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2021-05-09 06:41:43] [INFO ] Computed and/alt/rep : 176/322/176 causal constraints (skipped 1 transitions) in 10 ms.
[2021-05-09 06:41:44] [INFO ] Added : 110 causal constraints over 22 iterations in 299 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 214/214 places, 178/178 transitions.
Graph (trivial) has 109 edges and 214 vertex of which 6 / 214 are part of one of the 1 SCC in 4 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 208 transition count 143
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 180 transition count 143
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 57 place count 180 transition count 104
Deduced a syphon composed of 39 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 145 place count 131 transition count 104
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 150 place count 126 transition count 99
Iterating global reduction 2 with 5 rules applied. Total rules applied 155 place count 126 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 155 place count 126 transition count 98
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 124 transition count 98
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 274 place count 66 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 275 place count 65 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 64 transition count 39
Applied a total of 276 rules in 51 ms. Remains 64 /214 variables (removed 150) and now considering 39/178 (removed 139) transitions.
// Phase 1: matrix 39 rows 64 cols
[2021-05-09 06:41:44] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-09 06:41:44] [INFO ] Implicit Places using invariants in 49 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
[2021-05-09 06:41:44] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 39 rows 63 cols
[2021-05-09 06:41:44] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:41:44] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 63/214 places, 39/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2021-05-09 06:41:44] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 39 rows 63 cols
[2021-05-09 06:41:44] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:41:44] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/214 places, 39/178 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-03-03 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s41 0) (EQ s49 1)), p0:(OR (EQ s2 0) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 367 steps with 73 reset in 7 ms.
FORMULA BusinessProcesses-PT-03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-03 finished in 432 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 214/214 places, 178/178 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 205 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 205 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 202 transition count 166
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 202 transition count 166
Applied a total of 24 rules in 16 ms. Remains 202 /214 variables (removed 12) and now considering 166/178 (removed 12) transitions.
// Phase 1: matrix 166 rows 202 cols
[2021-05-09 06:41:44] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:41:44] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 166 rows 202 cols
[2021-05-09 06:41:44] [INFO ] Computed 41 place invariants in 12 ms
[2021-05-09 06:41:44] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
// Phase 1: matrix 166 rows 202 cols
[2021-05-09 06:41:44] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:44] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Finished structural reductions, in 1 iterations. Remains : 202/214 places, 166/178 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s199 0) (NEQ s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-08 finished in 435 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(X(X(G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 214/214 places, 178/178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 206 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 206 transition count 170
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 203 transition count 167
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 203 transition count 167
Applied a total of 22 rules in 11 ms. Remains 203 /214 variables (removed 11) and now considering 167/178 (removed 11) transitions.
// Phase 1: matrix 167 rows 203 cols
[2021-05-09 06:41:44] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:44] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 167 rows 203 cols
[2021-05-09 06:41:44] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:45] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 167 rows 203 cols
[2021-05-09 06:41:45] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:45] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 203/214 places, 167/178 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-10 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: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p0:(OR (EQ s56 0) (EQ s33 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, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24447 steps with 287 reset in 116 ms.
FORMULA BusinessProcesses-PT-03-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-10 finished in 553 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||X(F(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 214/214 places, 178/178 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 208 transition count 172
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 207 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 207 transition count 171
Applied a total of 14 rules in 7 ms. Remains 207 /214 variables (removed 7) and now considering 171/178 (removed 7) transitions.
// Phase 1: matrix 171 rows 207 cols
[2021-05-09 06:41:45] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:41:45] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 171 rows 207 cols
[2021-05-09 06:41:45] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:41:45] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
// Phase 1: matrix 171 rows 207 cols
[2021-05-09 06:41:45] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:45] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 207/214 places, 171/178 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-03-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s120 1), p0:(AND (EQ s138 0) (EQ s183 1)), p2:(OR (EQ s194 0) (EQ s54 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]]
Product exploration explored 100000 steps with 50000 reset in 228 ms.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Graph (complete) has 436 edges and 207 vertex of which 206 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p1), (NOT p0), p2]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 207 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 207/207 places, 171/171 transitions.
Graph (trivial) has 100 edges and 207 vertex of which 6 / 207 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.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 202 transition count 165
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 39 Pre rules applied. Total rules applied 23 place count 202 transition count 244
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 62 place count 202 transition count 244
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 70 place count 194 transition count 215
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 78 place count 194 transition count 215
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 114 places in 1 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 139 place count 194 transition count 215
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 153 place count 180 transition count 201
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 167 place count 180 transition count 201
Deduced a syphon composed of 100 places in 1 ms
Applied a total of 167 rules in 44 ms. Remains 180 /207 variables (removed 27) and now considering 201/171 (removed -30) transitions.
[2021-05-09 06:41:47] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 201 rows 180 cols
[2021-05-09 06:41:47] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:41:47] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Finished structural reductions, in 1 iterations. Remains : 180/207 places, 201/171 transitions.
Product exploration explored 100000 steps with 50000 reset in 808 ms.
Product exploration explored 100000 steps with 50000 reset in 657 ms.
[2021-05-09 06:41:48] [INFO ] Flatten gal took : 10 ms
[2021-05-09 06:41:48] [INFO ] Flatten gal took : 9 ms
[2021-05-09 06:41:48] [INFO ] Time to serialize gal into /tmp/LTL7835925049487559433.gal : 6 ms
[2021-05-09 06:41:48] [INFO ] Time to serialize properties into /tmp/LTL15790701089095083713.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/LTL7835925049487559433.gal, -t, CGAL, -LTL, /tmp/LTL15790701089095083713.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/LTL7835925049487559433.gal -t CGAL -LTL /tmp/LTL15790701089095083713.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((p156==0)&&(p222==1))")U("(p134==1)"))||(X(F("((p251==0)||(p64==1))")))))
Formula 0 simplified : !(("((p156==0)&&(p222==1))" U "(p134==1)") | XF"((p251==0)||(p64==1))")
Reverse transition relation is NOT exact ! Due to transitions t8, t15, t17, t26, t33, t36, t39, t43, t47, t50, t53, t56, t60, t61, t63, t66, t69, t72, t75, t78, t80, t83, t86, t87, t90, t91, t94, t98, t102, t106, t107, t110, t111, t114, t115, t118, t122, t123, t126, t127, t129, t132, t134, t135, t168, t174, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/125/46/171
Computing Next relation with stutter on 18 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
601 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,6.03199,206760,1,0,380,705033,378,175,5760,640792,359
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-03-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-03-12 finished in 10157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 214/214 places, 178/178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 206 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 206 transition count 170
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 203 transition count 167
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 203 transition count 167
Applied a total of 22 rules in 8 ms. Remains 203 /214 variables (removed 11) and now considering 167/178 (removed 11) transitions.
// Phase 1: matrix 167 rows 203 cols
[2021-05-09 06:41:55] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:41:55] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 167 rows 203 cols
[2021-05-09 06:41:55] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:55] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
// Phase 1: matrix 167 rows 203 cols
[2021-05-09 06:41:55] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:55] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 1 iterations. Remains : 203/214 places, 167/178 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-13 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: 2}]], initial=3, aps=[p0:(AND (NEQ s59 0) (NEQ s138 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-03-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-13 finished in 393 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 214 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 214/214 places, 178/178 transitions.
Graph (trivial) has 111 edges and 214 vertex of which 6 / 214 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 208 transition count 143
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 180 transition count 143
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 57 place count 180 transition count 103
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 147 place count 130 transition count 103
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 153 place count 124 transition count 97
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 124 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 159 place count 124 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 162 place count 122 transition count 96
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 279 place count 63 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 280 place count 62 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 281 place count 61 transition count 37
Applied a total of 281 rules in 17 ms. Remains 61 /214 variables (removed 153) and now considering 37/178 (removed 141) transitions.
// Phase 1: matrix 37 rows 61 cols
[2021-05-09 06:41:56] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:41:56] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 37 rows 61 cols
[2021-05-09 06:41:56] [INFO ] Computed 28 place invariants in 5 ms
[2021-05-09 06:41:56] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 39, 40, 42, 44]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 92 ms to find 28 implicit places.
[2021-05-09 06:41:56] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 37 rows 33 cols
[2021-05-09 06:41:56] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 06:41:56] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 33/214 places, 37/178 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 33 transition count 30
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 26 transition count 30
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 23 transition count 27
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 23 transition count 27
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 23 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 21 transition count 25
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 25 place count 20 transition count 24
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 20 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 32 place count 17 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 17 transition count 20
Applied a total of 33 rules in 6 ms. Remains 17 /33 variables (removed 16) and now considering 20/37 (removed 17) transitions.
// Phase 1: matrix 20 rows 17 cols
[2021-05-09 06:41:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 06:41:56] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 20 rows 17 cols
[2021-05-09 06:41:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 06:41:56] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 17/214 places, 20/178 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s14 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 159 steps with 42 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-14 finished in 209 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620542516393

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

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