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.r167-tall-167838852500092.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 Echo-PT-d03r05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852500092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 14:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 14:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 716K 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 Echo-PT-d03r05-LTLFireability-00
FORMULA_NAME Echo-PT-d03r05-LTLFireability-01
FORMULA_NAME Echo-PT-d03r05-LTLFireability-02
FORMULA_NAME Echo-PT-d03r05-LTLFireability-03
FORMULA_NAME Echo-PT-d03r05-LTLFireability-04
FORMULA_NAME Echo-PT-d03r05-LTLFireability-05
FORMULA_NAME Echo-PT-d03r05-LTLFireability-06
FORMULA_NAME Echo-PT-d03r05-LTLFireability-07
FORMULA_NAME Echo-PT-d03r05-LTLFireability-08
FORMULA_NAME Echo-PT-d03r05-LTLFireability-09
FORMULA_NAME Echo-PT-d03r05-LTLFireability-10
FORMULA_NAME Echo-PT-d03r05-LTLFireability-11
FORMULA_NAME Echo-PT-d03r05-LTLFireability-12
FORMULA_NAME Echo-PT-d03r05-LTLFireability-13
FORMULA_NAME Echo-PT-d03r05-LTLFireability-14
FORMULA_NAME Echo-PT-d03r05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678439543102

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 09:12:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 09:12:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 09:12:24] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-10 09:12:24] [INFO ] Transformed 1445 places.
[2023-03-10 09:12:24] [INFO ] Transformed 1190 transitions.
[2023-03-10 09:12:24] [INFO ] Found NUPN structural information;
[2023-03-10 09:12:24] [INFO ] Parsed PT model containing 1445 places and 1190 transitions and 8260 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Echo-PT-d03r05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 94 out of 1445 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1445/1445 places, 1190/1190 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 1320 transition count 1190
Applied a total of 125 rules in 111 ms. Remains 1320 /1445 variables (removed 125) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-10 09:12:27] [INFO ] Computed 600 place invariants in 1855 ms
[2023-03-10 09:12:28] [INFO ] Implicit Places using invariants in 3351 ms returned []
[2023-03-10 09:12:28] [INFO ] Invariant cache hit.
[2023-03-10 09:15:08] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 09:15:08] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 09:15:08] [INFO ] Implicit Places using invariants and state equation in 160028 ms returned []
Implicit Place search using SMT with State Equation took 163422 ms to find 0 implicit places.
[2023-03-10 09:15:08] [INFO ] Invariant cache hit.
[2023-03-10 09:15:16] [INFO ] Dead Transitions using invariants and state equation in 8061 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1445 places, 1190/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171601 ms. Remains : 1320/1445 places, 1190/1190 transitions.
Support contains 94 out of 1320 places after structural reductions.
[2023-03-10 09:15:17] [INFO ] Flatten gal took : 187 ms
[2023-03-10 09:15:17] [INFO ] Flatten gal took : 112 ms
[2023-03-10 09:15:17] [INFO ] Input system was already deterministic with 1190 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 37) seen :36
Finished Best-First random walk after 2781 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=154 )
FORMULA Echo-PT-d03r05-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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)))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 45 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-10 09:15:18] [INFO ] Invariant cache hit.
[2023-03-10 09:15:36] [INFO ] Implicit Places using invariants in 18293 ms returned []
[2023-03-10 09:15:36] [INFO ] Invariant cache hit.
[2023-03-10 09:18:16] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 09:18:16] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 09:18:16] [INFO ] Implicit Places using invariants and state equation in 160026 ms returned []
Implicit Place search using SMT with State Equation took 178321 ms to find 0 implicit places.
[2023-03-10 09:18:16] [INFO ] Invariant cache hit.
[2023-03-10 09:18:24] [INFO ] Dead Transitions using invariants and state equation in 7769 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186139 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s398 0) (EQ s762 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 316 steps with 1 reset in 20 ms.
FORMULA Echo-PT-d03r05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-00 finished in 186388 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)))'
Support contains 7 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Graph (complete) has 4723 edges and 1320 vertex of which 1313 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 115 ms. Remains 1312 /1320 variables (removed 8) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2023-03-10 09:18:26] [INFO ] Computed 594 place invariants in 1452 ms
[2023-03-10 09:21:06] [INFO ] Performed 615/1312 implicitness test of which 1 returned IMPLICIT in 158 seconds.
[2023-03-10 09:21:06] [INFO ] Implicit Places using invariants in 161484 ms returned [615]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 161488 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1311/1320 places, 1188/1190 transitions.
Applied a total of 0 rules in 55 ms. Remains 1311 /1311 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161658 ms. Remains : 1311/1320 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s622 0) (EQ s623 0) (EQ s624 0) (EQ s625 0) (EQ s1215 0)) (OR (EQ s389 0) (EQ s711 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 401 reset in 1401 ms.
Product exploration explored 100000 steps with 401 reset in 1470 ms.
Computed a total of 1311 stabilizing places and 1188 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1311 transition count 1188
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), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r05-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r05-LTLFireability-01 finished in 165133 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)&&X((G(p2)&&p1))))'
Support contains 9 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 26 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-10 09:21:11] [INFO ] Computed 600 place invariants in 1658 ms
[2023-03-10 09:21:27] [INFO ] Implicit Places using invariants in 18274 ms returned []
[2023-03-10 09:21:27] [INFO ] Invariant cache hit.
[2023-03-10 09:24:08] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 09:24:08] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 09:24:08] [INFO ] Implicit Places using invariants and state equation in 160019 ms returned []
Implicit Place search using SMT with State Equation took 178296 ms to find 0 implicit places.
[2023-03-10 09:24:08] [INFO ] Invariant cache hit.
[2023-03-10 09:24:15] [INFO ] Dead Transitions using invariants and state equation in 7932 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186256 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s341 1) (EQ s497 1)), p1:(AND (EQ s98 1) (EQ s825 1) (EQ s826 1) (EQ s827 1) (EQ s828 1)), p2:(AND (EQ s379 1) (EQ s668 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-02 finished in 186494 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(G((F(G(p0)) U !p1)))))'
Support contains 10 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 22 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-10 09:24:16] [INFO ] Invariant cache hit.
[2023-03-10 09:24:31] [INFO ] Implicit Places using invariants in 15567 ms returned []
[2023-03-10 09:24:31] [INFO ] Invariant cache hit.
[2023-03-10 09:27:11] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 09:27:11] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 09:27:11] [INFO ] Implicit Places using invariants and state equation in 160029 ms returned []
Implicit Place search using SMT with State Equation took 175598 ms to find 0 implicit places.
[2023-03-10 09:27:11] [INFO ] Invariant cache hit.
[2023-03-10 09:27:19] [INFO ] Dead Transitions using invariants and state equation in 7955 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183575 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 192 ms :[p1, p1, p1, (NOT p0), p1]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s51 1) (EQ s776 1) (EQ s778 1) (EQ s779 1) (EQ s780 1) (EQ s781 1)), p0:(AND (EQ s569 1) (EQ s570 1) (EQ s571 1) (EQ s1172 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 250 steps with 0 reset in 7 ms.
FORMULA Echo-PT-d03r05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-04 finished in 183801 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(X((!(p0 U p1)&&F(p0))))))'
Support contains 4 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Graph (complete) has 4723 edges and 1320 vertex of which 1313 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 47 ms. Remains 1312 /1320 variables (removed 8) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2023-03-10 09:27:21] [INFO ] Computed 594 place invariants in 1419 ms
[2023-03-10 09:27:34] [INFO ] Implicit Places using invariants in 14572 ms returned [615, 716, 737, 742, 763, 864]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 14577 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1306/1320 places, 1188/1190 transitions.
Applied a total of 0 rules in 46 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14672 ms. Remains : 1306/1320 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s450 1) (EQ s984 1)), p1:(AND (EQ s353 1) (EQ s545 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 248 steps with 0 reset in 6 ms.
FORMULA Echo-PT-d03r05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-05 finished in 14795 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||X((G(F(p2))||p1)))))'
Support contains 11 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 22 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-10 09:27:36] [INFO ] Computed 600 place invariants in 1626 ms
[2023-03-10 09:27:50] [INFO ] Implicit Places using invariants in 15213 ms returned []
[2023-03-10 09:27:50] [INFO ] Invariant cache hit.
[2023-03-10 09:30:30] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 09:30:30] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 09:30:30] [INFO ] Implicit Places using invariants and state equation in 160031 ms returned []
Implicit Place search using SMT with State Equation took 175245 ms to find 0 implicit places.
[2023-03-10 09:30:30] [INFO ] Invariant cache hit.
[2023-03-10 09:30:37] [INFO ] Dead Transitions using invariants and state equation in 7905 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183172 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s336 1) (EQ s477 1)), p1:(OR (EQ s296 0) (EQ s1013 0) (EQ s1014 0) (EQ s1015 0) (EQ s1016 0)), p2:(AND (EQ s570 1) (EQ s571 1) (EQ s572 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 904 ms.
Product exploration explored 100000 steps with 50000 reset in 876 ms.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 8 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r05-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r05-LTLFireability-06 finished in 185612 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)||G((p1 U p2))))'
Support contains 8 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 22 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-10 09:30:40] [INFO ] Invariant cache hit.
[2023-03-10 09:30:57] [INFO ] Implicit Places using invariants in 16661 ms returned []
[2023-03-10 09:30:57] [INFO ] Invariant cache hit.
[2023-03-10 09:33:37] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 09:33:37] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 09:33:37] [INFO ] Implicit Places using invariants and state equation in 160030 ms returned []
Implicit Place search using SMT with State Equation took 176696 ms to find 0 implicit places.
[2023-03-10 09:33:37] [INFO ] Invariant cache hit.
[2023-03-10 09:33:45] [INFO ] Dead Transitions using invariants and state equation in 8066 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184785 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s386 1) (EQ s696 1)), p1:(AND (NOT (AND (EQ s454 1) (EQ s1011 1) (EQ s402 1) (EQ s785 1))) (EQ s341 1) (EQ s497 1)), p0:(OR (EQ s386 0) (EQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 847 ms.
Product exploration explored 100000 steps with 50000 reset in 897 ms.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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 p2) (NOT p1) p0), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR p2 p1)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 12 factoid took 182 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r05-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r05-LTLFireability-07 finished in 187442 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(p1)&&F(G(p2))&&p0)))'
Support contains 11 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 23 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-10 09:33:47] [INFO ] Invariant cache hit.
[2023-03-10 09:34:04] [INFO ] Implicit Places using invariants in 16654 ms returned []
[2023-03-10 09:34:04] [INFO ] Invariant cache hit.
[2023-03-10 09:36:44] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 09:36:44] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 09:36:44] [INFO ] Implicit Places using invariants and state equation in 160030 ms returned []
Implicit Place search using SMT with State Equation took 176689 ms to find 0 implicit places.
[2023-03-10 09:36:44] [INFO ] Invariant cache hit.
[2023-03-10 09:36:52] [INFO ] Dead Transitions using invariants and state equation in 7856 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184571 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s402 1) (EQ s786 1) (EQ s332 1) (EQ s414 1) (EQ s335 1) (EQ s473 1)), p1:(AND (EQ s7 1) (EQ s726 1) (EQ s728 1) (EQ s729 1) (EQ s730 1)), p2:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-08 finished in 184759 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(p0)||X(X(F((p1&&F(p2)))))))'
Support contains 8 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 21 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-10 09:36:52] [INFO ] Invariant cache hit.
[2023-03-10 09:37:10] [INFO ] Implicit Places using invariants in 18275 ms returned []
[2023-03-10 09:37:10] [INFO ] Invariant cache hit.
[2023-03-10 09:39:50] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 09:39:50] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 09:39:50] [INFO ] Implicit Places using invariants and state equation in 160021 ms returned []
Implicit Place search using SMT with State Equation took 178296 ms to find 0 implicit places.
[2023-03-10 09:39:50] [INFO ] Invariant cache hit.
[2023-03-10 09:39:58] [INFO ] Dead Transitions using invariants and state equation in 7651 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185970 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(OR (EQ s676 0) (EQ s678 0) (EQ s679 0) (EQ s1277 0)), p1:(OR (EQ s408 0) (EQ s809 0)), p0:(AND (EQ s402 1) (EQ s785 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 707 ms.
Product exploration explored 100000 steps with 33333 reset in 745 ms.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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 p2 p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (F (G p2)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p1 (NOT p2)))))
Knowledge based reduction with 11 factoid took 266 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r05-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r05-LTLFireability-09 finished in 188363 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(p0)||F(p1)))'
Support contains 8 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Graph (complete) has 4723 edges and 1320 vertex of which 1313 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 39 ms. Remains 1312 /1320 variables (removed 8) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2023-03-10 09:40:02] [INFO ] Computed 594 place invariants in 1422 ms
[2023-03-10 09:40:15] [INFO ] Implicit Places using invariants in 14552 ms returned [615, 716, 737, 742, 763, 864]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 14554 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1306/1320 places, 1188/1190 transitions.
Applied a total of 0 rules in 31 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14627 ms. Remains : 1306/1320 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(OR (AND (EQ s386 1) (EQ s697 1)) (AND (EQ s567 1) (EQ s568 1) (EQ s570 1) (EQ s1157 1))), p0:(OR (EQ s426 0) (EQ s884 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3680 steps with 51 reset in 58 ms.
FORMULA Echo-PT-d03r05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-10 finished in 14767 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' '!(((p0 U p1) U (X(F(p1))&&(p1||X((p2 U p3))))))'
Support contains 9 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 17 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-10 09:40:17] [INFO ] Computed 600 place invariants in 1627 ms
[2023-03-10 09:40:33] [INFO ] Implicit Places using invariants in 17428 ms returned []
[2023-03-10 09:40:33] [INFO ] Invariant cache hit.
[2023-03-10 09:43:13] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 09:43:13] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 09:43:13] [INFO ] Implicit Places using invariants and state equation in 160029 ms returned []
Implicit Place search using SMT with State Equation took 177458 ms to find 0 implicit places.
[2023-03-10 09:43:13] [INFO ] Invariant cache hit.
[2023-03-10 09:43:21] [INFO ] Dead Transitions using invariants and state equation in 7975 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185451 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), true, (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s435 1) (EQ s939 1)), p0:(AND (EQ s554 1) (EQ s555 1) (EQ s557 1) (EQ s558 1) (EQ s1156 1)), p3:(AND (EQ s435 1) (EQ s939 1) (EQ s332 1) (EQ s...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 250 steps with 0 reset in 9 ms.
FORMULA Echo-PT-d03r05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-11 finished in 185729 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||X(((F(p2)&&p1) U p3))))))'
Support contains 4 out of 1320 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 23 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-10 09:43:21] [INFO ] Invariant cache hit.
[2023-03-10 09:43:37] [INFO ] Implicit Places using invariants in 16432 ms returned []
[2023-03-10 09:43:37] [INFO ] Invariant cache hit.
[2023-03-10 09:46:17] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 09:46:17] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 09:46:17] [INFO ] Implicit Places using invariants and state equation in 160022 ms returned []
Implicit Place search using SMT with State Equation took 176455 ms to find 0 implicit places.
[2023-03-10 09:46:17] [INFO ] Invariant cache hit.
[2023-03-10 09:46:25] [INFO ] Dead Transitions using invariants and state equation in 8009 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184488 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s459 1) (EQ s1027 1)), p3:(AND (EQ s340 1) (EQ s494 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 291 steps with 2 reset in 3 ms.
FORMULA Echo-PT-d03r05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-13 finished in 184625 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(p0))&&(X(X(p1)) U p2))))'
Support contains 7 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 19 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-10 09:46:26] [INFO ] Invariant cache hit.
[2023-03-10 09:46:44] [INFO ] Implicit Places using invariants in 18465 ms returned []
[2023-03-10 09:46:44] [INFO ] Invariant cache hit.
[2023-03-10 09:49:24] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 09:49:24] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 09:49:24] [INFO ] Implicit Places using invariants and state equation in 160020 ms returned []
Implicit Place search using SMT with State Equation took 178488 ms to find 0 implicit places.
[2023-03-10 09:49:24] [INFO ] Invariant cache hit.
[2023-03-10 09:49:32] [INFO ] Dead Transitions using invariants and state equation in 7919 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186427 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s35 1) (EQ s759 1) (EQ s760 1) (EQ s762 1) (EQ s763 1)), p0:(OR (EQ s35 0) (EQ s759 0) (EQ s760 0) (EQ s762 0) (EQ s763 0)), p1:(AND (EQ s413 ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, 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 6 steps with 1 reset in 0 ms.
FORMULA Echo-PT-d03r05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLFireability-14 finished in 186643 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(X((G(!p0) U G(p1))))))'
Support contains 6 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 20 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-10 09:49:32] [INFO ] Invariant cache hit.
[2023-03-10 09:49:48] [INFO ] Implicit Places using invariants in 16180 ms returned []
[2023-03-10 09:49:48] [INFO ] Invariant cache hit.
[2023-03-10 09:52:28] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 09:52:28] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 09:52:28] [INFO ] Implicit Places using invariants and state equation in 160033 ms returned []
Implicit Place search using SMT with State Equation took 176213 ms to find 0 implicit places.
[2023-03-10 09:52:28] [INFO ] Invariant cache hit.
[2023-03-10 09:52:36] [INFO ] Dead Transitions using invariants and state equation in 7630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183864 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND p1 p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s407 1) (EQ s805 1)), p0:(AND (EQ s535 1) (EQ s536 1) (EQ s537 1) (EQ s1138 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16592 reset in 732 ms.
Product exploration explored 100000 steps with 16624 reset in 777 ms.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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) (NOT p0)), true, (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 09:52:39] [INFO ] Invariant cache hit.
[2023-03-10 09:52:41] [INFO ] [Real]Absence check using 0 positive and 600 generalized place invariants in 2166 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 09:53:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 09:53:04] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Graph (complete) has 4723 edges and 1320 vertex of which 1307 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.2 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 1307 transition count 1183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 1306 transition count 1182
Applied a total of 8 rules in 88 ms. Remains 1306 /1320 variables (removed 14) and now considering 1182/1190 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 1306/1320 places, 1182/1190 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Finished Best-First random walk after 6127 steps, including 1 resets, run visited all 1 properties in 31 ms. (steps per millisecond=197 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
[2023-03-10 09:53:05] [INFO ] Invariant cache hit.
[2023-03-10 09:53:20] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 09:53:20] [INFO ] [Real]Absence check using 0 positive and 600 generalized place invariants in 13580 ms returned unknown
Could not prove EG (NOT p1)
Support contains 6 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 22 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-10 09:53:20] [INFO ] Invariant cache hit.
[2023-03-10 09:53:35] [INFO ] Implicit Places using invariants in 15495 ms returned []
[2023-03-10 09:53:35] [INFO ] Invariant cache hit.
[2023-03-10 09:56:15] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 09:56:15] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 09:56:15] [INFO ] Implicit Places using invariants and state equation in 160032 ms returned []
Implicit Place search using SMT with State Equation took 175528 ms to find 0 implicit places.
[2023-03-10 09:56:15] [INFO ] Invariant cache hit.
[2023-03-10 09:56:23] [INFO ] Dead Transitions using invariants and state equation in 7765 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183318 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 559 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 5) seen :4
Finished Best-First random walk after 2174 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=155 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 681 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
[2023-03-10 09:56:25] [INFO ] Invariant cache hit.
[2023-03-10 09:56:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 09:56:40] [INFO ] [Real]Absence check using 0 positive and 600 generalized place invariants in 13590 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Product exploration explored 100000 steps with 33212 reset in 761 ms.
Product exploration explored 100000 steps with 33369 reset in 810 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Support contains 6 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Graph (complete) has 4723 edges and 1320 vertex of which 1313 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 76 ms. Remains 1313 /1320 variables (removed 7) and now considering 1189/1190 (removed 1) transitions.
[2023-03-10 09:56:43] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 1189 rows 1313 cols
[2023-03-10 09:56:44] [INFO ] Computed 594 place invariants in 1538 ms
[2023-03-10 09:57:44] [INFO ] Performed 0/1189 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-10 09:57:44] [INFO ] Dead Transitions using invariants and state equation in 61563 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1313/1320 places, 1189/1190 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61718 ms. Remains : 1313/1320 places, 1189/1190 transitions.
Support contains 6 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 21 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-10 09:57:46] [INFO ] Computed 600 place invariants in 1611 ms
[2023-03-10 09:58:01] [INFO ] Implicit Places using invariants in 17294 ms returned []
[2023-03-10 09:58:01] [INFO ] Invariant cache hit.
[2023-03-10 10:00:41] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 10:00:41] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 10:00:41] [INFO ] Implicit Places using invariants and state equation in 160020 ms returned []
Implicit Place search using SMT with State Equation took 177315 ms to find 0 implicit places.
[2023-03-10 10:00:41] [INFO ] Invariant cache hit.
[2023-03-10 10:00:49] [INFO ] Dead Transitions using invariants and state equation in 7711 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185048 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Treatment of property Echo-PT-d03r05-LTLFireability-15 finished in 677110 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(X((G(!p0) U G(p1))))))'
Found a Lengthening insensitive property : Echo-PT-d03r05-LTLFireability-15
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND p1 p0), (NOT p1)]
Support contains 6 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Graph (complete) has 4723 edges and 1320 vertex of which 1313 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 43 ms. Remains 1312 /1320 variables (removed 8) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2023-03-10 10:00:51] [INFO ] Computed 594 place invariants in 1577 ms
[2023-03-10 10:01:05] [INFO ] Implicit Places using invariants in 15726 ms returned [615, 716, 737, 742, 763, 864]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 15727 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1306/1320 places, 1188/1190 transitions.
Applied a total of 0 rules in 38 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 15808 ms. Remains : 1306/1320 places, 1188/1190 transitions.
Running random walk in product with property : Echo-PT-d03r05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s406 1) (EQ s792 1)), p0:(AND (EQ s533 1) (EQ s534 1) (EQ s535 1) (EQ s1124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16404 reset in 768 ms.
Product exploration explored 100000 steps with 16557 reset in 812 ms.
Computed a total of 1306 stabilizing places and 1188 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1306 transition count 1188
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) (NOT p0)), true, (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :4
Finished Best-First random walk after 3287 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=205 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 285 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
// Phase 1: matrix 1188 rows 1306 cols
[2023-03-10 10:01:10] [INFO ] Computed 588 place invariants in 1464 ms
[2023-03-10 10:01:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 10:01:25] [INFO ] [Real]Absence check using 0 positive and 588 generalized place invariants in 13759 ms returned unknown
Could not prove EG (NOT p1)
Support contains 6 out of 1306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1306/1306 places, 1188/1188 transitions.
Applied a total of 0 rules in 18 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
[2023-03-10 10:01:25] [INFO ] Invariant cache hit.
[2023-03-10 10:01:40] [INFO ] Implicit Places using invariants in 14940 ms returned []
[2023-03-10 10:01:40] [INFO ] Invariant cache hit.
[2023-03-10 10:04:20] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-10 10:04:20] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-10 10:04:20] [INFO ] Implicit Places using invariants and state equation in 160025 ms returned []
Implicit Place search using SMT with State Equation took 174967 ms to find 0 implicit places.
[2023-03-10 10:04:20] [INFO ] Invariant cache hit.
[2023-03-10 10:05:20] [INFO ] Performed 890/1188 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-10 10:05:20] [INFO ] Dead Transitions using invariants and state equation in 60016 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235001 ms. Remains : 1306/1306 places, 1188/1188 transitions.
Computed a total of 1306 stabilizing places and 1188 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1306 transition count 1188
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) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 552 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Finished random walk after 2590 steps, including 10 resets, run visited all 5 properties in 51 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 568 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
[2023-03-10 10:05:22] [INFO ] Invariant cache hit.
[2023-03-10 10:05:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 10:05:37] [INFO ] [Real]Absence check using 0 positive and 588 generalized place invariants in 13744 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Product exploration explored 100000 steps with 33173 reset in 802 ms.
Product exploration explored 100000 steps with 33288 reset in 838 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) p0), (NOT p1), true, (AND p1 p0), (NOT p1)]
Support contains 6 out of 1306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1306/1306 places, 1188/1188 transitions.
Applied a total of 0 rules in 30 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
[2023-03-10 10:05:39] [INFO ] Redundant transitions in 187 ms returned []
[2023-03-10 10:05:39] [INFO ] Invariant cache hit.
[2023-03-10 10:06:39] [INFO ] Performed 890/1188 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-10 10:06:39] [INFO ] Dead Transitions using invariants and state equation in 60023 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60244 ms. Remains : 1306/1306 places, 1188/1188 transitions.
Support contains 6 out of 1306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1306/1306 places, 1188/1188 transitions.
Applied a total of 0 rules in 18 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
[2023-03-10 10:06:39] [INFO ] Invariant cache hit.
[2023-03-10 10:06:56] [INFO ] Implicit Places using invariants in 16188 ms returned []
[2023-03-10 10:06:56] [INFO ] Invariant cache hit.
[2023-03-10 10:09:36] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-10 10:09:36] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-10 10:09:36] [INFO ] Implicit Places using invariants and state equation in 160027 ms returned []
Implicit Place search using SMT with State Equation took 176217 ms to find 0 implicit places.
[2023-03-10 10:09:36] [INFO ] Invariant cache hit.
[2023-03-10 10:10:36] [INFO ] Performed 890/1188 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-10 10:10:36] [INFO ] Dead Transitions using invariants and state equation in 60020 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236255 ms. Remains : 1306/1306 places, 1188/1188 transitions.
Treatment of property Echo-PT-d03r05-LTLFireability-15 finished in 586482 ms.
[2023-03-10 10:10:36] [INFO ] Flatten gal took : 64 ms
[2023-03-10 10:10:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-10 10:10:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1320 places, 1190 transitions and 7665 arcs took 11 ms.
Total runtime 3491912 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Echo-PT-d03r05
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA Echo-PT-d03r05-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678443038101

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Echo-PT-d03r05-LTLFireability-15
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Echo-PT-d03r05-LTLFireability-15
lola: result : false
lola: markings : 251
lola: fired transitions : 251
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Echo-PT-d03r05-LTLFireability-15: LTL false LTL model checker


Time elapsed: 1 secs. Pages in use: 1

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="Echo-PT-d03r05"
export BK_EXAMINATION="LTLFireability"
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 Echo-PT-d03r05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838852500092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d03r05.tgz
mv Echo-PT-d03r05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;