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.r078-tall-165260109700019.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 DiscoveryGPU-PT-07a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109700019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.3K Apr 30 07:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 07:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 30 06:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 30 06:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 25K 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 DiscoveryGPU-PT-07a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652628850743

Running Version 202205111006
[2022-05-15 15:34:11] [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 15:34:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:34:12] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2022-05-15 15:34:12] [INFO ] Transformed 73 places.
[2022-05-15 15:34:12] [INFO ] Transformed 99 transitions.
[2022-05-15 15:34:12] [INFO ] Found NUPN structural information;
[2022-05-15 15:34:12] [INFO ] Parsed PT model containing 73 places and 99 transitions in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 99/99 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 68 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 68 transition count 94
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 63 transition count 89
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 63 transition count 89
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 60 transition count 83
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 60 transition count 83
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 60 transition count 79
Applied a total of 30 rules in 32 ms. Remains 60 /73 variables (removed 13) and now considering 79/99 (removed 20) transitions.
// Phase 1: matrix 79 rows 60 cols
[2022-05-15 15:34:12] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 15:34:12] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 79 rows 60 cols
[2022-05-15 15:34:12] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 15:34:12] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-15 15:34:12] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 290 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/73 places, 79/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 59/73 places, 79/99 transitions.
Support contains 16 out of 59 places after structural reductions.
[2022-05-15 15:34:12] [INFO ] Flatten gal took : 24 ms
[2022-05-15 15:34:12] [INFO ] Flatten gal took : 10 ms
[2022-05-15 15:34:12] [INFO ] Input system was already deterministic with 79 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 59 cols
[2022-05-15 15:34:12] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-15 15:34:12] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 15:34:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2022-05-15 15:34:12] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 152 edges and 59 vertex of which 57 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G(p0)))))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Graph (complete) has 152 edges and 59 vertex of which 57 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 57 transition count 74
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 54 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 53 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 53 transition count 73
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 37 place count 39 transition count 59
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 43 place count 33 transition count 47
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 33 transition count 47
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 27 transition count 35
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 27 transition count 35
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 21 transition count 29
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 21 transition count 29
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 78 place count 16 transition count 19
Iterating global reduction 2 with 5 rules applied. Total rules applied 83 place count 16 transition count 19
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 87 place count 12 transition count 15
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 12 transition count 15
Applied a total of 91 rules in 34 ms. Remains 12 /59 variables (removed 47) and now considering 15/79 (removed 64) transitions.
[2022-05-15 15:34:13] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 12 cols
[2022-05-15 15:34:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:34:13] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-15 15:34:13] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 12 cols
[2022-05-15 15:34:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:34:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-15 15:34:13] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2022-05-15 15:34:13] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:34:13] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 12 cols
[2022-05-15 15:34:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:34:13] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/59 places, 15/79 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/59 places, 15/79 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s10 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 54 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-01 finished in 361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(p0))))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Graph (complete) has 152 edges and 59 vertex of which 57 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 67 edges and 55 vertex of which 49 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Graph (trivial) has 52 edges and 49 vertex of which 28 / 49 are part of one of the 14 SCC in 6 ms
Free SCC test removed 14 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 35 transition count 65
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 28 place count 30 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 34 place count 24 transition count 39
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 24 transition count 39
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 20 transition count 31
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 20 transition count 31
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 16 transition count 23
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 16 transition count 23
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 12 transition count 19
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 12 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 11 transition count 18
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 11 transition count 15
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 8 transition count 12
Applied a total of 72 rules in 23 ms. Remains 8 /59 variables (removed 51) and now considering 12/79 (removed 67) transitions.
[2022-05-15 15:34:13] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 8 cols
[2022-05-15 15:34:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:13] [INFO ] Implicit Places using invariants in 14 ms returned []
[2022-05-15 15:34:13] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 8 cols
[2022-05-15 15:34:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:34:13] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-15 15:34:13] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:34:13] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 8 cols
[2022-05-15 15:34:13] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-15 15:34:13] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/59 places, 12/79 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/59 places, 12/79 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-03 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 s1 0) (NEQ s4 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 DiscoveryGPU-PT-07a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-03 finished in 161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(((X(p0) U p0)||p1)))))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 57 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 57 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 56 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 56 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 55 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 55 transition count 75
Applied a total of 8 rules in 9 ms. Remains 55 /59 variables (removed 4) and now considering 75/79 (removed 4) transitions.
// Phase 1: matrix 75 rows 55 cols
[2022-05-15 15:34:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:34:13] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 75 rows 55 cols
[2022-05-15 15:34:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:34:13] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-15 15:34:13] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 75 rows 55 cols
[2022-05-15 15:34:13] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 15:34:13] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/59 places, 75/79 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/59 places, 75/79 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s7 1), p1:(EQ s11 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, null][false, false, false]]
Product exploration explored 100000 steps with 3172 reset in 233 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-07 finished in 552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(X(p0)))||G(X(G(X(G(X(p0))))))))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Graph (complete) has 152 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 68 edges and 56 vertex of which 52 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Graph (trivial) has 56 edges and 52 vertex of which 28 / 52 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
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 10 rules applied. Total rules applied 11 place count 38 transition count 66
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 32 place count 31 transition count 52
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 26 transition count 42
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 26 transition count 42
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 21 transition count 32
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 21 transition count 32
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 17 transition count 24
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 17 transition count 24
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 13 transition count 20
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 13 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 12 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 72 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 8 transition count 14
Applied a total of 77 rules in 30 ms. Remains 8 /59 variables (removed 51) and now considering 14/79 (removed 65) transitions.
[2022-05-15 15:34:14] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 15:34:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:14] [INFO ] Implicit Places using invariants in 15 ms returned []
[2022-05-15 15:34:14] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 15:34:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:14] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-15 15:34:14] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 15:34:14] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 15:34:14] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:34:14] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/59 places, 14/79 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/59 places, 14/79 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-08 automaton TGBA Formula[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:(OR (EQ s2 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-08 finished in 254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Graph (complete) has 152 edges and 59 vertex of which 57 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 67 edges and 55 vertex of which 49 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Graph (trivial) has 53 edges and 49 vertex of which 26 / 49 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 36 transition count 64
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 30 place count 30 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 29 transition count 50
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 37 place count 23 transition count 38
Iterating global reduction 3 with 6 rules applied. Total rules applied 43 place count 23 transition count 38
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 49 place count 17 transition count 26
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 17 transition count 26
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 60 place count 12 transition count 16
Iterating global reduction 3 with 5 rules applied. Total rules applied 65 place count 12 transition count 16
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 70 place count 7 transition count 11
Iterating global reduction 3 with 5 rules applied. Total rules applied 75 place count 7 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 77 place count 6 transition count 11
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 4 transition count 7
Applied a total of 81 rules in 12 ms. Remains 4 /59 variables (removed 55) and now considering 7/79 (removed 72) transitions.
[2022-05-15 15:34:14] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 15:34:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:14] [INFO ] Implicit Places using invariants in 16 ms returned []
[2022-05-15 15:34:14] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 15:34:14] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-15 15:34:14] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-15 15:34:14] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:34:14] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 15:34:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:14] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/59 places, 7/79 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/59 places, 7/79 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s2 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 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-10 finished in 119 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!(!p0 U !X(p1))&&X(F(p2))))))'
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 56 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 56 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 55 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 55 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 54 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 54 transition count 74
Applied a total of 10 rules in 10 ms. Remains 54 /59 variables (removed 5) and now considering 74/79 (removed 5) transitions.
// Phase 1: matrix 74 rows 54 cols
[2022-05-15 15:34:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:34:14] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 74 rows 54 cols
[2022-05-15 15:34:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:34:14] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-15 15:34:14] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 54 cols
[2022-05-15 15:34:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:34:14] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/59 places, 74/79 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/59 places, 74/79 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p2), true]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s27 0) (EQ s51 1)), p1:(EQ s29 1), p2:(OR (EQ s29 1) (EQ s45 0) (EQ s21 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-11 finished in 532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)||F(p0))))))'
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 79/79 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 57 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 57 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 56 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 56 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 55 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 55 transition count 75
Applied a total of 8 rules in 5 ms. Remains 55 /59 variables (removed 4) and now considering 75/79 (removed 4) transitions.
// Phase 1: matrix 75 rows 55 cols
[2022-05-15 15:34:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:34:15] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 75 rows 55 cols
[2022-05-15 15:34:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:34:15] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-15 15:34:15] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 75 rows 55 cols
[2022-05-15 15:34:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:34:15] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/59 places, 75/79 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/59 places, 75/79 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s39 0) (EQ s4 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 186 ms.
Product exploration explored 100000 steps with 33333 reset in 166 ms.
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 147 edges and 55 vertex of which 54 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-12 finished in 680 ms.
All properties solved by simple procedures.
Total runtime 3897 ms.

BK_STOP 1652628855868

--------------------
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="DiscoveryGPU-PT-07a"
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 DiscoveryGPU-PT-07a, 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 r078-tall-165260109700019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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