About the Execution of ITS-Tools for DoubleExponent-PT-003
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1770.020 | 87723.00 | 92768.00 | 4072.20 | FFFFFFFFFFTTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875400413.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-003, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875400413
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 50K May 5 16:51 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 DoubleExponent-PT-003-00
FORMULA_NAME DoubleExponent-PT-003-01
FORMULA_NAME DoubleExponent-PT-003-02
FORMULA_NAME DoubleExponent-PT-003-03
FORMULA_NAME DoubleExponent-PT-003-04
FORMULA_NAME DoubleExponent-PT-003-05
FORMULA_NAME DoubleExponent-PT-003-06
FORMULA_NAME DoubleExponent-PT-003-07
FORMULA_NAME DoubleExponent-PT-003-08
FORMULA_NAME DoubleExponent-PT-003-09
FORMULA_NAME DoubleExponent-PT-003-10
FORMULA_NAME DoubleExponent-PT-003-11
FORMULA_NAME DoubleExponent-PT-003-12
FORMULA_NAME DoubleExponent-PT-003-13
FORMULA_NAME DoubleExponent-PT-003-14
FORMULA_NAME DoubleExponent-PT-003-15
=== Now, execution of the tool begins
BK_START 1620584581619
Running Version 0
[2021-05-09 18:23:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 18:23:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 18:23:04] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-09 18:23:04] [INFO ] Transformed 163 places.
[2021-05-09 18:23:04] [INFO ] Transformed 148 transitions.
[2021-05-09 18:23:04] [INFO ] Parsed PT model containing 163 places and 148 transitions in 115 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 18:23:04] [INFO ] Initial state test concluded for 2 properties.
FORMULA DoubleExponent-PT-003-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 163 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 159 transition count 148
Applied a total of 4 rules in 6768 ms. Remains 159 /163 variables (removed 4) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 159 cols
[2021-05-09 18:23:11] [INFO ] Computed 16 place invariants in 48 ms
[2021-05-09 18:23:11] [INFO ] Implicit Places using invariants in 284 ms returned [26, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 310 ms to find 2 implicit places.
// Phase 1: matrix 148 rows 157 cols
[2021-05-09 18:23:11] [INFO ] Computed 14 place invariants in 12 ms
[2021-05-09 18:23:11] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
Starting structural reductions, iteration 1 : 157/163 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 17 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:11] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-09 18:23:11] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:11] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-09 18:23:11] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 156/163 places, 147/148 transitions.
[2021-05-09 18:23:12] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 18:23:12] [INFO ] Flatten gal took : 47 ms
FORMULA DoubleExponent-PT-003-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 18:23:12] [INFO ] Flatten gal took : 19 ms
[2021-05-09 18:23:12] [INFO ] Input system was already deterministic with 147 transitions.
Incomplete random walk after 100000 steps, including 3304 resets, run finished after 307 ms. (steps per millisecond=325 ) properties (out of 30) seen :11
Running SMT prover for 19 properties.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:12] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:12] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:12] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-09 18:23:12] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-09 18:23:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:12] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:12] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-09 18:23:12] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:23:13] [INFO ] Added : 125 causal constraints over 25 iterations in 360 ms. Result :sat
[2021-05-09 18:23:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:13] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-09 18:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:13] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-09 18:23:13] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-09 18:23:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 18:23:13] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:13] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-09 18:23:13] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:23:13] [INFO ] Added : 140 causal constraints over 29 iterations in 345 ms. Result :sat
[2021-05-09 18:23:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:13] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:13] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
[2021-05-09 18:23:13] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2021-05-09 18:23:13] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:14] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-09 18:23:14] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:23:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:14] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:14] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-09 18:23:14] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-09 18:23:14] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 3 ms to minimize.
[2021-05-09 18:23:14] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2021-05-09 18:23:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2021-05-09 18:23:14] [INFO ] Added : 142 causal constraints over 29 iterations in 484 ms. Result :sat
[2021-05-09 18:23:14] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:14] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:14] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-09 18:23:14] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-09 18:23:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:23:14] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:14] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-09 18:23:14] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-09 18:23:15] [INFO ] Added : 139 causal constraints over 28 iterations in 346 ms. Result :sat
[2021-05-09 18:23:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:23:15] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-09 18:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:15] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-09 18:23:15] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:23:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:23:15] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:15] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-09 18:23:15] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:23:15] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2021-05-09 18:23:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-09 18:23:15] [INFO ] Added : 144 causal constraints over 30 iterations in 466 ms. Result :sat
[2021-05-09 18:23:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:15] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:15] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-09 18:23:16] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:23:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:23:16] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:23:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:16] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-09 18:23:16] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:23:16] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2021-05-09 18:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-09 18:23:16] [INFO ] Added : 144 causal constraints over 30 iterations in 474 ms. Result :sat
[2021-05-09 18:23:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-09 18:23:16] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 13 ms returned sat
[2021-05-09 18:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:16] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-09 18:23:16] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-09 18:23:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:23:16] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:23:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:16] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-09 18:23:16] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-09 18:23:17] [INFO ] Deduced a trap composed of 43 places in 24 ms of which 0 ms to minimize.
[2021-05-09 18:23:17] [INFO ] Deduced a trap composed of 37 places in 19 ms of which 0 ms to minimize.
[2021-05-09 18:23:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2021-05-09 18:23:17] [INFO ] Added : 139 causal constraints over 29 iterations in 459 ms. Result :sat
[2021-05-09 18:23:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:17] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-09 18:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:17] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-09 18:23:17] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2021-05-09 18:23:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2021-05-09 18:23:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:17] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:17] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-09 18:23:17] [INFO ] Deduced a trap composed of 35 places in 23 ms of which 1 ms to minimize.
[2021-05-09 18:23:17] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
[2021-05-09 18:23:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2021-05-09 18:23:17] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:23:17] [INFO ] Added : 144 causal constraints over 30 iterations in 347 ms. Result :sat
[2021-05-09 18:23:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:17] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:17] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-09 18:23:18] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:23:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:23:18] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:18] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-09 18:23:18] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:23:18] [INFO ] Added : 67 causal constraints over 14 iterations in 176 ms. Result :sat
[2021-05-09 18:23:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned unsat
[2021-05-09 18:23:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:18] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:18] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-09 18:23:18] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:23:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:18] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:18] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-09 18:23:18] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:23:18] [INFO ] Added : 135 causal constraints over 27 iterations in 322 ms. Result :sat
[2021-05-09 18:23:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:23:18] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:18] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-09 18:23:18] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 0 ms to minimize.
[2021-05-09 18:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-09 18:23:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:23:18] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:19] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-09 18:23:19] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
[2021-05-09 18:23:19] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 0 ms to minimize.
[2021-05-09 18:23:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2021-05-09 18:23:19] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-09 18:23:19] [INFO ] Added : 144 causal constraints over 30 iterations in 357 ms. Result :sat
[2021-05-09 18:23:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:19] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:19] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-09 18:23:19] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-09 18:23:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:23:19] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 18:23:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:19] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-09 18:23:19] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:23:20] [INFO ] Added : 143 causal constraints over 30 iterations in 382 ms. Result :sat
[2021-05-09 18:23:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:20] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:20] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-09 18:23:20] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:23:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:20] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:20] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2021-05-09 18:23:20] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:23:20] [INFO ] Added : 66 causal constraints over 14 iterations in 161 ms. Result :sat
[2021-05-09 18:23:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:23:20] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:20] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-09 18:23:20] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:23:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:23:20] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:20] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-09 18:23:20] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:23:20] [INFO ] Added : 71 causal constraints over 15 iterations in 162 ms. Result :sat
[2021-05-09 18:23:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:20] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:20] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
[2021-05-09 18:23:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:20] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:20] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-09 18:23:21] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:23:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:23:21] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:21] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-09 18:23:21] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-09 18:23:21] [INFO ] Added : 118 causal constraints over 24 iterations in 265 ms. Result :sat
[2021-05-09 18:23:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:23:21] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:21] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-09 18:23:21] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-09 18:23:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:23:21] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 18:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:21] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-09 18:23:21] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-09 18:23:21] [INFO ] Added : 120 causal constraints over 24 iterations in 311 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2021-05-09 18:23:21] [INFO ] Initial state test concluded for 2 properties.
FORMULA DoubleExponent-PT-003-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0&&X(p1)))||(F(p0)&&X(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:23] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:23] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:23] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:23] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:23] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:23] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DoubleExponent-PT-003-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(LT s135 1), p2:(GEQ s90 1), p1:(OR (LT s10 1) (LT s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 64496 steps with 2118 reset in 187 ms.
FORMULA DoubleExponent-PT-003-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-02 finished in 828 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U p1)||(X(G(p3))&&p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:23] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:23] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:23] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:24] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:24] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:24] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-003-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GEQ s48 1), p0:(AND (GEQ s51 1) (GEQ s65 1)), p2:(AND (GEQ s63 1) (GEQ s144 1)), p3:(OR (LT s63 1) (LT s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-04 finished in 505 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&(F(G(p1))||G((p2 U p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 155 transition count 113
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 122 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 120 transition count 111
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 70 place count 120 transition count 104
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 84 place count 113 transition count 104
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 140 place count 85 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 82 transition count 76
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 82 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 81 transition count 75
Applied a total of 148 rules in 34 ms. Remains 81 /156 variables (removed 75) and now considering 75/147 (removed 72) transitions.
// Phase 1: matrix 75 rows 81 cols
[2021-05-09 18:23:24] [INFO ] Computed 14 place invariants in 7 ms
[2021-05-09 18:23:24] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 75 rows 81 cols
[2021-05-09 18:23:24] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:23:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-09 18:23:24] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2021-05-09 18:23:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 75 rows 81 cols
[2021-05-09 18:23:24] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:23:24] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/156 places, 75/147 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s46 1) (GEQ s51 1)), p1:(AND (GEQ s53 1) (GEQ s64 1)), p2:(AND (GEQ s53 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-05 finished in 412 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:24] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:24] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:24] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:25] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:25] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:25] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s102 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-06 finished in 397 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U p1)||F((p0||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:25] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:25] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:25] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:25] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:25] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:23:25] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-003-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s99 1), p0:(GEQ s18 1), p2:(GEQ s93 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-07 finished in 455 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0||X(F((F(p2)&&p1))))) U (X(F(p4))&&p3)))], workingDir=/home/mcc/execution]
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:25] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:23:25] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:25] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:23:25] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:25] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:23:25] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p3) (NOT p4)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p4), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-003-09 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p4), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s42 1) (GEQ s134 1)), p0:(AND (GEQ s109 1) (GEQ s129 1)), p4:(AND (GEQ s42 1) (GEQ s134 1)), p1:(AND (GEQ s109 1) (GEQ s129 1)), p2:(GEQ s124 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-09 finished in 453 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((F((X(F(!p2))&&p1))||p0)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:26] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:23:26] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:26] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:26] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:26] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:23:26] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Running random walk in product with property : DoubleExponent-PT-003-11 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (LT s23 1) (LT s105 1)), p1:(AND (GEQ s6 1) (GEQ s88 1)), p2:(OR (LT s63 1) (LT s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 174 ms.
Product exploration explored 100000 steps with 25000 reset in 228 ms.
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Product exploration explored 100000 steps with 25000 reset in 148 ms.
Product exploration explored 100000 steps with 25000 reset in 131 ms.
Applying partial POR strategy [false, true, false, false, false, false]
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Support contains 6 out of 156 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 156/156 places, 147/147 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 156 transition count 147
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 33 place count 156 transition count 152
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 156 transition count 152
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 152 transition count 148
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 152 transition count 148
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 76 place count 152 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 151 transition count 153
Deduced a syphon composed of 63 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 151 transition count 153
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 151 transition count 181
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 144 transition count 167
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 144 transition count 167
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 98 rules in 42 ms. Remains 144 /156 variables (removed 12) and now considering 167/147 (removed -20) transitions.
[2021-05-09 18:23:27] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 167 rows 144 cols
[2021-05-09 18:23:27] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:27] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 144/156 places, 167/147 transitions.
Product exploration explored 100000 steps with 25000 reset in 168 ms.
Product exploration explored 100000 steps with 25000 reset in 171 ms.
[2021-05-09 18:23:28] [INFO ] Flatten gal took : 10 ms
[2021-05-09 18:23:28] [INFO ] Flatten gal took : 9 ms
[2021-05-09 18:23:28] [INFO ] Time to serialize gal into /tmp/LTL10741540007314739899.gal : 6 ms
[2021-05-09 18:23:28] [INFO ] Time to serialize properties into /tmp/LTL9342209401063616444.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10741540007314739899.gal, -t, CGAL, -LTL, /tmp/LTL9342209401063616444.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10741540007314739899.gal -t CGAL -LTL /tmp/LTL9342209401063616444.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("((p12<1)||(p52<1))")||(F(("((p104>=1)&&(p37>=1))")&&(X(F("((p159>=1)&&(p89>=1))"))))))))))
Formula 0 simplified : !XXX("((p12<1)||(p52<1))" | F("((p104>=1)&&(p37>=1))" & XF"((p159>=1)&&(p89>=1))"))
Detected timeout of ITS tools.
[2021-05-09 18:23:43] [INFO ] Flatten gal took : 9 ms
[2021-05-09 18:23:43] [INFO ] Applying decomposition
[2021-05-09 18:23:43] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2269536277779068712.txt, -o, /tmp/graph2269536277779068712.bin, -w, /tmp/graph2269536277779068712.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2269536277779068712.bin, -l, -1, -v, -w, /tmp/graph2269536277779068712.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 18:23:43] [INFO ] Decomposing Gal with order
[2021-05-09 18:23:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 18:23:43] [INFO ] Removed a total of 38 redundant transitions.
[2021-05-09 18:23:43] [INFO ] Flatten gal took : 98 ms
[2021-05-09 18:23:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2021-05-09 18:23:43] [INFO ] Time to serialize gal into /tmp/LTL12384452647042164844.gal : 17 ms
[2021-05-09 18:23:43] [INFO ] Time to serialize properties into /tmp/LTL13937275511628542129.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12384452647042164844.gal, -t, CGAL, -LTL, /tmp/LTL13937275511628542129.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12384452647042164844.gal -t CGAL -LTL /tmp/LTL13937275511628542129.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("((i4.i1.u34.p12<1)||(i4.i1.u42.p52<1))")||(F(("((i5.i2.u2.p104>=1)&&(i4.i1.u35.p37>=1))")&&(X(F("((i3.i1.u25.p159>=1)&&(i0.i0.u58.p89>=1))"))))))))))
Formula 0 simplified : !XXX("((i4.i1.u34.p12<1)||(i4.i1.u42.p52<1))" | F("((i5.i2.u2.p104>=1)&&(i4.i1.u35.p37>=1))" & XF"((i3.i1.u25.p159>=1)&&(i0.i0.u58.p89>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t3, t27, t40, t50, t53, t56, t59, t107, t119, t132, i0.t106, i0.t102, i0.i0.t43, i0.i0.t95, i0.i0.u29.t92, i1.t20, i1.i0.u8.t10, i1.i2.u11.t26, i2.t33, i2.i0.t32, i2.i2.u18.t39, i3.i1.u20.t15, i4.i1.t66, i4.i1.u33.t72, i5.t145, i5.i0.u51.t115, i5.i2.t135, i5.i2.t142, i5.i2.u59.t137, i6.t79, i6.u39.t85, i7.t112, i7.u55.t118, i8.t125, i8.u61.t131, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/111/35/146
Computing Next relation with stutter on 254172 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
868 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.70276,191632,1,0,287866,2724,2192,318752,199,9173,154959
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-003-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DoubleExponent-PT-003-11 finished in 26296 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 155 transition count 108
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 117 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 76 place count 117 transition count 102
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 111 transition count 102
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 146 place count 82 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 154 place count 78 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 77 transition count 72
Applied a total of 155 rules in 13 ms. Remains 77 /156 variables (removed 79) and now considering 72/147 (removed 75) transitions.
// Phase 1: matrix 72 rows 77 cols
[2021-05-09 18:23:52] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:23:52] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 72 rows 77 cols
[2021-05-09 18:23:52] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-09 18:23:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:23:52] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2021-05-09 18:23:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 77 cols
[2021-05-09 18:23:52] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:23:52] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 77/156 places, 72/147 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LT s38 1), p0:(GEQ s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-12 finished in 294 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||X((p1 U ((p1&&G(p0))||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:52] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:23:52] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:52] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-09 18:23:52] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 156 cols
[2021-05-09 18:23:52] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:23:52] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(LT s104 1), p0:(LT s128 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 62785 steps with 2070 reset in 80 ms.
FORMULA DoubleExponent-PT-003-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-13 finished in 480 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 155 transition count 107
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 116 transition count 107
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 78 place count 116 transition count 101
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 90 place count 110 transition count 101
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 146 place count 82 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 154 place count 78 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 77 transition count 72
Applied a total of 155 rules in 13 ms. Remains 77 /156 variables (removed 79) and now considering 72/147 (removed 75) transitions.
// Phase 1: matrix 72 rows 77 cols
[2021-05-09 18:23:53] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-09 18:23:53] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 72 rows 77 cols
[2021-05-09 18:23:53] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-09 18:23:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 18:23:53] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2021-05-09 18:23:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 77 cols
[2021-05-09 18:23:53] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-09 18:23:53] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 77/156 places, 72/147 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-15 automaton TGBA [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:(LT s33 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 13921 reset in 103 ms.
Product exploration explored 100000 steps with 13822 reset in 111 ms.
Graph (complete) has 228 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13810 reset in 94 ms.
Product exploration explored 100000 steps with 13747 reset in 104 ms.
[2021-05-09 18:23:54] [INFO ] Flatten gal took : 5 ms
[2021-05-09 18:23:54] [INFO ] Flatten gal took : 5 ms
[2021-05-09 18:23:54] [INFO ] Time to serialize gal into /tmp/LTL17651356454046138673.gal : 2 ms
[2021-05-09 18:23:54] [INFO ] Time to serialize properties into /tmp/LTL14379676584354696956.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17651356454046138673.gal, -t, CGAL, -LTL, /tmp/LTL14379676584354696956.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17651356454046138673.gal -t CGAL -LTL /tmp/LTL14379676584354696956.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p20<1)"))))
Formula 0 simplified : !GF"(p20<1)"
Reverse transition relation is NOT exact ! Due to transitions t31.t32, t41.t15, t42.t43, t50, t53, t56, t59, t61.t92, t94.t95, t102, t106, t107, t126.t137, t134.t135, t142, t145, t14.t2.t3, t4.t5.t6.t7.t8.t9.t16.t20, t18.t19.t10, t25.t27, t28.t11.t13.t29.t33, t38.t40, t117.t119, t130.t132, t139.t140.t141.t62.t66, t45.t55.t62.t66, t57.t58.t75.t79, t143.t144.t75.t79, t47.t48.t49.t108.t112, t96.t97.t98.t99.t100.t101.t108.t112, t51.t52.t121.t125, t103.t105.t121.t125, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/32/72
Computing Next relation with stutter on 254172 deadlock states
Detected timeout of ITS tools.
[2021-05-09 18:24:09] [INFO ] Flatten gal took : 5 ms
[2021-05-09 18:24:09] [INFO ] Applying decomposition
[2021-05-09 18:24:09] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4858124244787148330.txt, -o, /tmp/graph4858124244787148330.bin, -w, /tmp/graph4858124244787148330.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4858124244787148330.bin, -l, -1, -v, -w, /tmp/graph4858124244787148330.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 18:24:09] [INFO ] Decomposing Gal with order
[2021-05-09 18:24:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 18:24:09] [INFO ] Removed a total of 45 redundant transitions.
[2021-05-09 18:24:09] [INFO ] Flatten gal took : 11 ms
[2021-05-09 18:24:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2021-05-09 18:24:09] [INFO ] Time to serialize gal into /tmp/LTL15704622577734430449.gal : 2 ms
[2021-05-09 18:24:09] [INFO ] Time to serialize properties into /tmp/LTL13527293508974831132.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15704622577734430449.gal, -t, CGAL, -LTL, /tmp/LTL13527293508974831132.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15704622577734430449.gal -t CGAL -LTL /tmp/LTL13527293508974831132.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("(i2.i0.u7.p20<1)"))))
Formula 0 simplified : !GF"(i2.i0.u7.p20<1)"
Reverse transition relation is NOT exact ! Due to transitions t31_t32, t42_t43, t53, t59, t61_t92, t94_t95, t106, t14_t2_t3, t4_t5_t6_t7_t8_t9_t16_t20, t117_t119, t130_t132, t139_t140_t141_t62_t66, t45_t55_t62_t66, t57_t58_t75_t79, t143_t144_t75_t79, t47_t48_t49_t108_t109, t96_t97_t98_t99_t100_t101_t108_t109, t51_t52_t121_t125, t103_t105_t121_t125, u1.t18.t19.t10, i0.t25_t27, i0.t41_t15, i0.u5.t38.t40, i2.t134_t135, i2.t126_t137, i2.i0.t56, i2.i0.u9.t142, i2.i1.t145, i5.t102, i5.t50, i6.t107, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/38/31/69
Computing Next relation with stutter on 254172 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2678721549842453649
[2021-05-09 18:24:24] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2678721549842453649
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2678721549842453649]
Compilation finished in 408 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2678721549842453649]
Link finished in 40 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2678721549842453649]
LTSmin run took 3785 ms.
FORMULA DoubleExponent-PT-003-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-15 finished in 35291 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620584669342
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="DoubleExponent-PT-003"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-003, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875400413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;