About the Execution of 2023-gold for PGCD-COL-D02N006
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
472.855 | 17181.00 | 29266.00 | 484.90 | FTFFFFFTTFFFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372800433.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PGCD-COL-D02N006, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372800433
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.5K Apr 11 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 11 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 15:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 15:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 6 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 6 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 6 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 11 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11K May 18 16:43 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 PGCD-COL-D02N006-LTLFireability-00
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-01
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-02
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-03
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-04
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-05
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-06
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-07
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-08
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-09
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-10
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-11
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-12
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-13
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-14
FORMULA_NAME PGCD-COL-D02N006-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716695982935
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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-COL-D02N006
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-26 03:59:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 03:59:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:59:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 03:59:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 03:59:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 622 ms
[2024-05-26 03:59:45] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 9 PT places and 9.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 03:59:45] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 5 ms.
[2024-05-26 03:59:45] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2024-05-26 03:59:45] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 6 ms.
[2024-05-26 03:59:45] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PGCD-COL-D02N006-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 6 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-26 03:59:45] [INFO ] Computed 4 invariants in 6 ms
[2024-05-26 03:59:45] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
[2024-05-26 03:59:45] [INFO ] Invariant cache hit.
[2024-05-26 03:59:45] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-26 03:59:45] [INFO ] Invariant cache hit.
[2024-05-26 03:59:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:45] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-26 03:59:45] [INFO ] Invariant cache hit.
[2024-05-26 03:59:45] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 9/9 places, 9/9 transitions.
Support contains 9 out of 9 places after structural reductions.
[2024-05-26 03:59:45] [INFO ] Flatten gal took : 14 ms
[2024-05-26 03:59:45] [INFO ] Flatten gal took : 4 ms
[2024-05-26 03:59:45] [INFO ] Input system was already deterministic with 9 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 03:59:46] [INFO ] Invariant cache hit.
[2024-05-26 03:59:46] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA PGCD-COL-D02N006-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N006-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:46] [INFO ] Invariant cache hit.
[2024-05-26 03:59:46] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-26 03:59:46] [INFO ] Invariant cache hit.
[2024-05-26 03:59:46] [INFO ] Implicit Places using invariants in 42 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 6/9 places, 9/9 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 251 ms :[(NOT p0)]
Running random walk in product with property : PGCD-COL-D02N006-LTLFireability-00 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 (LT s0 1) (LT s3 1)) (OR (LT s1 1) (LT s4 1)) (OR (LT s2 1) (LT s5 1)))], 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 0 reset in 224 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA PGCD-COL-D02N006-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N006-LTLFireability-00 finished in 605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((p1 U (X(p2) U p0))))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:46] [INFO ] Invariant cache hit.
[2024-05-26 03:59:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-26 03:59:46] [INFO ] Invariant cache hit.
[2024-05-26 03:59:47] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-26 03:59:47] [INFO ] Invariant cache hit.
[2024-05-26 03:59:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:47] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-26 03:59:47] [INFO ] Invariant cache hit.
[2024-05-26 03:59:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), (NOT p0), true]
Running random walk in product with property : PGCD-COL-D02N006-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (GEQ s2 1) (GEQ s5 1))), p1:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1)) (AND (GEQ s0 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]]
Product exploration explored 100000 steps with 167 reset in 180 ms.
Product exploration explored 100000 steps with 173 reset in 180 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 7 factoid took 173 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 03:59:48] [INFO ] Invariant cache hit.
[2024-05-26 03:59:48] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 8 factoid took 239 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), true]
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:48] [INFO ] Invariant cache hit.
[2024-05-26 03:59:48] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
[2024-05-26 03:59:48] [INFO ] Invariant cache hit.
[2024-05-26 03:59:48] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-26 03:59:48] [INFO ] Invariant cache hit.
[2024-05-26 03:59:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:48] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-26 03:59:48] [INFO ] Invariant cache hit.
[2024-05-26 03:59:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 9/9 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), true]
Finished random walk after 47 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2)), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p0)), (F p2), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), true]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), true]
Product exploration explored 100000 steps with 167 reset in 118 ms.
Product exploration explored 100000 steps with 149 reset in 126 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), true]
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:50] [INFO ] Invariant cache hit.
[2024-05-26 03:59:50] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-26 03:59:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-26 03:59:50] [INFO ] Invariant cache hit.
[2024-05-26 03:59:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 9/9 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin15863932008600189283
[2024-05-26 03:59:50] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15863932008600189283
Running compilation step : cd /tmp/ltsmin15863932008600189283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 177 ms.
Running link step : cd /tmp/ltsmin15863932008600189283;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin15863932008600189283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3241638843030696591.hoa' '--buchi-type=spotba'
LTSmin run took 383 ms.
FORMULA PGCD-COL-D02N006-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PGCD-COL-D02N006-LTLFireability-01 finished in 3865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X(X(G(!p0))))))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:50] [INFO ] Invariant cache hit.
[2024-05-26 03:59:50] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-26 03:59:50] [INFO ] Invariant cache hit.
[2024-05-26 03:59:50] [INFO ] Implicit Places using invariants in 26 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 6/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : PGCD-COL-D02N006-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (OR (LT s0 1) (LT s3 1)) (OR (LT s1 1) (LT s4 1)) (OR (LT s2 1) (LT s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1137 steps with 0 reset in 1 ms.
FORMULA PGCD-COL-D02N006-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-COL-D02N006-LTLFireability-03 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:51] [INFO ] Invariant cache hit.
[2024-05-26 03:59:51] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-26 03:59:51] [INFO ] Invariant cache hit.
[2024-05-26 03:59:51] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-26 03:59:51] [INFO ] Invariant cache hit.
[2024-05-26 03:59:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:51] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-26 03:59:51] [INFO ] Invariant cache hit.
[2024-05-26 03:59:51] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PGCD-COL-D02N006-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s6 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s7 1))) (OR (AND (GEQ s0 3) (GEQ...], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 231 steps with 0 reset in 2 ms.
FORMULA PGCD-COL-D02N006-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-COL-D02N006-LTLFireability-04 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&F(p1)))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:51] [INFO ] Invariant cache hit.
[2024-05-26 03:59:51] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-26 03:59:51] [INFO ] Invariant cache hit.
[2024-05-26 03:59:51] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-26 03:59:51] [INFO ] Invariant cache hit.
[2024-05-26 03:59:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:51] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-26 03:59:51] [INFO ] Invariant cache hit.
[2024-05-26 03:59:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : PGCD-COL-D02N006-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s0 3) (GEQ s6 1)) (AND (GEQ s1 3) (GEQ s7 1)) (AND (GEQ s2 3) (GEQ s8 1))), p0:(AND (OR (LT s0 1) (LT s3 1)) (OR (LT s1 1) (LT s4 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23430 reset in 103 ms.
Stack based approach found an accepted trace after 283 steps with 69 reset with depth 5 and stack size 5 in 1 ms.
FORMULA PGCD-COL-D02N006-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N006-LTLFireability-05 finished in 514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(!p0)))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:51] [INFO ] Invariant cache hit.
[2024-05-26 03:59:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-26 03:59:51] [INFO ] Invariant cache hit.
[2024-05-26 03:59:51] [INFO ] Implicit Places using invariants in 30 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 6/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), p0]
Running random walk in product with property : PGCD-COL-D02N006-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s3 1)) (OR (LT s1 1) (LT s4 1)) (OR (LT s2 1) (LT s5 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 241 reset in 135 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA PGCD-COL-D02N006-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N006-LTLFireability-06 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:52] [INFO ] Invariant cache hit.
[2024-05-26 03:59:52] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-26 03:59:52] [INFO ] Invariant cache hit.
[2024-05-26 03:59:52] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-26 03:59:52] [INFO ] Invariant cache hit.
[2024-05-26 03:59:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:52] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-26 03:59:52] [INFO ] Invariant cache hit.
[2024-05-26 03:59:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PGCD-COL-D02N006-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s0 1) (LT s3 1)) (OR (LT s1 1) (LT s4 1)) (OR (LT s2 1) (LT s5 1))), p1:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1)) (AND (GEQ s0 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 248 reset in 177 ms.
Product exploration explored 100000 steps with 227 reset in 160 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 86 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 03:59:53] [INFO ] Invariant cache hit.
[2024-05-26 03:59:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-26 03:59:53] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 03:59:53] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (G (NOT (AND p0 p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 14 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PGCD-COL-D02N006-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PGCD-COL-D02N006-LTLFireability-07 finished in 1010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0))||G(p1)))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:53] [INFO ] Invariant cache hit.
[2024-05-26 03:59:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-26 03:59:53] [INFO ] Invariant cache hit.
[2024-05-26 03:59:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-26 03:59:53] [INFO ] Invariant cache hit.
[2024-05-26 03:59:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:53] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-26 03:59:53] [INFO ] Invariant cache hit.
[2024-05-26 03:59:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 127 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PGCD-COL-D02N006-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s6 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s7 1))), p1:(OR (AND (GEQ s0 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 213 reset in 125 ms.
Product exploration explored 100000 steps with 214 reset in 138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-26 03:59:54] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-26 03:59:54] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 13 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PGCD-COL-D02N006-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PGCD-COL-D02N006-LTLFireability-08 finished in 940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:54] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:54] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:54] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PGCD-COL-D02N006-LTLFireability-09 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 (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s6 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 121 steps with 0 reset in 0 ms.
FORMULA PGCD-COL-D02N006-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-COL-D02N006-LTLFireability-09 finished in 188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&G(F(!p0)))) U X(G(!p1))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:54] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:54] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:54] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 168 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Running random walk in product with property : PGCD-COL-D02N006-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s3 1)) (OR (LT s1 1) (LT s4 1)) (OR (LT s2 1) (LT s5 1))), p0:(OR (AND (GEQ s0 3) (GEQ s6 1)) (AND (GEQ s1 3) (GEQ s7 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 81 reset in 120 ms.
Stack based approach found an accepted trace after 187 steps with 0 reset with depth 188 and stack size 162 in 0 ms.
FORMULA PGCD-COL-D02N006-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N006-LTLFireability-10 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p1)||p0)))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:54] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:54] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:54] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PGCD-COL-D02N006-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (AND (GEQ s0 3) (GEQ s6 1)) (AND (GEQ s1 3) (GEQ s7 1)) (AND (GEQ s2 3) (GEQ s8 1))), p1:(AND (OR (LT s0 1) (LT s3 1)) (OR (LT s1 1) (LT s4 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PGCD-COL-D02N006-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-COL-D02N006-LTLFireability-11 finished in 271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X((X(p0) U p1))&&(F(p2)||(X(p0)&&p2))))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:54] [INFO ] Invariant cache hit.
[2024-05-26 03:59:55] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2024-05-26 03:59:55] [INFO ] Invariant cache hit.
[2024-05-26 03:59:55] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-26 03:59:55] [INFO ] Invariant cache hit.
[2024-05-26 03:59:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-26 03:59:55] [INFO ] Invariant cache hit.
[2024-05-26 03:59:55] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : PGCD-COL-D02N006-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (GEQ s2 1) (GEQ s5 1))), p1:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1)) (AND (GEQ s0 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25005 reset in 124 ms.
Product exploration explored 100000 steps with 25012 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (X p2)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Finished random walk after 35 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (X p2)), true, (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:56] [INFO ] Invariant cache hit.
[2024-05-26 03:59:56] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2024-05-26 03:59:56] [INFO ] Invariant cache hit.
[2024-05-26 03:59:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-26 03:59:56] [INFO ] Invariant cache hit.
[2024-05-26 03:59:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 03:59:56] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-26 03:59:56] [INFO ] Invariant cache hit.
[2024-05-26 03:59:56] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 9/9 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (X p2)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Finished random walk after 29 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (X p2)), true, (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 24980 reset in 86 ms.
Product exploration explored 100000 steps with 25034 reset in 92 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-26 03:59:58] [INFO ] Invariant cache hit.
[2024-05-26 03:59:58] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2024-05-26 03:59:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-26 03:59:58] [INFO ] Invariant cache hit.
[2024-05-26 03:59:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 9/9 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin16323210845526243951
[2024-05-26 03:59:58] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16323210845526243951
Running compilation step : cd /tmp/ltsmin16323210845526243951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin16323210845526243951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16323210845526243951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1101101377474439257.hoa' '--buchi-type=spotba'
LTSmin run took 443 ms.
FORMULA PGCD-COL-D02N006-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PGCD-COL-D02N006-LTLFireability-12 finished in 4211 ms.
All properties solved by simple procedures.
Total runtime 14702 ms.
BK_STOP 1716696000116
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="PGCD-COL-D02N006"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is PGCD-COL-D02N006, 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 r263-tall-171654372800433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D02N006.tgz
mv PGCD-COL-D02N006 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 '
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 ;