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.r487-tall-167912704301315.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 lolaxred
Input is ViralEpidemic-PT-S04D1C1A06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912704301315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 8.9K Feb 25 21:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 21:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 21:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 23:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 23:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 22:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 20M Mar 5 18:23 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 ViralEpidemic-PT-S04D1C1A06-LTLCardinality-00
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-05
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-08
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-09
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-10
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-11
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-12
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-13
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-14
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679254532157

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S04D1C1A06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 19:35:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 19:35:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:35:34] [INFO ] Load time of PNML (sax parser for PT used): 924 ms
[2023-03-19 19:35:34] [INFO ] Transformed 32767 places.
[2023-03-19 19:35:34] [INFO ] Transformed 49149 transitions.
[2023-03-19 19:35:34] [INFO ] Parsed PT model containing 32767 places and 49149 transitions and 114681 arcs in 1178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2071 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:35:46] [INFO ] Invariants computation overflowed in 9425 ms
[2023-03-19 19:35:49] [INFO ] Implicit Places using invariants in 12480 ms returned []
Implicit Place search using SMT only with invariants took 12506 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:35:59] [INFO ] Invariants computation overflowed in 9438 ms
[2023-03-19 19:36:01] [INFO ] Dead Transitions using invariants and state equation in 11991 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26580 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Support contains 47 out of 32767 places after structural reductions.
[2023-03-19 19:36:03] [INFO ] Flatten gal took : 1687 ms
[2023-03-19 19:36:05] [INFO ] Flatten gal took : 1314 ms
[2023-03-19 19:36:07] [INFO ] Input system was already deterministic with 49149 transitions.
Support contains 43 out of 32767 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 2553 ms. (steps per millisecond=3 ) properties (out of 24) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=5 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=5 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=6 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=5 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=6 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=6 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=5 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=5 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=6 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=6 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=6 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=5 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=6 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=5 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=4 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=6 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=6 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:36:21] [INFO ] Invariants computation overflowed in 8031 ms
[2023-03-19 19:36:35] [INFO ] After 13910ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-19 19:37:00] [INFO ] After 7933ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-19 19:37:00] [INFO ] After 7989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-19 19:37:00] [INFO ] After 25100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 28 out of 32767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 222 are kept as prefixes of interest. Removing 32545 places using SCC suffix rule.38 ms
Discarding 32545 places :
Also discarding 48584 output transitions
Drop transitions removed 48584 transitions
Drop transitions removed 369 transitions
Reduce isomorphic transitions removed 369 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 426 rules applied. Total rules applied 427 place count 222 transition count 139
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 485 place count 165 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 486 place count 164 transition count 138
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 486 place count 164 transition count 124
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 514 place count 150 transition count 124
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 566 place count 98 transition count 72
Iterating global reduction 3 with 52 rules applied. Total rules applied 618 place count 98 transition count 72
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 670 place count 72 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 671 place count 71 transition count 45
Ensure Unique test removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 682 place count 60 transition count 45
Applied a total of 682 rules in 171 ms. Remains 60 /32767 variables (removed 32707) and now considering 45/49149 (removed 49104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 60/32767 places, 45/49149 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 17) seen :9
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 45 rows 60 cols
[2023-03-19 19:37:01] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-19 19:37:01] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-19 19:37:01] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 19:37:01] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-19 19:37:01] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(G((G(p0)||G(p1)||(p1&&F(p2))))))'
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2081 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:37:11] [INFO ] Invariants computation overflowed in 7953 ms
[2023-03-19 19:37:14] [INFO ] Implicit Places using invariants in 10707 ms returned []
Implicit Place search using SMT only with invariants took 10713 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:37:22] [INFO ] Invariants computation overflowed in 8039 ms
[2023-03-19 19:37:25] [INFO ] Dead Transitions using invariants and state equation in 10783 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23586 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 349 ms :[true, (AND (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GT 1 s9866), p2:(GT s20492 s26402), p1:(GT s636 s27955)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38829 steps with 62 reset in 7361 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-00 finished in 31465 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(p0)||F(p1)))'
Support contains 4 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1561 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:37:42] [INFO ] Invariants computation overflowed in 8264 ms
[2023-03-19 19:37:45] [INFO ] Implicit Places using invariants in 10736 ms returned []
Implicit Place search using SMT only with invariants took 10738 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:37:53] [INFO ] Invariants computation overflowed in 8410 ms
[2023-03-19 19:37:56] [INFO ] Dead Transitions using invariants and state equation in 11161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23470 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GT s30573 s9840), p0:(LEQ s13072 s18620)], 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 timeout after 26760 steps with 13380 reset in 10002 ms.
Product exploration timeout after 24960 steps with 12480 reset in 10001 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03 finished in 246054 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((G(p0)||G(!p0))))'
Support contains 2 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 60 are kept as prefixes of interest. Removing 32707 places using SCC suffix rule.52 ms
Discarding 32707 places :
Also discarding 49025 output transitions
Drop transitions removed 49025 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 59 transition count 113
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 32 place count 38 transition count 56
Iterating global reduction 1 with 21 rules applied. Total rules applied 53 place count 38 transition count 56
Graph (complete) has 23 edges and 38 vertex of which 37 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
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 37 transition count 55
Applied a total of 54 rules in 107 ms. Remains 37 /32767 variables (removed 32730) and now considering 55/49149 (removed 49094) transitions.
// Phase 1: matrix 55 rows 37 cols
[2023-03-19 19:41:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 19:41:39] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-19 19:41:39] [INFO ] Invariant cache hit.
[2023-03-19 19:41:39] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-19 19:41:39] [INFO ] Redundant transitions in 27 ms returned [12, 19, 22, 24, 27, 30, 34, 38, 42]
Found 9 redundant transitions using SMT.
Drop transitions removed 9 transitions
Redundant transitions reduction (with SMT) removed 9 transitions.
// Phase 1: matrix 46 rows 37 cols
[2023-03-19 19:41:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 19:41:39] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/32767 places, 46/49149 transitions.
Graph (complete) has 22 edges and 37 vertex of which 28 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Applied a total of 1 rules in 1 ms. Remains 28 /37 variables (removed 9) and now considering 37/46 (removed 9) transitions.
// Phase 1: matrix 37 rows 28 cols
[2023-03-19 19:41:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 19:41:39] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 19:41:39] [INFO ] Invariant cache hit.
[2023-03-19 19:41:39] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/32767 places, 37/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 420 ms. Remains : 28/32767 places, 37/49149 transitions.
Stuttering acceptance computed with spot in 46 ms :[false]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(GT s24 s12)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4224 reset in 245 ms.
Product exploration explored 100000 steps with 4222 reset in 152 ms.
Computed a total of 28 stabilizing places and 37 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 28 transition count 37
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04 finished in 1037 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(F(p0)))'
Support contains 2 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1772 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:41:50] [INFO ] Invariants computation overflowed in 8498 ms
[2023-03-19 19:41:53] [INFO ] Implicit Places using invariants in 11056 ms returned []
Implicit Place search using SMT only with invariants took 11057 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:42:01] [INFO ] Invariants computation overflowed in 8855 ms
[2023-03-19 19:42:04] [INFO ] Dead Transitions using invariants and state equation in 11259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24103 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s12697 s19361)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 27940 steps with 13970 reset in 10002 ms.
Product exploration timeout after 24870 steps with 12435 reset in 10002 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06 finished in 277133 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(G((p0||F(p1)))))'
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1569 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:46:30] [INFO ] Invariants computation overflowed in 11923 ms
[2023-03-19 19:46:33] [INFO ] Implicit Places using invariants in 14625 ms returned []
Implicit Place search using SMT only with invariants took 14626 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:46:50] [INFO ] Invariants computation overflowed in 16557 ms
[2023-03-19 19:46:52] [INFO ] Dead Transitions using invariants and state equation in 18948 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35158 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s11757 s11994), p1:(OR (LEQ s18546 s8484) (LEQ 2 s18166))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 56150 steps with 88 reset in 10002 ms.
Product exploration timeout after 43140 steps with 68 reset in 10002 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 293 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1935 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1536 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1502 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 32057 steps, run timeout after 12003 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 32057 steps, saw 31305 distinct states, run finished after 12005 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:50:38] [INFO ] Invariants computation overflowed in 21378 ms
[2023-03-19 19:50:44] [INFO ] After 5564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 19:51:09] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 41 are kept as prefixes of interest. Removing 32726 places using SCC suffix rule.11 ms
Discarding 32726 places :
Also discarding 49044 output transitions
Drop transitions removed 49044 transitions
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
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 80 rules applied. Total rules applied 81 place count 41 transition count 25
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 93 place count 29 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 93 place count 29 transition count 23
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 97 place count 27 transition count 23
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 106 place count 18 transition count 14
Iterating global reduction 2 with 9 rules applied. Total rules applied 115 place count 18 transition count 14
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 123 place count 14 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 13 transition count 9
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 11 transition count 9
Applied a total of 126 rules in 60 ms. Remains 11 /32767 variables (removed 32756) and now considering 9/49149 (removed 49140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 11/32767 places, 9/49149 transitions.
Finished random walk after 12 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 397 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1633 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:51:20] [INFO ] Invariants computation overflowed in 9123 ms
[2023-03-19 19:51:23] [INFO ] Implicit Places using invariants in 11652 ms returned []
Implicit Place search using SMT only with invariants took 11653 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:51:33] [INFO ] Invariants computation overflowed in 9584 ms
[2023-03-19 19:51:35] [INFO ] Dead Transitions using invariants and state equation in 12287 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25582 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 291 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1937 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1535 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1509 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 33224 steps, run timeout after 12006 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 33224 steps, saw 32442 distinct states, run finished after 12008 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:55:30] [INFO ] Invariants computation overflowed in 17406 ms
[2023-03-19 19:55:35] [INFO ] After 5105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 19:56:00] [INFO ] After 19369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 19:56:00] [INFO ] After 19405ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-19 19:56:00] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 41 are kept as prefixes of interest. Removing 32726 places using SCC suffix rule.10 ms
Discarding 32726 places :
Also discarding 49044 output transitions
Drop transitions removed 49044 transitions
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
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 80 rules applied. Total rules applied 81 place count 41 transition count 25
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 93 place count 29 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 93 place count 29 transition count 23
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 97 place count 27 transition count 23
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 106 place count 18 transition count 14
Iterating global reduction 2 with 9 rules applied. Total rules applied 115 place count 18 transition count 14
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 123 place count 14 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 13 transition count 9
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 11 transition count 9
Applied a total of 126 rules in 63 ms. Remains 11 /32767 variables (removed 32756) and now considering 9/49149 (removed 49140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 11/32767 places, 9/49149 transitions.
Finished random walk after 21 steps, including 2 resets, run visited all 2 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration timeout after 50870 steps with 82 reset in 10001 ms.
Product exploration timeout after 41140 steps with 64 reset in 10002 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 104 are kept as prefixes of interest. Removing 32663 places using SCC suffix rule.22 ms
Discarding 32663 places :
Also discarding 48929 output transitions
Drop transitions removed 48929 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 104 transition count 188
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 72 place count 65 transition count 90
Iterating global reduction 1 with 39 rules applied. Total rules applied 111 place count 65 transition count 90
Graph (complete) has 40 edges and 65 vertex of which 63 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
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 63 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 63 transition count 87
Applied a total of 113 rules in 83 ms. Remains 63 /32767 variables (removed 32704) and now considering 87/49149 (removed 49062) transitions.
[2023-03-19 19:56:21] [INFO ] Redundant transitions in 101 ms returned [12, 22, 26, 45, 54, 68]
Found 6 redundant transitions using SMT.
Drop transitions removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
// Phase 1: matrix 81 rows 63 cols
[2023-03-19 19:56:21] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 19:56:22] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/32767 places, 81/49149 transitions.
Graph (complete) has 38 edges and 63 vertex of which 57 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
Applied a total of 1 rules in 1 ms. Remains 57 /63 variables (removed 6) and now considering 75/81 (removed 6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/32767 places, 75/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 289 ms. Remains : 57/32767 places, 75/49149 transitions.
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1636 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:56:33] [INFO ] Invariants computation overflowed in 9411 ms
[2023-03-19 19:56:35] [INFO ] Implicit Places using invariants in 12104 ms returned []
Implicit Place search using SMT only with invariants took 12110 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:56:45] [INFO ] Invariants computation overflowed in 9471 ms
[2023-03-19 19:56:47] [INFO ] Dead Transitions using invariants and state equation in 12181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25932 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 finished in 632516 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(p0))'
Support contains 1 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2018 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:57:03] [INFO ] Invariants computation overflowed in 11660 ms
[2023-03-19 19:57:06] [INFO ] Implicit Places using invariants in 14126 ms returned []
Implicit Place search using SMT only with invariants took 14127 ms to find 0 implicit places.
// Phase 1: matrix 49149 rows 32767 cols
[2023-03-19 19:57:21] [INFO ] Invariants computation overflowed in 15318 ms
[2023-03-19 19:57:23] [INFO ] Dead Transitions using invariants and state equation in 17787 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33937 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s20393)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 27160 steps with 13580 reset in 10002 ms.
Product exploration timeout after 24870 steps with 12435 reset in 10002 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-14 finished in 213138 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((p0||G(p1))))'
Support contains 6 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 145 are kept as prefixes of interest. Removing 32622 places using SCC suffix rule.23 ms
Discarding 32622 places :
Also discarding 48828 output transitions
Drop transitions removed 48828 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 144 transition count 270
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 102 place count 93 transition count 136
Iterating global reduction 1 with 51 rules applied. Total rules applied 153 place count 93 transition count 136
Graph (complete) has 54 edges and 93 vertex of which 92 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
Iterating post reduction 1 with 1 rules applied. Total rules applied 154 place count 92 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 92 transition count 134
Applied a total of 155 rules in 68 ms. Remains 92 /32767 variables (removed 32675) and now considering 134/49149 (removed 49015) transitions.
// Phase 1: matrix 134 rows 92 cols
[2023-03-19 20:00:23] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 20:00:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-19 20:00:23] [INFO ] Invariant cache hit.
[2023-03-19 20:00:23] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-19 20:00:23] [INFO ] Redundant transitions in 26 ms returned [8, 20, 24, 34, 41, 79, 95, 103, 109, 114, 117, 120, 128, 132]
Found 14 redundant transitions using SMT.
Drop transitions removed 14 transitions
Redundant transitions reduction (with SMT) removed 14 transitions.
// Phase 1: matrix 120 rows 92 cols
[2023-03-19 20:00:23] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 20:00:23] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/32767 places, 120/49149 transitions.
Graph (complete) has 53 edges and 92 vertex of which 78 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Applied a total of 1 rules in 2 ms. Remains 78 /92 variables (removed 14) and now considering 106/120 (removed 14) transitions.
// Phase 1: matrix 106 rows 78 cols
[2023-03-19 20:00:23] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 20:00:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 20:00:23] [INFO ] Invariant cache hit.
[2023-03-19 20:00:23] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/32767 places, 106/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 406 ms. Remains : 78/32767 places, 106/49149 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ s25 s70), p0:(AND (LEQ s75 s19) (LEQ s46 s62) (LEQ s25 s70))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-15 finished in 475 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(G((p0||F(p1)))))'
Found a Lengthening insensitive property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 104 are kept as prefixes of interest. Removing 32663 places using SCC suffix rule.32 ms
Discarding 32663 places :
Also discarding 48929 output transitions
Drop transitions removed 48929 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 103 transition count 187
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 72 place count 64 transition count 89
Iterating global reduction 1 with 39 rules applied. Total rules applied 111 place count 64 transition count 89
Graph (complete) has 36 edges and 64 vertex of which 62 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
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 62 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 62 transition count 86
Applied a total of 113 rules in 68 ms. Remains 62 /32767 variables (removed 32705) and now considering 86/49149 (removed 49063) transitions.
// Phase 1: matrix 86 rows 62 cols
[2023-03-19 20:00:23] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 20:00:23] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 20:00:23] [INFO ] Invariant cache hit.
[2023-03-19 20:00:23] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-19 20:00:23] [INFO ] Invariant cache hit.
[2023-03-19 20:00:23] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/32767 places, 86/49149 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 182 ms. Remains : 62/32767 places, 86/49149 transitions.
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s30 s37), p1:(OR (LEQ s55 s14) (LEQ 2 s47))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 4996 steps with 111 reset in 9 ms.
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 finished in 413 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-19 20:00:25] [INFO ] Flatten gal took : 1303 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 1491699 ms.
ITS solved all properties within timeout

BK_STOP 1679256026666

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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

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="ViralEpidemic-PT-S04D1C1A06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ViralEpidemic-PT-S04D1C1A06, 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 r487-tall-167912704301315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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