Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r137-smll-167819418300395.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DiscoveryGPU-PT-13a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418300395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 13:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 46K Mar 5 18:22 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-13a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678823263194

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 19:47:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 19:47:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 19:47:46] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-14 19:47:46] [INFO ] Transformed 133 places.
[2023-03-14 19:47:46] [INFO ] Transformed 183 transitions.
[2023-03-14 19:47:46] [INFO ] Found NUPN structural information;
[2023-03-14 19:47:46] [INFO ] Parsed PT model containing 133 places and 183 transitions and 588 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 183/183 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 122 transition count 172
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 122 transition count 172
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 112 transition count 162
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 112 transition count 162
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 104 transition count 146
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 104 transition count 146
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 63 place count 104 transition count 141
Applied a total of 63 rules in 55 ms. Remains 104 /133 variables (removed 29) and now considering 141/183 (removed 42) transitions.
// Phase 1: matrix 141 rows 104 cols
[2023-03-14 19:47:46] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-14 19:47:46] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-14 19:47:46] [INFO ] Invariant cache hit.
[2023-03-14 19:47:46] [INFO ] State equation strengthened by 94 read => feed constraints.
[2023-03-14 19:47:47] [INFO ] Implicit Places using invariants and state equation in 230 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 533 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/133 places, 141/183 transitions.
Applied a total of 0 rules in 11 ms. Remains 103 /103 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 600 ms. Remains : 103/133 places, 141/183 transitions.
Support contains 19 out of 103 places after structural reductions.
[2023-03-14 19:47:47] [INFO ] Flatten gal took : 46 ms
[2023-03-14 19:47:47] [INFO ] Flatten gal took : 20 ms
[2023-03-14 19:47:47] [INFO ] Input system was already deterministic with 141 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 141 rows 103 cols
[2023-03-14 19:47:47] [INFO ] Computed 1 place invariants in 9 ms
[2023-03-14 19:47:47] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 19:47:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-14 19:47:48] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 5 simplifications.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 15 stabilizing places and 14 stable transitions
Graph (complete) has 275 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((X(p1)||p0))||X(p2)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 99 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 99 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 97 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 97 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 96 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 96 transition count 134
Applied a total of 14 rules in 17 ms. Remains 96 /103 variables (removed 7) and now considering 134/141 (removed 7) transitions.
// Phase 1: matrix 134 rows 96 cols
[2023-03-14 19:47:48] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-14 19:47:48] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-14 19:47:48] [INFO ] Invariant cache hit.
[2023-03-14 19:47:48] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 19:47:48] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-14 19:47:48] [INFO ] Invariant cache hit.
[2023-03-14 19:47:48] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/103 places, 134/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 96/103 places, 134/141 transitions.
Stuttering acceptance computed with spot in 377 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p0:(OR (EQ s66 0) (EQ s10 1)), p1:(OR (EQ s66 0) (EQ s10 1)), p2:(OR (EQ s5 0) (EQ s30 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32523 reset in 487 ms.
Product exploration explored 100000 steps with 32504 reset in 362 ms.
Computed a total of 15 stabilizing places and 14 stable transitions
Graph (complete) has 266 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 14 stable transitions
Detected a total of 15/96 stabilizing places and 14/134 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 228 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :2
Finished Best-First random walk after 775 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=387 )
Knowledge obtained : [(AND p0 p1 p2), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 253 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2023-03-14 19:47:51] [INFO ] Invariant cache hit.
[2023-03-14 19:47:51] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-14 19:47:51] [INFO ] Invariant cache hit.
[2023-03-14 19:47:51] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 19:47:51] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-14 19:47:51] [INFO ] Invariant cache hit.
[2023-03-14 19:47:51] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 96/96 places, 134/134 transitions.
Computed a total of 15 stabilizing places and 14 stable transitions
Graph (complete) has 266 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 14 stable transitions
Detected a total of 15/96 stabilizing places and 14/134 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 3089 steps, including 21 resets, run visited all 3 properties in 16 ms. (steps per millisecond=193 )
Knowledge obtained : [(AND p0 p1 p2), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 32483 reset in 233 ms.
Product exploration explored 100000 steps with 32508 reset in 282 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 134/134 transitions.
Graph (complete) has 266 edges and 96 vertex of which 95 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
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 95 transition count 133
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 133
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 26 place count 95 transition count 157
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 84 transition count 135
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 84 transition count 135
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 70 place count 62 transition count 91
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 22 rules applied. Total rules applied 92 place count 62 transition count 91
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 103 place count 51 transition count 80
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 114 place count 51 transition count 80
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 124 place count 41 transition count 60
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 134 place count 41 transition count 60
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 153 place count 22 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 19 rules applied. Total rules applied 172 place count 22 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 172 rules in 43 ms. Remains 22 /96 variables (removed 74) and now considering 31/134 (removed 103) transitions.
[2023-03-14 19:47:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 19:47:53] [INFO ] Flow matrix only has 29 transitions (discarded 2 similar events)
// Phase 1: matrix 29 rows 22 cols
[2023-03-14 19:47:53] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 19:47:53] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/96 places, 31/134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 22/96 places, 31/134 transitions.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 134/134 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 96 cols
[2023-03-14 19:47:53] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 19:47:53] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-14 19:47:53] [INFO ] Invariant cache hit.
[2023-03-14 19:47:53] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 19:47:54] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-14 19:47:54] [INFO ] Invariant cache hit.
[2023-03-14 19:47:54] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 96/96 places, 134/134 transitions.
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-01 finished in 5930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Graph (complete) has 275 edges and 103 vertex of which 101 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 122 edges and 99 vertex of which 92 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Graph (trivial) has 101 edges and 92 vertex of which 50 / 92 are part of one of the 25 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 67 transition count 118
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 55 place count 54 transition count 93
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 66 place count 43 transition count 71
Iterating global reduction 2 with 11 rules applied. Total rules applied 77 place count 43 transition count 71
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 87 place count 33 transition count 51
Iterating global reduction 2 with 10 rules applied. Total rules applied 97 place count 33 transition count 51
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 107 place count 23 transition count 31
Iterating global reduction 2 with 10 rules applied. Total rules applied 117 place count 23 transition count 31
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 127 place count 13 transition count 21
Iterating global reduction 2 with 10 rules applied. Total rules applied 137 place count 13 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 11 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 11 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 8 transition count 15
Applied a total of 145 rules in 21 ms. Remains 8 /103 variables (removed 95) and now considering 15/141 (removed 126) transitions.
[2023-03-14 19:47:54] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 8 cols
[2023-03-14 19:47:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-14 19:47:54] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-14 19:47:54] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2023-03-14 19:47:54] [INFO ] Invariant cache hit.
[2023-03-14 19:47:54] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-14 19:47:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 19:47:54] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2023-03-14 19:47:54] [INFO ] Invariant cache hit.
[2023-03-14 19:47:54] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/103 places, 15/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 8/103 places, 15/141 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-09 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 s6 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 7 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-09 finished in 192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Graph (complete) has 275 edges and 103 vertex of which 101 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 122 edges and 99 vertex of which 91 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Graph (trivial) has 99 edges and 91 vertex of which 50 / 91 are part of one of the 25 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 66 transition count 118
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 53 place count 54 transition count 93
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 65 place count 42 transition count 69
Iterating global reduction 2 with 12 rules applied. Total rules applied 77 place count 42 transition count 69
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 87 place count 32 transition count 49
Iterating global reduction 2 with 10 rules applied. Total rules applied 97 place count 32 transition count 49
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 107 place count 22 transition count 29
Iterating global reduction 2 with 10 rules applied. Total rules applied 117 place count 22 transition count 29
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 127 place count 12 transition count 19
Iterating global reduction 2 with 10 rules applied. Total rules applied 137 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 11 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 11 transition count 16
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 8 transition count 13
Applied a total of 144 rules in 15 ms. Remains 8 /103 variables (removed 95) and now considering 13/141 (removed 128) transitions.
[2023-03-14 19:47:54] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2023-03-14 19:47:54] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-14 19:47:54] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-14 19:47:54] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2023-03-14 19:47:54] [INFO ] Invariant cache hit.
[2023-03-14 19:47:54] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-14 19:47:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 19:47:54] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2023-03-14 19:47:54] [INFO ] Invariant cache hit.
[2023-03-14 19:47:54] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/103 places, 13/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 8/103 places, 13/141 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-11 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 s1 0) (EQ s5 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 50 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-11 finished in 190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 100 transition count 138
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 100 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 99 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 99 transition count 137
Applied a total of 8 rules in 4 ms. Remains 99 /103 variables (removed 4) and now considering 137/141 (removed 4) transitions.
// Phase 1: matrix 137 rows 99 cols
[2023-03-14 19:47:54] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 19:47:54] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-14 19:47:54] [INFO ] Invariant cache hit.
[2023-03-14 19:47:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 19:47:54] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-14 19:47:54] [INFO ] Invariant cache hit.
[2023-03-14 19:47:54] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/103 places, 137/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 99/103 places, 137/141 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s14 0) (NEQ s7 1)), p1:(EQ s11 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-13 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((X(p1)||p0))||X(p2)))))'
[2023-03-14 19:47:55] [INFO ] Flatten gal took : 30 ms
[2023-03-14 19:47:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-14 19:47:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 103 places, 141 transitions and 416 arcs took 3 ms.
Total runtime 9136 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/842/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DiscoveryGPU-PT-13a-LTLCardinality-01

BK_STOP 1678823276654

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name DiscoveryGPU-PT-13a-LTLCardinality-01
ltl formula formula --ltl=/tmp/842/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 103 places, 141 transitions and 416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/842/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/842/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/842/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/842/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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-13a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DiscoveryGPU-PT-13a, 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 r137-smll-167819418300395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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