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.r285-smll-171654421900097.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 PermAdmissibility-PT-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654421900097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Apr 12 09:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 59K Apr 12 09:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 306K Apr 12 09:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 09:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 09:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 87K Apr 12 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 424K Apr 12 09:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 484K 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 PermAdmissibility-PT-01-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716851550579

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-01
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 23:12:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 23:12:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:12:33] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2024-05-27 23:12:33] [INFO ] Transformed 168 places.
[2024-05-27 23:12:33] [INFO ] Transformed 592 transitions.
[2024-05-27 23:12:33] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 258 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 5 formulas.
FORMULA PermAdmissibility-PT-01-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 130 transition count 592
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 124 transition count 496
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 124 transition count 496
Applied a total of 50 rules in 48 ms. Remains 124 /168 variables (removed 44) and now considering 496/592 (removed 96) transitions.
// Phase 1: matrix 496 rows 124 cols
[2024-05-27 23:12:34] [INFO ] Computed 19 invariants in 55 ms
[2024-05-27 23:12:34] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-27 23:12:34] [INFO ] Invariant cache hit.
[2024-05-27 23:12:35] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1557 ms to find 0 implicit places.
[2024-05-27 23:12:35] [INFO ] Invariant cache hit.
[2024-05-27 23:12:36] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/168 places, 496/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2163 ms. Remains : 124/168 places, 496/592 transitions.
Support contains 62 out of 124 places after structural reductions.
[2024-05-27 23:12:36] [INFO ] Flatten gal took : 115 ms
[2024-05-27 23:12:36] [INFO ] Flatten gal took : 94 ms
[2024-05-27 23:12:36] [INFO ] Input system was already deterministic with 496 transitions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 1025 ms. (steps per millisecond=9 ) properties (out of 21) seen :15
Incomplete Best-First random walk after 10001 steps, including 210 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 210 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 210 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 210 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 210 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 210 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-27 23:12:38] [INFO ] Invariant cache hit.
[2024-05-27 23:12:38] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 23:12:39] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 13 ms returned sat
[2024-05-27 23:12:39] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA PermAdmissibility-PT-01-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 124 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 124 transition count 496
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 496/496 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 98 transition count 496
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 46 place count 78 transition count 344
Iterating global reduction 1 with 20 rules applied. Total rules applied 66 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 90 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 114 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 51 transition count 84
Applied a total of 120 rules in 39 ms. Remains 51 /124 variables (removed 73) and now considering 84/496 (removed 412) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-05-27 23:12:39] [INFO ] Computed 16 invariants in 4 ms
[2024-05-27 23:12:39] [INFO ] Implicit Places using invariants in 124 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 127 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/124 places, 84/496 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 47/124 places, 84/496 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 295 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-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:(GT 1 s16)], 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 545 ms.
Product exploration explored 100000 steps with 50000 reset in 370 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-01-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-01-LTLCardinality-00 finished in 1556 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(F(p0)))'
Support contains 8 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 496/496 transitions.
Graph (complete) has 1079 edges and 124 vertex of which 94 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.6 ms
Discarding 30 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 87 transition count 352
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 87 transition count 352
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 29 place count 73 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 43 place count 73 transition count 226
Applied a total of 43 rules in 49 ms. Remains 73 /124 variables (removed 51) and now considering 226/496 (removed 270) transitions.
// Phase 1: matrix 226 rows 73 cols
[2024-05-27 23:12:40] [INFO ] Computed 15 invariants in 4 ms
[2024-05-27 23:12:41] [INFO ] Implicit Places using invariants in 211 ms returned [0, 28, 39]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 215 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/124 places, 226/496 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 70 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 69 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 69 transition count 224
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 68 transition count 224
Applied a total of 4 rules in 30 ms. Remains 68 /70 variables (removed 2) and now considering 224/226 (removed 2) transitions.
// Phase 1: matrix 224 rows 68 cols
[2024-05-27 23:12:41] [INFO ] Computed 12 invariants in 5 ms
[2024-05-27 23:12:41] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-27 23:12:41] [INFO ] Invariant cache hit.
[2024-05-27 23:12:41] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/124 places, 224/496 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 772 ms. Remains : 68/124 places, 224/496 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s9 s10 s11 s12 s13 s14 s15 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7692 reset in 580 ms.
Product exploration explored 100000 steps with 7692 reset in 547 ms.
Computed a total of 68 stabilizing places and 224 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 224
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-27 23:12:43] [INFO ] Invariant cache hit.
[2024-05-27 23:12:43] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 14 ms returned sat
[2024-05-27 23:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 23:12:43] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-27 23:12:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:12:43] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 6 ms returned sat
[2024-05-27 23:12:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 23:12:43] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-27 23:12:43] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 192 transitions) in 36 ms.
[2024-05-27 23:12:44] [INFO ] Added : 8 causal constraints over 2 iterations in 98 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 224/224 transitions.
Applied a total of 0 rules in 11 ms. Remains 68 /68 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-27 23:12:44] [INFO ] Invariant cache hit.
[2024-05-27 23:12:44] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-27 23:12:44] [INFO ] Invariant cache hit.
[2024-05-27 23:12:44] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-27 23:12:44] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-27 23:12:44] [INFO ] Invariant cache hit.
[2024-05-27 23:12:44] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 591 ms. Remains : 68/68 places, 224/224 transitions.
Computed a total of 68 stabilizing places and 224 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 224
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2024-05-27 23:12:45] [INFO ] Invariant cache hit.
[2024-05-27 23:12:45] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 14 ms returned sat
[2024-05-27 23:12:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 23:12:45] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-27 23:12:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:12:45] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 9 ms returned sat
[2024-05-27 23:12:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 23:12:45] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-27 23:12:45] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 192 transitions) in 38 ms.
[2024-05-27 23:12:45] [INFO ] Added : 8 causal constraints over 2 iterations in 120 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7692 reset in 309 ms.
Product exploration explored 100000 steps with 7692 reset in 292 ms.
Built C files in :
/tmp/ltsmin56188549637335158
[2024-05-27 23:12:46] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2024-05-27 23:12:46] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:12:46] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2024-05-27 23:12:46] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:12:46] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2024-05-27 23:12:46] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:12:46] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin56188549637335158
Running compilation step : cd /tmp/ltsmin56188549637335158;'/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 969 ms.
Running link step : cd /tmp/ltsmin56188549637335158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin56188549637335158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8637222372820824728.hoa' '--buchi-type=spotba'
LTSmin run took 444 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-01-LTLCardinality-03 finished in 7302 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)&&X(p1)))'
Support contains 18 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 496/496 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 98 transition count 496
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 39 place count 85 transition count 372
Iterating global reduction 1 with 13 rules applied. Total rules applied 52 place count 85 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 75 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 75 transition count 262
Applied a total of 72 rules in 10 ms. Remains 75 /124 variables (removed 49) and now considering 262/496 (removed 234) transitions.
// Phase 1: matrix 262 rows 75 cols
[2024-05-27 23:12:48] [INFO ] Computed 16 invariants in 6 ms
[2024-05-27 23:12:48] [INFO ] Implicit Places using invariants in 143 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/124 places, 262/496 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 74/124 places, 262/496 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT (ADD s4 s5 s6 s7 s8 s9 s10 s12) (ADD s46 s47 s48 s49)), p1:(AND (GT 2 s40) (GT (ADD s16 s21 s23 s24) s40) (GT 3 s64))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-05 finished in 328 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&&F(p1)&&(X(p0)||G(p2)))))'
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 496/496 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 98 transition count 496
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 45 place count 79 transition count 346
Iterating global reduction 1 with 19 rules applied. Total rules applied 64 place count 79 transition count 346
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 86 place count 57 transition count 124
Iterating global reduction 1 with 22 rules applied. Total rules applied 108 place count 57 transition count 124
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 54 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 54 transition count 100
Applied a total of 114 rules in 19 ms. Remains 54 /124 variables (removed 70) and now considering 100/496 (removed 396) transitions.
// Phase 1: matrix 100 rows 54 cols
[2024-05-27 23:12:48] [INFO ] Computed 16 invariants in 3 ms
[2024-05-27 23:12:48] [INFO ] Implicit Places using invariants in 108 ms returned [0, 6, 19, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 110 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/124 places, 100/496 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 50/124 places, 100/496 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s47 s46), p2:(LEQ s8 s39), p1:(GT 1 s1)], 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-08 finished in 428 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(G(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 496/496 transitions.
Graph (complete) has 1079 edges and 124 vertex of which 86 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.6 ms
Discarding 38 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 74 transition count 344
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 74 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 49 place count 50 transition count 104
Iterating global reduction 0 with 24 rules applied. Total rules applied 73 place count 50 transition count 104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 75 place count 48 transition count 88
Iterating global reduction 0 with 2 rules applied. Total rules applied 77 place count 48 transition count 88
Applied a total of 77 rules in 23 ms. Remains 48 /124 variables (removed 76) and now considering 88/496 (removed 408) transitions.
// Phase 1: matrix 88 rows 48 cols
[2024-05-27 23:12:48] [INFO ] Computed 14 invariants in 1 ms
[2024-05-27 23:12:49] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-27 23:12:49] [INFO ] Invariant cache hit.
[2024-05-27 23:12:49] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-27 23:12:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 23:12:49] [INFO ] Invariant cache hit.
[2024-05-27 23:12:49] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/124 places, 88/496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 48/124 places, 88/496 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s47)], 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 6666 reset in 285 ms.
Product exploration explored 100000 steps with 6666 reset in 264 ms.
Computed a total of 48 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-27 23:12:50] [INFO ] Invariant cache hit.
[2024-05-27 23:12:50] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-27 23:12:50] [INFO ] Invariant cache hit.
[2024-05-27 23:12:50] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-27 23:12:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 23:12:50] [INFO ] Invariant cache hit.
[2024-05-27 23:12:50] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 48/48 places, 88/88 transitions.
Computed a total of 48 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 56 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6666 reset in 256 ms.
Product exploration explored 100000 steps with 6666 reset in 291 ms.
Built C files in :
/tmp/ltsmin14023104623851051904
[2024-05-27 23:12:51] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-27 23:12:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:12:51] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-27 23:12:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:12:51] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-27 23:12:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:12:51] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14023104623851051904
Running compilation step : cd /tmp/ltsmin14023104623851051904;'/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 285 ms.
Running link step : cd /tmp/ltsmin14023104623851051904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14023104623851051904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8048773510154409541.hoa' '--buchi-type=spotba'
LTSmin run took 173 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-01-LTLCardinality-10 finished in 3073 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)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 496/496 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 98 transition count 496
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 46 place count 78 transition count 344
Iterating global reduction 1 with 20 rules applied. Total rules applied 66 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 90 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 114 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 51 transition count 84
Applied a total of 120 rules in 20 ms. Remains 51 /124 variables (removed 73) and now considering 84/496 (removed 412) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-05-27 23:12:52] [INFO ] Computed 16 invariants in 1 ms
[2024-05-27 23:12:52] [INFO ] Implicit Places using invariants in 80 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 82 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/124 places, 84/496 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 47/124 places, 84/496 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s16 s42)], 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 120 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-01-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-01-LTLCardinality-12 finished in 585 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(G(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 496/496 transitions.
Graph (complete) has 1079 edges and 124 vertex of which 87 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.3 ms
Discarding 37 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 76 transition count 344
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 76 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 45 place count 54 transition count 122
Iterating global reduction 0 with 22 rules applied. Total rules applied 67 place count 54 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 69 place count 52 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 71 place count 52 transition count 106
Applied a total of 71 rules in 18 ms. Remains 52 /124 variables (removed 72) and now considering 106/496 (removed 390) transitions.
// Phase 1: matrix 106 rows 52 cols
[2024-05-27 23:12:52] [INFO ] Computed 14 invariants in 1 ms
[2024-05-27 23:12:52] [INFO ] Implicit Places using invariants in 69 ms returned [0, 17, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/124 places, 106/496 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 48 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 48 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 47 transition count 104
Applied a total of 4 rules in 6 ms. Remains 47 /49 variables (removed 2) and now considering 104/106 (removed 2) transitions.
// Phase 1: matrix 104 rows 47 cols
[2024-05-27 23:12:52] [INFO ] Computed 11 invariants in 0 ms
[2024-05-27 23:12:52] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 23:12:52] [INFO ] Invariant cache hit.
[2024-05-27 23:12:52] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/124 places, 104/496 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 313 ms. Remains : 47/124 places, 104/496 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s4 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-13 finished in 361 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(F(p0)) U (p1&&F(G(p1)))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 496/496 transitions.
Graph (complete) has 1079 edges and 124 vertex of which 99 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 81 transition count 352
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 81 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 57 place count 61 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 77 place count 61 transition count 136
Applied a total of 77 rules in 16 ms. Remains 61 /124 variables (removed 63) and now considering 136/496 (removed 360) transitions.
// Phase 1: matrix 136 rows 61 cols
[2024-05-27 23:12:52] [INFO ] Computed 16 invariants in 1 ms
[2024-05-27 23:12:53] [INFO ] Implicit Places using invariants in 91 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/124 places, 136/496 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 114 ms. Remains : 60/124 places, 136/496 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s6 s3), p0:(LEQ s37 s57)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 8088 reset in 254 ms.
Product exploration explored 100000 steps with 8069 reset in 279 ms.
Computed a total of 60 stabilizing places and 136 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 136
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 328 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 220 steps, including 12 resets, run visited all 3 properties in 2 ms. (steps per millisecond=110 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 621 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
// Phase 1: matrix 136 rows 60 cols
[2024-05-27 23:12:55] [INFO ] Computed 15 invariants in 2 ms
[2024-05-27 23:12:55] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 8 ms returned sat
[2024-05-27 23:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 23:12:55] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-27 23:12:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:12:55] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 9 ms returned sat
[2024-05-27 23:12:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 23:12:55] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-27 23:12:55] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 104 transitions) in 15 ms.
[2024-05-27 23:12:55] [INFO ] Added : 9 causal constraints over 3 iterations in 62 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 136/136 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-27 23:12:55] [INFO ] Invariant cache hit.
[2024-05-27 23:12:55] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 23:12:55] [INFO ] Invariant cache hit.
[2024-05-27 23:12:55] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-27 23:12:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 23:12:55] [INFO ] Invariant cache hit.
[2024-05-27 23:12:55] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 60/60 places, 136/136 transitions.
Computed a total of 60 stabilizing places and 136 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 136
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 329 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 271 steps, including 15 resets, run visited all 3 properties in 2 ms. (steps per millisecond=135 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 618 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
[2024-05-27 23:12:57] [INFO ] Invariant cache hit.
[2024-05-27 23:12:57] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 8 ms returned sat
[2024-05-27 23:12:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 23:12:57] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-27 23:12:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:12:57] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 8 ms returned sat
[2024-05-27 23:12:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 23:12:57] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-27 23:12:57] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 104 transitions) in 16 ms.
[2024-05-27 23:12:57] [INFO ] Added : 4 causal constraints over 1 iterations in 50 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 8112 reset in 180 ms.
Product exploration explored 100000 steps with 8085 reset in 228 ms.
Built C files in :
/tmp/ltsmin6891354833952007440
[2024-05-27 23:12:58] [INFO ] Computing symmetric may disable matrix : 136 transitions.
[2024-05-27 23:12:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:12:58] [INFO ] Computing symmetric may enable matrix : 136 transitions.
[2024-05-27 23:12:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:12:58] [INFO ] Computing Do-Not-Accords matrix : 136 transitions.
[2024-05-27 23:12:58] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:12:58] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6891354833952007440
Running compilation step : cd /tmp/ltsmin6891354833952007440;'/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 417 ms.
Running link step : cd /tmp/ltsmin6891354833952007440;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin6891354833952007440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2283313950361321117.hoa' '--buchi-type=spotba'
LTSmin run took 175 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-01-LTLCardinality-14 finished in 6065 ms.
All properties solved by simple procedures.
Total runtime 25740 ms.

BK_STOP 1716851580508

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="PermAdmissibility-PT-01"
export BK_EXAMINATION="LTLCardinality"
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 PermAdmissibility-PT-01, 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 r285-smll-171654421900097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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