Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500427.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 7.5K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 156K May 10 09:33 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-14-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652633540694

Running Version 202205111006
[2022-05-15 16:52:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 16:52:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:52:22] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2022-05-15 16:52:22] [INFO ] Transformed 624 places.
[2022-05-15 16:52:22] [INFO ] Transformed 564 transitions.
[2022-05-15 16:52:22] [INFO ] Found NUPN structural information;
[2022-05-15 16:52:22] [INFO ] Parsed PT model containing 624 places and 564 transitions in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-14-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-14-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 98 place count 518 transition count 463
Iterating global reduction 1 with 93 rules applied. Total rules applied 191 place count 518 transition count 463
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 238 place count 471 transition count 416
Iterating global reduction 1 with 47 rules applied. Total rules applied 285 place count 471 transition count 416
Applied a total of 285 rules in 115 ms. Remains 471 /616 variables (removed 145) and now considering 416/556 (removed 140) transitions.
// Phase 1: matrix 416 rows 471 cols
[2022-05-15 16:52:22] [INFO ] Computed 94 place invariants in 43 ms
[2022-05-15 16:52:22] [INFO ] Implicit Places using invariants in 508 ms returned []
// Phase 1: matrix 416 rows 471 cols
[2022-05-15 16:52:22] [INFO ] Computed 94 place invariants in 17 ms
[2022-05-15 16:52:23] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
// Phase 1: matrix 416 rows 471 cols
[2022-05-15 16:52:23] [INFO ] Computed 94 place invariants in 13 ms
[2022-05-15 16:52:23] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/616 places, 416/556 transitions.
Finished structural reductions, in 1 iterations. Remains : 471/616 places, 416/556 transitions.
Support contains 19 out of 471 places after structural reductions.
[2022-05-15 16:52:24] [INFO ] Flatten gal took : 61 ms
[2022-05-15 16:52:24] [INFO ] Flatten gal took : 29 ms
[2022-05-15 16:52:24] [INFO ] Input system was already deterministic with 416 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 416 rows 471 cols
[2022-05-15 16:52:24] [INFO ] Computed 94 place invariants in 7 ms
[2022-05-15 16:52:24] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 16:52:25] [INFO ] [Nat]Absence check using 55 positive place invariants in 24 ms returned sat
[2022-05-15 16:52:25] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 11 ms returned sat
[2022-05-15 16:52:25] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 16:52:25] [INFO ] Deduced a trap composed of 14 places in 568 ms of which 4 ms to minimize.
[2022-05-15 16:52:26] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2022-05-15 16:52:26] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2022-05-15 16:52:26] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2022-05-15 16:52:26] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2022-05-15 16:52:26] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2022-05-15 16:52:26] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2022-05-15 16:52:26] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2022-05-15 16:52:26] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2022-05-15 16:52:26] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2022-05-15 16:52:26] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2022-05-15 16:52:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1469 ms
[2022-05-15 16:52:26] [INFO ] After 1867ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-05-15 16:52:27] [INFO ] After 2138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 71 ms.
Support contains 9 out of 471 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 471/471 places, 416/416 transitions.
Graph (trivial) has 213 edges and 471 vertex of which 6 / 471 are part of one of the 1 SCC in 9 ms
Free SCC test removed 5 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 466 transition count 363
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 420 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 419 transition count 362
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 95 place count 419 transition count 266
Deduced a syphon composed of 96 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 302 place count 308 transition count 266
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 305 place count 305 transition count 263
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 309 place count 304 transition count 263
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 559 place count 177 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 561 place count 176 transition count 144
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 563 place count 176 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 565 place count 174 transition count 142
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 570 place count 174 transition count 142
Applied a total of 570 rules in 98 ms. Remains 174 /471 variables (removed 297) and now considering 142/416 (removed 274) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/471 places, 142/416 transitions.
Incomplete random walk after 10000 steps, including 375 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :3
Finished Best-First random walk after 90 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=90 )
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1076 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 416/416 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 466 transition count 411
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 466 transition count 411
Applied a total of 10 rules in 39 ms. Remains 466 /471 variables (removed 5) and now considering 411/416 (removed 5) transitions.
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:52:27] [INFO ] Computed 94 place invariants in 2 ms
[2022-05-15 16:52:27] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:52:27] [INFO ] Computed 94 place invariants in 2 ms
[2022-05-15 16:52:28] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:52:28] [INFO ] Computed 94 place invariants in 4 ms
[2022-05-15 16:52:28] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 466/471 places, 411/416 transitions.
Finished structural reductions, in 1 iterations. Remains : 466/471 places, 411/416 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s88 0) (EQ s433 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 412 ms.
Product exploration explored 100000 steps with 50000 reset in 387 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1067 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-14-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLCardinality-01 finished in 2032 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&p1))||X(X(p0))))'
Support contains 3 out of 471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 416/416 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 466 transition count 411
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 466 transition count 411
Applied a total of 10 rules in 29 ms. Remains 466 /471 variables (removed 5) and now considering 411/416 (removed 5) transitions.
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:52:29] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:52:29] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:52:29] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:52:30] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:52:30] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:52:30] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 466/471 places, 411/416 transitions.
Finished structural reductions, in 1 iterations. Remains : 466/471 places, 411/416 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s21 0) (EQ s353 1)), p1:(EQ s238 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 349 ms.
Product exploration explored 100000 steps with 33333 reset in 300 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1067 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Detected a total of 123/466 stabilizing places and 116/411 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-14-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLCardinality-03 finished in 1908 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 416/416 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 466 transition count 411
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 466 transition count 411
Applied a total of 10 rules in 35 ms. Remains 466 /471 variables (removed 5) and now considering 411/416 (removed 5) transitions.
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:52:31] [INFO ] Computed 94 place invariants in 16 ms
[2022-05-15 16:52:31] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:52:31] [INFO ] Computed 94 place invariants in 2 ms
[2022-05-15 16:52:32] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
// Phase 1: matrix 411 rows 466 cols
[2022-05-15 16:52:32] [INFO ] Computed 94 place invariants in 4 ms
[2022-05-15 16:52:32] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 466/471 places, 411/416 transitions.
Finished structural reductions, in 1 iterations. Remains : 466/471 places, 411/416 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-04 automaton TGBA Formula[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:(EQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 1 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-04 finished in 1301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||G(F(p1)))))'
Support contains 3 out of 471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 471/471 places, 416/416 transitions.
Graph (trivial) has 218 edges and 471 vertex of which 6 / 471 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 465 transition count 361
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 417 transition count 361
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 97 place count 417 transition count 262
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 311 place count 302 transition count 262
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 316 place count 297 transition count 257
Ensure Unique test removed 1 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 322 place count 296 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 322 place count 296 transition count 256
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 324 place count 295 transition count 256
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 574 place count 168 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 576 place count 167 transition count 137
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 582 place count 167 transition count 137
Applied a total of 582 rules in 71 ms. Remains 167 /471 variables (removed 304) and now considering 137/416 (removed 279) transitions.
// Phase 1: matrix 137 rows 167 cols
[2022-05-15 16:52:32] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 16:52:32] [INFO ] Implicit Places using invariants in 212 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 226 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/471 places, 137/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 146 /146 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 146/471 places, 137/416 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s108 0) (EQ s33 1)), p1:(AND (EQ s13 1) (EQ s108 0) (EQ s33 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 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-06 finished in 476 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(((F(p1) U p1)&&X(p2)))))'
Support contains 6 out of 471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 416/416 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 469 transition count 414
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 469 transition count 414
Applied a total of 4 rules in 35 ms. Remains 469 /471 variables (removed 2) and now considering 414/416 (removed 2) transitions.
// Phase 1: matrix 414 rows 469 cols
[2022-05-15 16:52:33] [INFO ] Computed 94 place invariants in 2 ms
[2022-05-15 16:52:33] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 414 rows 469 cols
[2022-05-15 16:52:33] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:52:34] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
// Phase 1: matrix 414 rows 469 cols
[2022-05-15 16:52:34] [INFO ] Computed 94 place invariants in 3 ms
[2022-05-15 16:52:34] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 469/471 places, 414/416 transitions.
Finished structural reductions, in 1 iterations. Remains : 469/471 places, 414/416 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), true, (NOT p2), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s419 0) (EQ s466 1)), p1:(OR (EQ s351 0) (EQ s396 1)), p2:(OR (EQ s150 0) (EQ s347 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 310 ms.
Product exploration explored 100000 steps with 33333 reset in 326 ms.
Computed a total of 124 stabilizing places and 117 stable transitions
Graph (complete) has 1072 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 124 stabilizing places and 117 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 8 factoid took 514 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-14-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLCardinality-08 finished in 2558 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 471/471 places, 416/416 transitions.
Graph (trivial) has 217 edges and 471 vertex of which 6 / 471 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.
Graph (complete) has 1070 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 464 transition count 360
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 416 transition count 360
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 98 place count 416 transition count 262
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 311 place count 301 transition count 262
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 314 place count 298 transition count 259
Iterating global reduction 2 with 3 rules applied. Total rules applied 317 place count 298 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 317 place count 298 transition count 258
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 319 place count 297 transition count 258
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 574 place count 168 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 576 place count 167 transition count 136
Applied a total of 576 rules in 54 ms. Remains 167 /471 variables (removed 304) and now considering 136/416 (removed 280) transitions.
// Phase 1: matrix 136 rows 167 cols
[2022-05-15 16:52:35] [INFO ] Computed 74 place invariants in 1 ms
[2022-05-15 16:52:35] [INFO ] Implicit Places using invariants in 150 ms returned [1, 2, 3, 4, 5, 6, 9, 10, 17, 18, 22, 23, 24, 25, 26, 27, 50, 51, 52, 53, 54, 126]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 154 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/471 places, 136/416 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 145/471 places, 136/416 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s2 0) (NEQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-09 finished in 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||p1)))'
Support contains 3 out of 471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 471/471 places, 416/416 transitions.
Graph (trivial) has 216 edges and 471 vertex of which 6 / 471 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.
Graph (complete) has 1070 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 464 transition count 362
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 418 transition count 362
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 94 place count 418 transition count 260
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 315 place count 299 transition count 260
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 320 place count 294 transition count 255
Ensure Unique test removed 1 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 326 place count 293 transition count 255
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 570 place count 169 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 572 place count 168 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 573 place count 167 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 574 place count 166 transition count 138
Applied a total of 574 rules in 50 ms. Remains 166 /471 variables (removed 305) and now considering 138/416 (removed 278) transitions.
// Phase 1: matrix 138 rows 166 cols
[2022-05-15 16:52:36] [INFO ] Computed 71 place invariants in 1 ms
[2022-05-15 16:52:36] [INFO ] Implicit Places using invariants in 191 ms returned [27, 50, 51, 52, 53]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 193 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/471 places, 138/416 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 161/471 places, 138/416 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-14 automaton TGBA Formula[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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(OR (EQ s102 0) (EQ s2 1)), p1:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-14 finished in 377 ms.
All properties solved by simple procedures.
Total runtime 14537 ms.

BK_STOP 1652633556610

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-14"
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-14, 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 r024-tall-165251918500427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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