Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025000291.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-030A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 5.9K Apr 29 19:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 19:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 18:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 18:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 159K May 10 09:34 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 ShieldIIPt-PT-030A-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652959724981

Running Version 202205111006
[2022-05-19 11:28:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 11:28:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 11:28:46] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2022-05-19 11:28:46] [INFO ] Transformed 573 places.
[2022-05-19 11:28:46] [INFO ] Transformed 423 transitions.
[2022-05-19 11:28:46] [INFO ] Found NUPN structural information;
[2022-05-19 11:28:46] [INFO ] Parsed PT model containing 573 places and 423 transitions in 226 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 52 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:28:46] [INFO ] Computed 271 place invariants in 25 ms
[2022-05-19 11:28:47] [INFO ] Implicit Places using invariants in 589 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:28:47] [INFO ] Computed 271 place invariants in 11 ms
[2022-05-19 11:28:47] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:28:47] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:28:48] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Support contains 23 out of 573 places after structural reductions.
[2022-05-19 11:28:48] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 11:28:48] [INFO ] Flatten gal took : 102 ms
FORMULA ShieldIIPt-PT-030A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 11:28:48] [INFO ] Flatten gal took : 51 ms
[2022-05-19 11:28:48] [INFO ] Input system was already deterministic with 422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:28:49] [INFO ] Computed 271 place invariants in 6 ms
[2022-05-19 11:28:49] [INFO ] [Real]Absence check using 271 positive place invariants in 35 ms returned sat
[2022-05-19 11:28:49] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-19 11:28:49] [INFO ] [Nat]Absence check using 271 positive place invariants in 34 ms returned sat
[2022-05-19 11:28:50] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-19 11:28:50] [INFO ] After 528ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 109 ms.
[2022-05-19 11:28:50] [INFO ] After 832ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 128 ms.
Support contains 6 out of 573 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Partial Free-agglomeration rule applied 55 times.
Drop transitions removed 55 transitions
Iterating global reduction 0 with 55 rules applied. Total rules applied 59 place count 571 transition count 420
Applied a total of 59 rules in 98 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 571/573 places, 420/422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 394959 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 394959 steps, saw 380687 distinct states, run finished after 3002 ms. (steps per millisecond=131 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 420 rows 571 cols
[2022-05-19 11:28:54] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:28:54] [INFO ] [Real]Absence check using 271 positive place invariants in 37 ms returned sat
[2022-05-19 11:28:54] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:28:54] [INFO ] [Nat]Absence check using 271 positive place invariants in 34 ms returned sat
[2022-05-19 11:28:54] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:28:54] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-19 11:28:55] [INFO ] After 602ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:28:55] [INFO ] After 666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-19 11:28:55] [INFO ] After 1099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 571 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 571/571 places, 420/420 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 571 transition count 420
Applied a total of 3 rules in 71 ms. Remains 571 /571 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 571/571 places, 420/420 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 449959 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 449959 steps, saw 428063 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 420 rows 571 cols
[2022-05-19 11:28:58] [INFO ] Computed 271 place invariants in 5 ms
[2022-05-19 11:28:58] [INFO ] [Real]Absence check using 271 positive place invariants in 42 ms returned sat
[2022-05-19 11:28:59] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:28:59] [INFO ] [Nat]Absence check using 271 positive place invariants in 39 ms returned sat
[2022-05-19 11:28:59] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:28:59] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-19 11:28:59] [INFO ] After 105ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:28:59] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-19 11:28:59] [INFO ] After 546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 571 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 571/571 places, 420/420 transitions.
Applied a total of 0 rules in 21 ms. Remains 571 /571 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 571/571 places, 420/420 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 571/571 places, 420/420 transitions.
Applied a total of 0 rules in 23 ms. Remains 571 /571 variables (removed 0) and now considering 420/420 (removed 0) transitions.
// Phase 1: matrix 420 rows 571 cols
[2022-05-19 11:28:59] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:29:00] [INFO ] Implicit Places using invariants in 309 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 312 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 569/571 places, 420/420 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 419
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 419
Applied a total of 2 rules in 25 ms. Remains 568 /569 variables (removed 1) and now considering 419/420 (removed 1) transitions.
// Phase 1: matrix 419 rows 568 cols
[2022-05-19 11:29:00] [INFO ] Computed 269 place invariants in 2 ms
[2022-05-19 11:29:00] [INFO ] Implicit Places using invariants in 327 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 328 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 567/571 places, 419/420 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 566 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 566 transition count 418
Applied a total of 2 rules in 30 ms. Remains 566 /567 variables (removed 1) and now considering 418/419 (removed 1) transitions.
// Phase 1: matrix 418 rows 566 cols
[2022-05-19 11:29:00] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:29:00] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 418 rows 566 cols
[2022-05-19 11:29:00] [INFO ] Computed 268 place invariants in 5 ms
[2022-05-19 11:29:00] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-05-19 11:29:01] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 566/571 places, 418/420 transitions.
Finished structural reductions, in 3 iterations. Remains : 566/571 places, 418/420 transitions.
Finished random walk after 1980 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=165 )
FORMULA ShieldIIPt-PT-030A-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 18 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:01] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:29:02] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:02] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:29:02] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:02] [INFO ] Computed 271 place invariants in 5 ms
[2022-05-19 11:29:02] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s394 0) (EQ s465 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1717 ms.
Product exploration explored 100000 steps with 50000 reset in 1514 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-00 finished in 4725 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 15 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:06] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:29:06] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:06] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:29:07] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:07] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:29:07] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s537 0) (EQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1428 ms.
Product exploration explored 100000 steps with 50000 reset in 1472 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-03 finished in 4111 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(X(p0))))||G(p0)))'
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 12 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:10] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:29:10] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:10] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:29:11] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:11] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:29:11] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s117 0) (EQ s526 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 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-07 finished in 1231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 16 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:11] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:29:11] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:12] [INFO ] Computed 271 place invariants in 5 ms
[2022-05-19 11:29:12] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:12] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:29:12] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s195 0) (NEQ s237 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][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 468 ms.
Product exploration explored 100000 steps with 0 reset in 649 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:14] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:29:14] [INFO ] [Real]Absence check using 271 positive place invariants in 124 ms returned sat
[2022-05-19 11:29:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 11:29:15] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2022-05-19 11:29:15] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-19 11:29:15] [INFO ] Added : 0 causal constraints over 0 iterations in 67 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 9 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:15] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:29:15] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:15] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:29:15] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:15] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:29:16] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:16] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:29:17] [INFO ] [Real]Absence check using 271 positive place invariants in 126 ms returned sat
[2022-05-19 11:29:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 11:29:17] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-05-19 11:29:17] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-19 11:29:17] [INFO ] Added : 0 causal constraints over 0 iterations in 66 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 465 ms.
Product exploration explored 100000 steps with 0 reset in 574 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 422
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 573 transition count 422
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 573 transition count 422
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 77 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
[2022-05-19 11:29:19] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:19] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:29:19] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 573/573 places, 422/422 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Product exploration explored 100000 steps with 0 reset in 457 ms.
Entered a terminal (fully accepting) state of product in 37010 steps with 0 reset in 216 ms.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-12 finished in 8664 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((G(G(p1))||p0)))&&G(G(F(p2)))))'
Support contains 4 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 14 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:20] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:29:20] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:20] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:29:21] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:21] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:29:21] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s181 0) (EQ s56 1)), p2:(AND (EQ s56 0) (EQ s181 1)), p1:(OR (EQ s404 0) (EQ s220 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]]
Product exploration explored 100000 steps with 0 reset in 540 ms.
Stack based approach found an accepted trace after 279 steps with 0 reset with depth 280 and stack size 280 in 2 ms.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-14 finished in 1830 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U X((G(p1)||!p1))))))'
Support contains 4 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 15 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:22] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:29:22] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:22] [INFO ] Computed 271 place invariants in 6 ms
[2022-05-19 11:29:23] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:23] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:29:23] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 669 ms :[false, false, false]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(OR (EQ s532 0) (EQ s149 1)), p1:(OR (EQ s199 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 473 ms.
Product exploration explored 100000 steps with 0 reset in 592 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 516 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:25] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:29:26] [INFO ] [Real]Absence check using 271 positive place invariants in 36 ms returned sat
[2022-05-19 11:29:26] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 11:29:26] [INFO ] [Nat]Absence check using 271 positive place invariants in 36 ms returned sat
[2022-05-19 11:29:27] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 11:29:27] [INFO ] After 547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 127 ms.
[2022-05-19 11:29:27] [INFO ] After 846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 119 ms.
Support contains 4 out of 573 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Partial Free-agglomeration rule applied 57 times.
Drop transitions removed 57 transitions
Iterating global reduction 0 with 57 rules applied. Total rules applied 61 place count 571 transition count 420
Applied a total of 61 rules in 52 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 571/573 places, 420/422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Finished probabilistic random walk after 37211 steps, run visited all 3 properties in 772 ms. (steps per millisecond=48 )
Probabilistic random walk after 37211 steps, saw 35788 distinct states, run finished after 773 ms. (steps per millisecond=48 ) properties seen :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 574 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[false, false, false]
Stuttering acceptance computed with spot in 99 ms :[false, false, false]
Support contains 4 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 15 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:29] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:29:29] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:29] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:29:30] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:30] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:29:30] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 342 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 140 ms :[false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:31] [INFO ] Computed 271 place invariants in 2 ms
[2022-05-19 11:29:31] [INFO ] [Real]Absence check using 271 positive place invariants in 39 ms returned sat
[2022-05-19 11:29:31] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 11:29:32] [INFO ] [Nat]Absence check using 271 positive place invariants in 34 ms returned sat
[2022-05-19 11:29:32] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 11:29:32] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 126 ms.
[2022-05-19 11:29:32] [INFO ] After 868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 164 ms.
Support contains 4 out of 573 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Partial Free-agglomeration rule applied 57 times.
Drop transitions removed 57 transitions
Iterating global reduction 0 with 57 rules applied. Total rules applied 61 place count 571 transition count 420
Applied a total of 61 rules in 37 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 571/573 places, 420/422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Finished probabilistic random walk after 37211 steps, run visited all 3 properties in 784 ms. (steps per millisecond=47 )
Probabilistic random walk after 37211 steps, saw 35788 distinct states, run finished after 784 ms. (steps per millisecond=47 ) properties seen :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 648 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[false, false, false]
Stuttering acceptance computed with spot in 108 ms :[false, false, false]
Stuttering acceptance computed with spot in 113 ms :[false, false, false]
Product exploration explored 100000 steps with 0 reset in 469 ms.
Product exploration explored 100000 steps with 0 reset in 586 ms.
Built C files in :
/tmp/ltsmin18026702857519247495
[2022-05-19 11:29:36] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18026702857519247495
Running compilation step : cd /tmp/ltsmin18026702857519247495;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 778 ms.
Running link step : cd /tmp/ltsmin18026702857519247495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin18026702857519247495;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16091646311105030923.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 9 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:51] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:29:51] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:51] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:29:52] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
// Phase 1: matrix 422 rows 573 cols
[2022-05-19 11:29:52] [INFO ] Computed 271 place invariants in 1 ms
[2022-05-19 11:29:52] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 573/573 places, 422/422 transitions.
Built C files in :
/tmp/ltsmin4910348523664722834
[2022-05-19 11:29:52] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4910348523664722834
Running compilation step : cd /tmp/ltsmin4910348523664722834;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 671 ms.
Running link step : cd /tmp/ltsmin4910348523664722834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4910348523664722834;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16843387811258270650.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 11:30:07] [INFO ] Flatten gal took : 36 ms
[2022-05-19 11:30:07] [INFO ] Flatten gal took : 33 ms
[2022-05-19 11:30:07] [INFO ] Time to serialize gal into /tmp/LTL15864759590224313470.gal : 6 ms
[2022-05-19 11:30:07] [INFO ] Time to serialize properties into /tmp/LTL17349674609390976396.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15864759590224313470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17349674609390976396.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1586475...268
Read 1 LTL properties
Checking formula 0 : !((F(G((!("((p532==0)||(p149==1))"))U(X((G("((p199==0)||(p5==1))"))||(!("((p199==0)||(p5==1))"))))))))
Formula 0 simplified : !FG(!"((p532==0)||(p149==1))" U X(!"((p199==0)||(p5==1))" | G"((p199==0)||(p5==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-19 11:30:22] [INFO ] Flatten gal took : 31 ms
[2022-05-19 11:30:22] [INFO ] Applying decomposition
[2022-05-19 11:30:22] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10140409464134326275.txt' '-o' '/tmp/graph10140409464134326275.bin' '-w' '/tmp/graph10140409464134326275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10140409464134326275.bin' '-l' '-1' '-v' '-w' '/tmp/graph10140409464134326275.weights' '-q' '0' '-e' '0.001'
[2022-05-19 11:30:22] [INFO ] Decomposing Gal with order
[2022-05-19 11:30:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 11:30:22] [INFO ] Removed a total of 90 redundant transitions.
[2022-05-19 11:30:22] [INFO ] Flatten gal took : 78 ms
[2022-05-19 11:30:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2022-05-19 11:30:22] [INFO ] Time to serialize gal into /tmp/LTL13388406101033326577.gal : 12 ms
[2022-05-19 11:30:22] [INFO ] Time to serialize properties into /tmp/LTL16669450499144242138.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13388406101033326577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16669450499144242138.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1338840...247
Read 1 LTL properties
Checking formula 0 : !((F(G((!("((i27.i1.u223.p532==0)||(i7.i1.u62.p149==1))"))U(X((G("((i10.i2.u82.p199==0)||(i0.i2.u2.p5==1))"))||(!("((i10.i2.u82.p199==...185
Formula 0 simplified : !FG(!"((i27.i1.u223.p532==0)||(i7.i1.u62.p149==1))" U X(!"((i10.i2.u82.p199==0)||(i0.i2.u2.p5==1))" | G"((i10.i2.u82.p199==0)||(i0.i...170
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
2 strongly connected components in search stack
10 transitions explored
6 items max in DFS search stack
76 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.842017,42312,1,0,50584,560,2670,104153,121,3519,69886
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-15 finished in 61698 ms.
All properties solved by simple procedures.
Total runtime 97764 ms.

BK_STOP 1652959823993

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-030A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-030A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025000291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030A.tgz
mv ShieldIIPt-PT-030A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;