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.r373-tall-171683789200397.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 ShieldPPPt-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789200397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 376K 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 ShieldPPPt-PT-020B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-020B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716985104344

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=ShieldPPPt-PT-020B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 12:18:26] [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-29 12:18:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:18:26] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-29 12:18:26] [INFO ] Transformed 1563 places.
[2024-05-29 12:18:26] [INFO ] Transformed 1423 transitions.
[2024-05-29 12:18:26] [INFO ] Found NUPN structural information;
[2024-05-29 12:18:26] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 216 places :
Symmetric choice reduction at 0 with 216 rule applications. Total rules 216 place count 1347 transition count 1207
Iterating global reduction 0 with 216 rules applied. Total rules applied 432 place count 1347 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 433 place count 1346 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 434 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 435 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 436 place count 1345 transition count 1205
Applied a total of 436 rules in 847 ms. Remains 1345 /1563 variables (removed 218) and now considering 1205/1423 (removed 218) transitions.
// Phase 1: matrix 1205 rows 1345 cols
[2024-05-29 12:18:27] [INFO ] Computed 221 invariants in 32 ms
[2024-05-29 12:18:28] [INFO ] Implicit Places using invariants in 831 ms returned []
[2024-05-29 12:18:28] [INFO ] Invariant cache hit.
[2024-05-29 12:18:29] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
[2024-05-29 12:18:29] [INFO ] Invariant cache hit.
[2024-05-29 12:18:30] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1345/1563 places, 1205/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3413 ms. Remains : 1345/1563 places, 1205/1423 transitions.
Support contains 21 out of 1345 places after structural reductions.
[2024-05-29 12:18:30] [INFO ] Flatten gal took : 112 ms
[2024-05-29 12:18:30] [INFO ] Flatten gal took : 58 ms
[2024-05-29 12:18:30] [INFO ] Input system was already deterministic with 1205 transitions.
Support contains 19 out of 1345 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 12:18:31] [INFO ] Invariant cache hit.
[2024-05-29 12:18:31] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 12:18:31] [INFO ] [Nat]Absence check using 221 positive place invariants in 64 ms returned sat
[2024-05-29 12:18:32] [INFO ] After 670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 12:18:32] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 5 ms to minimize.
[2024-05-29 12:18:33] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 2 ms to minimize.
[2024-05-29 12:18:33] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 2 ms to minimize.
[2024-05-29 12:18:33] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 1 ms to minimize.
[2024-05-29 12:18:34] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 1 ms to minimize.
[2024-05-29 12:18:34] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 1 ms to minimize.
[2024-05-29 12:18:34] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 1 ms to minimize.
[2024-05-29 12:18:34] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 1 ms to minimize.
[2024-05-29 12:18:35] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 1 ms to minimize.
[2024-05-29 12:18:35] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 1 ms to minimize.
[2024-05-29 12:18:35] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 1 ms to minimize.
[2024-05-29 12:18:35] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2024-05-29 12:18:35] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 0 ms to minimize.
[2024-05-29 12:18:36] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2024-05-29 12:18:36] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 0 ms to minimize.
[2024-05-29 12:18:36] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 1 ms to minimize.
[2024-05-29 12:18:36] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 0 ms to minimize.
[2024-05-29 12:18:36] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2024-05-29 12:18:37] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2024-05-29 12:18:37] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 2 ms to minimize.
[2024-05-29 12:18:37] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 1 ms to minimize.
[2024-05-29 12:18:37] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2024-05-29 12:18:37] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 0 ms to minimize.
[2024-05-29 12:18:38] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 1 ms to minimize.
[2024-05-29 12:18:38] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2024-05-29 12:18:38] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 0 ms to minimize.
[2024-05-29 12:18:38] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2024-05-29 12:18:38] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2024-05-29 12:18:38] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2024-05-29 12:18:39] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 0 ms to minimize.
[2024-05-29 12:18:39] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-05-29 12:18:39] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-29 12:18:39] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2024-05-29 12:18:39] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2024-05-29 12:18:39] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 0 ms to minimize.
[2024-05-29 12:18:39] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 0 ms to minimize.
[2024-05-29 12:18:40] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 0 ms to minimize.
[2024-05-29 12:18:40] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 7397 ms
[2024-05-29 12:18:40] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 0 ms to minimize.
[2024-05-29 12:18:40] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2024-05-29 12:18:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2024-05-29 12:18:40] [INFO ] After 8701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 184 ms.
[2024-05-29 12:18:40] [INFO ] After 9308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 7 out of 1345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Drop transitions removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1345 transition count 930
Reduce places removed 275 places and 0 transitions.
Iterating post reduction 1 with 275 rules applied. Total rules applied 550 place count 1070 transition count 930
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 550 place count 1070 transition count 772
Deduced a syphon composed of 158 places in 3 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 866 place count 912 transition count 772
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 867 place count 911 transition count 771
Iterating global reduction 2 with 1 rules applied. Total rules applied 868 place count 911 transition count 771
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 868 place count 911 transition count 770
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 870 place count 910 transition count 770
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1552 place count 569 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1553 place count 569 transition count 428
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 1555 place count 568 transition count 427
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1669 place count 511 transition count 427
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 1727 place count 511 transition count 427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1728 place count 510 transition count 426
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1729 place count 509 transition count 426
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1729 place count 509 transition count 424
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1733 place count 507 transition count 424
Applied a total of 1733 rules in 316 ms. Remains 507 /1345 variables (removed 838) and now considering 424/1205 (removed 781) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 507/1345 places, 424/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 174010 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 174010 steps, saw 143057 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 424 rows 507 cols
[2024-05-29 12:18:44] [INFO ] Computed 220 invariants in 7 ms
[2024-05-29 12:18:44] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 12:18:45] [INFO ] [Nat]Absence check using 220 positive place invariants in 47 ms returned sat
[2024-05-29 12:18:45] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 12:18:45] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-29 12:18:45] [INFO ] After 254ms SMT Verify possible using 115 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 12:18:45] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:18:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-29 12:18:45] [INFO ] After 541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-29 12:18:45] [INFO ] After 1131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 346 steps, including 0 resets, run visited all 4 properties in 10 ms. (steps per millisecond=34 )
Parikh walk visited 4 properties in 11 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 4 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1342 transition count 1202
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1342 transition count 1202
Applied a total of 6 rules in 173 ms. Remains 1342 /1345 variables (removed 3) and now considering 1202/1205 (removed 3) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2024-05-29 12:18:46] [INFO ] Computed 221 invariants in 13 ms
[2024-05-29 12:18:46] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-29 12:18:46] [INFO ] Invariant cache hit.
[2024-05-29 12:18:47] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
[2024-05-29 12:18:47] [INFO ] Invariant cache hit.
[2024-05-29 12:18:48] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1345 places, 1202/1205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2368 ms. Remains : 1342/1345 places, 1202/1205 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 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s246 0) (EQ s1046 1)), p1:(OR (EQ s1155 0) (EQ s561 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 768 ms.
Product exploration explored 100000 steps with 50000 reset in 653 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-020B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-00 finished in 4135 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((G((!p0 U ((p1 U p2)||F(p1)))) U p0))))'
Support contains 5 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1344 transition count 929
Reduce places removed 275 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 276 rules applied. Total rules applied 551 place count 1069 transition count 928
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 552 place count 1068 transition count 928
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 157 Pre rules applied. Total rules applied 552 place count 1068 transition count 771
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 866 place count 911 transition count 771
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 868 place count 909 transition count 769
Iterating global reduction 3 with 2 rules applied. Total rules applied 870 place count 909 transition count 769
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 870 place count 909 transition count 767
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 874 place count 907 transition count 767
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 1550 place count 569 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1551 place count 569 transition count 428
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 1553 place count 568 transition count 427
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1667 place count 511 transition count 427
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1669 place count 509 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1670 place count 508 transition count 425
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1670 place count 508 transition count 423
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1674 place count 506 transition count 423
Applied a total of 1674 rules in 262 ms. Remains 506 /1345 variables (removed 839) and now considering 423/1205 (removed 782) transitions.
// Phase 1: matrix 423 rows 506 cols
[2024-05-29 12:18:50] [INFO ] Computed 220 invariants in 3 ms
[2024-05-29 12:18:50] [INFO ] Implicit Places using invariants in 265 ms returned [489, 493]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 268 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/1345 places, 423/1205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 502 transition count 421
Applied a total of 4 rules in 38 ms. Remains 502 /504 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 502 cols
[2024-05-29 12:18:50] [INFO ] Computed 218 invariants in 3 ms
[2024-05-29 12:18:51] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-29 12:18:51] [INFO ] Invariant cache hit.
[2024-05-29 12:18:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:18:51] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 502/1345 places, 421/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1319 ms. Remains : 502/1345 places, 421/1205 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s223 0) (EQ s435 1)), p2:(EQ s125 1), p1:(OR (EQ s22 0) (EQ s258 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 451 ms.
Product exploration explored 100000 steps with 0 reset in 638 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 260 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 397 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 12:18:54] [INFO ] Invariant cache hit.
[2024-05-29 12:18:54] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 12:18:54] [INFO ] [Nat]Absence check using 218 positive place invariants in 32 ms returned sat
[2024-05-29 12:18:54] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 12:18:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:18:54] [INFO ] After 97ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 12:18:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:18:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-29 12:18:55] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 96 ms.
[2024-05-29 12:18:55] [INFO ] After 824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 46 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 502 transition count 421
Applied a total of 4 rules in 17 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 502/502 places, 421/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 214378 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 214378 steps, saw 148664 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2024-05-29 12:18:58] [INFO ] Computed 218 invariants in 6 ms
[2024-05-29 12:18:58] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 12:18:59] [INFO ] [Nat]Absence check using 218 positive place invariants in 34 ms returned sat
[2024-05-29 12:18:59] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 12:18:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:18:59] [INFO ] After 90ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 12:18:59] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-05-29 12:18:59] [INFO ] After 758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 61 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 11 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 502/502 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 9 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-05-29 12:18:59] [INFO ] Invariant cache hit.
[2024-05-29 12:18:59] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-29 12:18:59] [INFO ] Invariant cache hit.
[2024-05-29 12:19:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:19:00] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
[2024-05-29 12:19:00] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-29 12:19:00] [INFO ] Invariant cache hit.
[2024-05-29 12:19:00] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1024 ms. Remains : 502/502 places, 421/421 transitions.
Partial Free-agglomeration rule applied 113 times.
Drop transitions removed 113 transitions
Iterating global reduction 0 with 113 rules applied. Total rules applied 113 place count 502 transition count 421
Applied a total of 113 rules in 26 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2024-05-29 12:19:00] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 12:19:00] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 12:19:00] [INFO ] [Nat]Absence check using 218 positive place invariants in 33 ms returned sat
[2024-05-29 12:19:01] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 12:19:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 12:19:01] [INFO ] After 92ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 12:19:01] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:19:01] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:19:01] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:19:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 189 ms
[2024-05-29 12:19:01] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-29 12:19:01] [INFO ] After 469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-29 12:19:01] [INFO ] After 972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 274 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 15 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 502 cols
[2024-05-29 12:19:02] [INFO ] Computed 218 invariants in 1 ms
[2024-05-29 12:19:03] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-29 12:19:03] [INFO ] Invariant cache hit.
[2024-05-29 12:19:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:19:03] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2024-05-29 12:19:03] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-29 12:19:03] [INFO ] Invariant cache hit.
[2024-05-29 12:19:03] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1049 ms. Remains : 502/502 places, 421/421 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 331 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 12:19:04] [INFO ] Invariant cache hit.
[2024-05-29 12:19:04] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 12:19:05] [INFO ] [Nat]Absence check using 218 positive place invariants in 30 ms returned sat
[2024-05-29 12:19:05] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 12:19:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:19:05] [INFO ] After 94ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 12:19:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
[2024-05-29 12:19:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-29 12:19:05] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 101 ms.
[2024-05-29 12:19:05] [INFO ] After 788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 32 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 502 transition count 421
Applied a total of 4 rules in 24 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 502/502 places, 421/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 220413 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220413 steps, saw 153113 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2024-05-29 12:19:09] [INFO ] Computed 218 invariants in 1 ms
[2024-05-29 12:19:09] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 12:19:09] [INFO ] [Nat]Absence check using 218 positive place invariants in 35 ms returned sat
[2024-05-29 12:19:09] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 12:19:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:19:09] [INFO ] After 95ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 12:19:09] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-29 12:19:09] [INFO ] After 724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 57 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 8 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 502/502 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 8 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-05-29 12:19:09] [INFO ] Invariant cache hit.
[2024-05-29 12:19:10] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-29 12:19:10] [INFO ] Invariant cache hit.
[2024-05-29 12:19:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:19:10] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2024-05-29 12:19:10] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 12:19:10] [INFO ] Invariant cache hit.
[2024-05-29 12:19:10] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1007 ms. Remains : 502/502 places, 421/421 transitions.
Partial Free-agglomeration rule applied 113 times.
Drop transitions removed 113 transitions
Iterating global reduction 0 with 113 rules applied. Total rules applied 113 place count 502 transition count 421
Applied a total of 113 rules in 16 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2024-05-29 12:19:11] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 12:19:11] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 12:19:11] [INFO ] [Nat]Absence check using 218 positive place invariants in 32 ms returned sat
[2024-05-29 12:19:11] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 12:19:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 12:19:11] [INFO ] After 89ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 12:19:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:19:11] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:19:11] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 10 ms to minimize.
[2024-05-29 12:19:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 179 ms
[2024-05-29 12:19:11] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:19:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-29 12:19:11] [INFO ] After 456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-05-29 12:19:12] [INFO ] After 955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 286 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 452 ms.
Product exploration explored 100000 steps with 0 reset in 601 ms.
Built C files in :
/tmp/ltsmin735761517345924676
[2024-05-29 12:19:14] [INFO ] Computing symmetric may disable matrix : 421 transitions.
[2024-05-29 12:19:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:19:14] [INFO ] Computing symmetric may enable matrix : 421 transitions.
[2024-05-29 12:19:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:19:14] [INFO ] Computing Do-Not-Accords matrix : 421 transitions.
[2024-05-29 12:19:14] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:19:14] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin735761517345924676
Running compilation step : cd /tmp/ltsmin735761517345924676;'/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 1119 ms.
Running link step : cd /tmp/ltsmin735761517345924676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin735761517345924676;'/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/stateBased14890801980171040182.hoa' '--buchi-type=spotba'
LTSmin run took 3738 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-02 finished in 29035 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(p1)||p0)))'
Support contains 3 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1343 transition count 1203
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1343 transition count 1203
Applied a total of 4 rules in 82 ms. Remains 1343 /1345 variables (removed 2) and now considering 1203/1205 (removed 2) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2024-05-29 12:19:19] [INFO ] Computed 221 invariants in 9 ms
[2024-05-29 12:19:19] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-29 12:19:19] [INFO ] Invariant cache hit.
[2024-05-29 12:19:20] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1459 ms to find 0 implicit places.
[2024-05-29 12:19:20] [INFO ] Invariant cache hit.
[2024-05-29 12:19:21] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1343/1345 places, 1203/1205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2197 ms. Remains : 1343/1345 places, 1203/1205 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(EQ s1336 1), p0:(OR (EQ s154 0) (EQ s695 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 707 ms.
Product exploration explored 100000 steps with 50000 reset in 715 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-020B-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-04 finished in 3768 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 1 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1344 transition count 926
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1066 transition count 926
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 556 place count 1066 transition count 767
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 874 place count 907 transition count 767
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 877 place count 904 transition count 764
Iterating global reduction 2 with 3 rules applied. Total rules applied 880 place count 904 transition count 764
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 880 place count 904 transition count 761
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 886 place count 901 transition count 761
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 2 with 676 rules applied. Total rules applied 1562 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1563 place count 563 transition count 422
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1565 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1683 place count 503 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1685 place count 501 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1686 place count 500 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1686 place count 500 transition count 417
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1690 place count 498 transition count 417
Applied a total of 1690 rules in 157 ms. Remains 498 /1345 variables (removed 847) and now considering 417/1205 (removed 788) transitions.
// Phase 1: matrix 417 rows 498 cols
[2024-05-29 12:19:23] [INFO ] Computed 220 invariants in 1 ms
[2024-05-29 12:19:23] [INFO ] Implicit Places using invariants in 304 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 317 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1345 places, 417/1205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 415
Applied a total of 4 rules in 11 ms. Remains 494 /496 variables (removed 2) and now considering 415/417 (removed 2) transitions.
// Phase 1: matrix 415 rows 494 cols
[2024-05-29 12:19:23] [INFO ] Computed 218 invariants in 1 ms
[2024-05-29 12:19:23] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-29 12:19:23] [INFO ] Invariant cache hit.
[2024-05-29 12:19:24] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 494/1345 places, 415/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1214 ms. Remains : 494/1345 places, 415/1205 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s356 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 431 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-05 finished in 1701 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 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 1344 transition count 928
Reduce places removed 276 places and 0 transitions.
Iterating post reduction 1 with 276 rules applied. Total rules applied 552 place count 1068 transition count 928
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 552 place count 1068 transition count 770
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 868 place count 910 transition count 770
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 871 place count 907 transition count 767
Iterating global reduction 2 with 3 rules applied. Total rules applied 874 place count 907 transition count 767
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 874 place count 907 transition count 764
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 880 place count 904 transition count 764
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1560 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1561 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 1563 place count 563 transition count 422
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1677 place count 506 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1679 place count 504 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1680 place count 503 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1680 place count 503 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1684 place count 501 transition count 418
Applied a total of 1684 rules in 113 ms. Remains 501 /1345 variables (removed 844) and now considering 418/1205 (removed 787) transitions.
// Phase 1: matrix 418 rows 501 cols
[2024-05-29 12:19:24] [INFO ] Computed 220 invariants in 3 ms
[2024-05-29 12:19:25] [INFO ] Implicit Places using invariants in 301 ms returned [482, 486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 319 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/1345 places, 418/1205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 497 transition count 416
Applied a total of 4 rules in 12 ms. Remains 497 /499 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 497 cols
[2024-05-29 12:19:25] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 12:19:25] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-29 12:19:25] [INFO ] Invariant cache hit.
[2024-05-29 12:19:26] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 497/1345 places, 416/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1175 ms. Remains : 497/1345 places, 416/1205 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-06 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:(OR (EQ s494 0) (EQ s328 1))], 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 7625 reset in 447 ms.
Product exploration explored 100000 steps with 7721 reset in 484 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 118 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 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 127 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 416/416 transitions.
Applied a total of 0 rules in 10 ms. Remains 497 /497 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2024-05-29 12:19:27] [INFO ] Invariant cache hit.
[2024-05-29 12:19:27] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-29 12:19:27] [INFO ] Invariant cache hit.
[2024-05-29 12:19:28] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2024-05-29 12:19:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 12:19:28] [INFO ] Invariant cache hit.
[2024-05-29 12:19:28] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 997 ms. Remains : 497/497 places, 416/416 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 113 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)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 148 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7823 reset in 386 ms.
Product exploration explored 100000 steps with 7771 reset in 451 ms.
Built C files in :
/tmp/ltsmin6662171537766782282
[2024-05-29 12:19:29] [INFO ] Computing symmetric may disable matrix : 416 transitions.
[2024-05-29 12:19:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:19:29] [INFO ] Computing symmetric may enable matrix : 416 transitions.
[2024-05-29 12:19:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:19:29] [INFO ] Computing Do-Not-Accords matrix : 416 transitions.
[2024-05-29 12:19:29] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:19:29] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6662171537766782282
Running compilation step : cd /tmp/ltsmin6662171537766782282;'/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 856 ms.
Running link step : cd /tmp/ltsmin6662171537766782282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6662171537766782282;'/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/stateBased6691404182742435980.hoa' '--buchi-type=spotba'
LTSmin run took 3750 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-06 finished in 9781 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(X(F(G(p0))))))'
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1341 transition count 1201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1341 transition count 1201
Applied a total of 8 rules in 73 ms. Remains 1341 /1345 variables (removed 4) and now considering 1201/1205 (removed 4) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2024-05-29 12:19:34] [INFO ] Computed 221 invariants in 7 ms
[2024-05-29 12:19:35] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-29 12:19:35] [INFO ] Invariant cache hit.
[2024-05-29 12:19:36] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1488 ms to find 0 implicit places.
[2024-05-29 12:19:36] [INFO ] Invariant cache hit.
[2024-05-29 12:19:36] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1345 places, 1201/1205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2213 ms. Remains : 1341/1345 places, 1201/1205 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s777 0) (EQ s274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 695 ms.
Product exploration explored 100000 steps with 50000 reset in 703 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-020B-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-07 finished in 3757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1341 transition count 1201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1341 transition count 1201
Applied a total of 8 rules in 72 ms. Remains 1341 /1345 variables (removed 4) and now considering 1201/1205 (removed 4) transitions.
[2024-05-29 12:19:38] [INFO ] Invariant cache hit.
[2024-05-29 12:19:38] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-29 12:19:38] [INFO ] Invariant cache hit.
[2024-05-29 12:19:39] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
[2024-05-29 12:19:39] [INFO ] Invariant cache hit.
[2024-05-29 12:19:40] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1345 places, 1201/1205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2170 ms. Remains : 1341/1345 places, 1201/1205 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s36 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 511 ms.
Product exploration explored 100000 steps with 33333 reset in 518 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-020B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-10 finished in 3340 ms.
All properties solved by simple procedures.
Total runtime 75380 ms.

BK_STOP 1716985182673

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldPPPt-PT-020B"
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 ShieldPPPt-PT-020B, 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 r373-tall-171683789200397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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