Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814800754.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814800754
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.4K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 33K Mar 24 05:37 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-002-00
FORMULA_NAME DoubleExponent-PT-002-01
FORMULA_NAME DoubleExponent-PT-002-02
FORMULA_NAME DoubleExponent-PT-002-03
FORMULA_NAME DoubleExponent-PT-002-04
FORMULA_NAME DoubleExponent-PT-002-05
FORMULA_NAME DoubleExponent-PT-002-06
FORMULA_NAME DoubleExponent-PT-002-07
FORMULA_NAME DoubleExponent-PT-002-08
FORMULA_NAME DoubleExponent-PT-002-09
FORMULA_NAME DoubleExponent-PT-002-10
FORMULA_NAME DoubleExponent-PT-002-11
FORMULA_NAME DoubleExponent-PT-002-12
FORMULA_NAME DoubleExponent-PT-002-13
FORMULA_NAME DoubleExponent-PT-002-14
FORMULA_NAME DoubleExponent-PT-002-15

=== Now, execution of the tool begins

BK_START 1590133897052

[2020-05-22 07:51:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 07:51:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 07:51:38] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2020-05-22 07:51:38] [INFO ] Transformed 110 places.
[2020-05-22 07:51:38] [INFO ] Transformed 98 transitions.
[2020-05-22 07:51:38] [INFO ] Parsed PT model containing 110 places and 98 transitions in 69 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3329 resets, run finished after 191 ms. (steps per millisecond=523 ) properties seen :[1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0]
// Phase 1: matrix 98 rows 110 cols
[2020-05-22 07:51:38] [INFO ] Computed 14 place invariants in 8 ms
[2020-05-22 07:51:39] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2020-05-22 07:51:39] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:39] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2020-05-22 07:51:39] [INFO ] Deduced a trap composed of 18 places in 69 ms
[2020-05-22 07:51:39] [INFO ] Deduced a trap composed of 30 places in 43 ms
[2020-05-22 07:51:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2020-05-22 07:51:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:51:39] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:39] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-05-22 07:51:39] [INFO ] Deduced a trap composed of 18 places in 40 ms
[2020-05-22 07:51:39] [INFO ] Deduced a trap composed of 30 places in 29 ms
[2020-05-22 07:51:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2020-05-22 07:51:39] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-05-22 07:51:39] [INFO ] Added : 72 causal constraints over 15 iterations in 142 ms. Result :sat
[2020-05-22 07:51:39] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-22 07:51:39] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:39] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-05-22 07:51:39] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2020-05-22 07:51:39] [INFO ] Deduced a trap composed of 30 places in 27 ms
[2020-05-22 07:51:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2020-05-22 07:51:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 07:51:39] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:39] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-05-22 07:51:39] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2020-05-22 07:51:39] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2020-05-22 07:51:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2020-05-22 07:51:40] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 8 ms.
[2020-05-22 07:51:40] [INFO ] Added : 81 causal constraints over 17 iterations in 133 ms. Result :sat
[2020-05-22 07:51:40] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-22 07:51:40] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-22 07:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:40] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-22 07:51:40] [INFO ] Deduced a trap composed of 18 places in 27 ms
[2020-05-22 07:51:40] [INFO ] Deduced a trap composed of 30 places in 22 ms
[2020-05-22 07:51:40] [INFO ] Deduced a trap composed of 36 places in 20 ms
[2020-05-22 07:51:40] [INFO ] Deduced a trap composed of 53 places in 20 ms
[2020-05-22 07:51:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 121 ms
[2020-05-22 07:51:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 07:51:40] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-22 07:51:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:40] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-05-22 07:51:40] [INFO ] Deduced a trap composed of 18 places in 26 ms
[2020-05-22 07:51:40] [INFO ] Deduced a trap composed of 30 places in 20 ms
[2020-05-22 07:51:40] [INFO ] Deduced a trap composed of 36 places in 20 ms
[2020-05-22 07:51:40] [INFO ] Deduced a trap composed of 53 places in 19 ms
[2020-05-22 07:51:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 105 ms
[2020-05-22 07:51:40] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-05-22 07:51:40] [INFO ] Added : 95 causal constraints over 19 iterations in 133 ms. Result :sat
[2020-05-22 07:51:40] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-22 07:51:40] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:40] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-22 07:51:40] [INFO ] Deduced a trap composed of 46 places in 33 ms
[2020-05-22 07:51:40] [INFO ] Deduced a trap composed of 58 places in 28 ms
[2020-05-22 07:51:40] [INFO ] Deduced a trap composed of 44 places in 28 ms
[2020-05-22 07:51:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 121 ms
[2020-05-22 07:51:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-05-22 07:51:40] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-22 07:51:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:40] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2020-05-22 07:51:40] [INFO ] Deduced a trap composed of 55 places in 52 ms
[2020-05-22 07:51:41] [INFO ] Deduced a trap composed of 47 places in 42 ms
[2020-05-22 07:51:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2020-05-22 07:51:41] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-05-22 07:51:41] [INFO ] Added : 95 causal constraints over 19 iterations in 144 ms. Result :sat
[2020-05-22 07:51:41] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 07:51:41] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-05-22 07:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:41] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2020-05-22 07:51:41] [INFO ] Deduced a trap composed of 30 places in 36 ms
[2020-05-22 07:51:41] [INFO ] Deduced a trap composed of 18 places in 21 ms
[2020-05-22 07:51:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2020-05-22 07:51:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 07:51:41] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2020-05-22 07:51:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:41] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2020-05-22 07:51:41] [INFO ] Deduced a trap composed of 30 places in 42 ms
[2020-05-22 07:51:41] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2020-05-22 07:51:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2020-05-22 07:51:41] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-05-22 07:51:41] [INFO ] Added : 93 causal constraints over 19 iterations in 208 ms. Result :sat
[2020-05-22 07:51:41] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 07:51:41] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-05-22 07:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:41] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-05-22 07:51:41] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2020-05-22 07:51:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2020-05-22 07:51:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:51:41] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:51:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:42] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2020-05-22 07:51:42] [INFO ] Deduced a trap composed of 30 places in 34 ms
[2020-05-22 07:51:42] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2020-05-22 07:51:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2020-05-22 07:51:42] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-05-22 07:51:42] [INFO ] Added : 93 causal constraints over 19 iterations in 136 ms. Result :sat
[2020-05-22 07:51:42] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
[2020-05-22 07:51:42] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned unsat
[2020-05-22 07:51:42] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-05-22 07:51:42] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:42] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-05-22 07:51:42] [INFO ] Deduced a trap composed of 18 places in 48 ms
[2020-05-22 07:51:42] [INFO ] Deduced a trap composed of 30 places in 41 ms
[2020-05-22 07:51:42] [INFO ] Deduced a trap composed of 45 places in 35 ms
[2020-05-22 07:51:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2020-05-22 07:51:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-22 07:51:42] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:42] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2020-05-22 07:51:42] [INFO ] Deduced a trap composed of 18 places in 36 ms
[2020-05-22 07:51:42] [INFO ] Deduced a trap composed of 45 places in 35 ms
[2020-05-22 07:51:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2020-05-22 07:51:42] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 8 ms.
[2020-05-22 07:51:42] [INFO ] Added : 81 causal constraints over 17 iterations in 162 ms. Result :sat
[2020-05-22 07:51:42] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-22 07:51:42] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:43] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2020-05-22 07:51:43] [INFO ] Deduced a trap composed of 18 places in 35 ms
[2020-05-22 07:51:43] [INFO ] Deduced a trap composed of 30 places in 49 ms
[2020-05-22 07:51:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2020-05-22 07:51:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:51:43] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:51:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:43] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2020-05-22 07:51:43] [INFO ] Deduced a trap composed of 18 places in 35 ms
[2020-05-22 07:51:43] [INFO ] Deduced a trap composed of 30 places in 72 ms
[2020-05-22 07:51:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2020-05-22 07:51:43] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-05-22 07:51:43] [INFO ] Added : 72 causal constraints over 15 iterations in 121 ms. Result :sat
[2020-05-22 07:51:43] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-22 07:51:43] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:51:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:43] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2020-05-22 07:51:43] [INFO ] Deduced a trap composed of 18 places in 29 ms
[2020-05-22 07:51:43] [INFO ] Deduced a trap composed of 30 places in 27 ms
[2020-05-22 07:51:43] [INFO ] Deduced a trap composed of 54 places in 33 ms
[2020-05-22 07:51:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 111 ms
[2020-05-22 07:51:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:51:43] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:51:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:43] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2020-05-22 07:51:43] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2020-05-22 07:51:43] [INFO ] Deduced a trap composed of 30 places in 49 ms
[2020-05-22 07:51:43] [INFO ] Deduced a trap composed of 54 places in 41 ms
[2020-05-22 07:51:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2020-05-22 07:51:43] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 8 ms.
[2020-05-22 07:51:44] [INFO ] Added : 72 causal constraints over 15 iterations in 155 ms. Result :sat
[2020-05-22 07:51:44] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-22 07:51:44] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:44] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-05-22 07:51:44] [INFO ] Deduced a trap composed of 18 places in 41 ms
[2020-05-22 07:51:44] [INFO ] Deduced a trap composed of 30 places in 38 ms
[2020-05-22 07:51:44] [INFO ] Deduced a trap composed of 54 places in 35 ms
[2020-05-22 07:51:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 135 ms
[2020-05-22 07:51:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-05-22 07:51:44] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:51:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:44] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2020-05-22 07:51:44] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2020-05-22 07:51:44] [INFO ] Deduced a trap composed of 30 places in 67 ms
[2020-05-22 07:51:44] [INFO ] Deduced a trap composed of 54 places in 48 ms
[2020-05-22 07:51:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 187 ms
[2020-05-22 07:51:44] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 8 ms.
[2020-05-22 07:51:44] [INFO ] Added : 72 causal constraints over 15 iterations in 173 ms. Result :sat
[2020-05-22 07:51:44] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 07:51:44] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2020-05-22 07:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:44] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2020-05-22 07:51:44] [INFO ] Deduced a trap composed of 18 places in 46 ms
[2020-05-22 07:51:45] [INFO ] Deduced a trap composed of 30 places in 56 ms
[2020-05-22 07:51:45] [INFO ] Deduced a trap composed of 54 places in 37 ms
[2020-05-22 07:51:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 162 ms
[2020-05-22 07:51:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-22 07:51:45] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-05-22 07:51:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:45] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2020-05-22 07:51:45] [INFO ] Deduced a trap composed of 30 places in 32 ms
[2020-05-22 07:51:45] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2020-05-22 07:51:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2020-05-22 07:51:45] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 8 ms.
[2020-05-22 07:51:45] [INFO ] Added : 91 causal constraints over 19 iterations in 209 ms. Result :sat
[2020-05-22 07:51:45] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-22 07:51:45] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:51:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:45] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2020-05-22 07:51:45] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-05-22 07:51:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 28 ms returned sat
[2020-05-22 07:51:45] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 10 ms returned sat
[2020-05-22 07:51:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:45] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2020-05-22 07:51:45] [INFO ] Deduced a trap composed of 38 places in 44 ms
[2020-05-22 07:51:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2020-05-22 07:51:45] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 8 ms.
[2020-05-22 07:51:46] [INFO ] Added : 87 causal constraints over 18 iterations in 216 ms. Result :sat
[2020-05-22 07:51:46] [INFO ] Deduced a trap composed of 18 places in 36 ms
[2020-05-22 07:51:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2020-05-22 07:51:46] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 07:51:46] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2020-05-22 07:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:46] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2020-05-22 07:51:46] [INFO ] Deduced a trap composed of 30 places in 33 ms
[2020-05-22 07:51:46] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2020-05-22 07:51:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2020-05-22 07:51:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 26 ms returned sat
[2020-05-22 07:51:46] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-05-22 07:51:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:46] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2020-05-22 07:51:46] [INFO ] Deduced a trap composed of 30 places in 44 ms
[2020-05-22 07:51:46] [INFO ] Deduced a trap composed of 18 places in 38 ms
[2020-05-22 07:51:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2020-05-22 07:51:46] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-05-22 07:51:46] [INFO ] Added : 93 causal constraints over 19 iterations in 191 ms. Result :sat
[2020-05-22 07:51:46] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-22 07:51:46] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:46] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-05-22 07:51:46] [INFO ] Deduced a trap composed of 18 places in 41 ms
[2020-05-22 07:51:47] [INFO ] Deduced a trap composed of 45 places in 53 ms
[2020-05-22 07:51:47] [INFO ] Deduced a trap composed of 70 places in 41 ms
[2020-05-22 07:51:47] [INFO ] Deduced a trap composed of 44 places in 42 ms
[2020-05-22 07:51:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 215 ms
[2020-05-22 07:51:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:51:47] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-05-22 07:51:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:47] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2020-05-22 07:51:47] [INFO ] Deduced a trap composed of 18 places in 36 ms
[2020-05-22 07:51:47] [INFO ] Deduced a trap composed of 33 places in 32 ms
[2020-05-22 07:51:47] [INFO ] Deduced a trap composed of 45 places in 31 ms
[2020-05-22 07:51:47] [INFO ] Deduced a trap composed of 70 places in 33 ms
[2020-05-22 07:51:47] [INFO ] Deduced a trap composed of 44 places in 33 ms
[2020-05-22 07:51:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 204 ms
[2020-05-22 07:51:47] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-05-22 07:51:47] [INFO ] Added : 95 causal constraints over 19 iterations in 169 ms. Result :sat
[2020-05-22 07:51:47] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 07:51:47] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 10 ms returned sat
[2020-05-22 07:51:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:47] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2020-05-22 07:51:47] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2020-05-22 07:51:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2020-05-22 07:51:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-05-22 07:51:47] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-05-22 07:51:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:47] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2020-05-22 07:51:47] [INFO ] Deduced a trap composed of 18 places in 27 ms
[2020-05-22 07:51:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2020-05-22 07:51:47] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-05-22 07:51:48] [INFO ] Added : 81 causal constraints over 17 iterations in 163 ms. Result :sat
[2020-05-22 07:51:48] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 07:51:48] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-05-22 07:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:48] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2020-05-22 07:51:48] [INFO ] Deduced a trap composed of 18 places in 36 ms
[2020-05-22 07:51:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2020-05-22 07:51:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 07:51:48] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-22 07:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:48] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2020-05-22 07:51:48] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2020-05-22 07:51:48] [INFO ] Deduced a trap composed of 25 places in 35 ms
[2020-05-22 07:51:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2020-05-22 07:51:48] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 8 ms.
[2020-05-22 07:51:48] [INFO ] Added : 58 causal constraints over 12 iterations in 139 ms. Result :sat
[2020-05-22 07:51:48] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-05-22 07:51:48] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 9 ms returned sat
[2020-05-22 07:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:48] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2020-05-22 07:51:48] [INFO ] Deduced a trap composed of 18 places in 24 ms
[2020-05-22 07:51:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2020-05-22 07:51:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 07:51:48] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-22 07:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:48] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-05-22 07:51:48] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2020-05-22 07:51:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2020-05-22 07:51:48] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-05-22 07:51:49] [INFO ] Added : 95 causal constraints over 19 iterations in 164 ms. Result :sat
[2020-05-22 07:51:49] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 07:51:49] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-05-22 07:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:49] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2020-05-22 07:51:49] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2020-05-22 07:51:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2020-05-22 07:51:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:51:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 07:51:49] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-22 07:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:51:49] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2020-05-22 07:51:49] [INFO ] Deduced a trap composed of 18 places in 35 ms
[2020-05-22 07:51:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2020-05-22 07:51:49] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-05-22 07:51:49] [INFO ] Added : 94 causal constraints over 19 iterations in 173 ms. Result :sat
[2020-05-22 07:51:49] [INFO ] Deduced a trap composed of 46 places in 37 ms
[2020-05-22 07:51:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-22 07:51:49] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-22 07:51:49] [INFO ] Flatten gal took : 43 ms
FORMULA DoubleExponent-PT-002-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 07:51:49] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 07:51:49] [INFO ] Applying decomposition
[2020-05-22 07:51:49] [INFO ] Flatten gal took : 20 ms
[2020-05-22 07:51:49] [INFO ] Input system was already deterministic with 98 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph7672163178625417265.txt, -o, /tmp/graph7672163178625417265.bin, -w, /tmp/graph7672163178625417265.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph7672163178625417265.bin, -l, -1, -v, -w, /tmp/graph7672163178625417265.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 98 rows 110 cols
[2020-05-22 07:51:49] [INFO ] Computed 14 place invariants in 3 ms
inv : p1 + p14 + p15 + p16 + p17 + p18 + p19 + p2 + p20 + p21 + p22 + p23 + p24 + p25 + p3 + p4 + p5 + p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 = 1
inv : 2*p1 + p10 + p100 + p11 + p17 + 2*p2 + p29 + p3 + p32 + p4 + p5 = 2
inv : p69 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 = 0
inv : -p102 - p19 - p20 + p55 - p57 + p58 - p60 + p62 + p81 + p88 + p91 + p93 = 0
inv : p108 - p110 - p66 - p67 = 0
inv : 3*p1 + p100 + p101 + p102 + p103 + p105 + p107 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 3*p2 + p20 + p21 + p23 + p25 + p26 + p27 + p28 + p29 + 3*p3 + p30 + p31 + p32 + p33 + p35 + p37 + p38 + p39 + 2*p4 + p40 + p41 + p42 + p43 + p44 + p45 + p47 + p49 + 2*p5 + p50 + 2*p51 + p52 + 2*p53 + p54 + 2*p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p96 + p97 + p98 + p99 = 3
inv : p71 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 = 0
inv : p1 + p100 + p101 + p102 + p103 + p105 + p106 + p107 + p14 + p15 + p16 + p17 + p18 + p19 + p2 + p20 + p21 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p3 + p30 + p31 + p32 + p33 + p34 + p35 + p37 + p4 - p48 + p5 + p50 + p51 + p52 + p53 + p54 + p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p96 + p97 + p98 + p99 = 1
inv : p1 + p100 + p101 + p102 + p103 + p105 + p107 + p14 + p15 + p16 + p17 + p18 + p19 + p2 + p20 + p21 + p23 + p25 + p26 + p27 + p28 + p29 + p3 + p30 + p31 + p32 + p33 + p34 + p35 + p37 + p38 + p39 + p4 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p49 + p5 + p50 + p51 + p52 + p53 + p54 + p6 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p7 + p70 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p96 + p97 + p98 + p99 = 1
inv : -p102 - p20 + p56 - p57 + p59 - p60 + p64 + p76 + p79 + p81 + p93 = 0
inv : -p1 + p104 - p14 - p15 - p16 - p17 - p18 - p19 - p2 - p20 - p21 - p23 - p24 - p25 - p26 - p27 - p28 - p29 - p3 - p30 - p31 - p32 - p33 - p34 - p35 - p37 - p4 + p48 - p5 - p50 - p51 - p52 - p53 - p54 - p6 - p61 - p62 - p63 - p64 - p65 - p66 - p67 - p68 - p7 - p70 - p72 - p73 - p74 - p75 - p76 - p77 - p78 - p79 - p80 - p81 - p82 - p83 - p84 - p85 - p86 - p87 - p88 - p89 - p90 - p91 - p92 - p93 - p94 - p95 - p96 = -1
inv : p109 - p110 - p67 = 0
inv : p36 + p48 - p50 - p51 - p52 - p53 - p54 = 0
inv : 2*p1 + p15 + p2 + p3 + p4 + p41 + p44 + p8 + p9 + p98 = 2
Total of 14 invariants.
[2020-05-22 07:51:49] [INFO ] Computed 14 place invariants in 7 ms
[2020-05-22 07:51:49] [INFO ] Decomposing Gal with order
[2020-05-22 07:51:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 07:51:50] [INFO ] Removed a total of 25 redundant transitions.
[2020-05-22 07:51:50] [INFO ] Flatten gal took : 43 ms
[2020-05-22 07:51:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2020-05-22 07:51:50] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
[2020-05-22 07:51:50] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.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.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((!(X((X(!(F("(i6.i0.u8.p2>=1)"))))&&(F("(i2.u18.p39>=1)"))))))
Formula 0 simplified : X(X!F"(i6.i0.u8.p2>=1)" & F"(i2.u18.p39>=1)")
[2020-05-22 07:51:50] [INFO ] Proved 110 variables to be positive in 188 ms
[2020-05-22 07:51:50] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2020-05-22 07:51:50] [INFO ] Computation of disable matrix completed :0/98 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
built 22 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
[2020-05-22 07:51:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:51:50] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2020-05-22 07:51:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
built 12 ordering constraints for composite.
built 18 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 14 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t19, t51, t73, t85, t88, t9, t94, t97, i0.t16, i1.t25, i1.u14.t30, i2.t37, i2.u20.t42, i3.t58, i3.i2.t67, i3.i2.u37.t72, i4.t61, i4.i0.u11.t49, i6.i1.u5.t7, i7.t79, i7.u41.t84, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/21/96
Computing Next relation with stutter on 396 deadlock states
[2020-05-22 07:51:50] [INFO ] Computing symmetric co enabling matrix : 98 transitions.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
214 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,2.16935,86924,1,0,124640,841,1689,113004,162,3467,426405
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F(!(X("((i3.i0.u26.p59>=1)&&(i3.i2.u37.p78>=1))"))))||((!(F("(i3.i0.u26.p79>=1)")))U("(i2.u18.p39>=1)"))))
Formula 1 simplified : !(F!X"((i3.i0.u26.p59>=1)&&(i3.i2.u37.p78>=1))" | (!F"(i3.i0.u26.p79>=1)" U "(i2.u18.p39>=1)"))
Computing Next relation with stutter on 396 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 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,2.17204,87944,1,0,124640,841,1738,113004,166,3467,426459
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(((!(G(("(i0.i1.u6.p18>=1)")U("((i5.u1.p104>=1)&&(i1.u16.p37>=1))"))))||("(i4.i1.u29.p71<1)"))||("(i4.i0.u11.p89<1)")))))
Formula 2 simplified : !FG("(i4.i0.u11.p89<1)" | "(i4.i1.u29.p71<1)" | !G("(i0.i1.u6.p18>=1)" U "((i5.u1.p104>=1)&&(i1.u16.p37>=1))"))
Computing Next relation with stutter on 396 deadlock states
[2020-05-22 07:51:53] [INFO ] Computation of co-enabling matrix(44/98) took 2210 ms. Total solver calls (SAT/UNSAT): 3375(4/3371)
886 unique states visited
0 strongly connected components in search stack
886 transitions explored
886 items max in DFS search stack
181 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,3.9871,119968,1,0,158588,858,1852,181674,167,3564,625598
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(F((((!(G("((i6.i1.u5.p14>=1)&&(i6.i1.u34.p8>=1))")))U((F("(i7.u39.p86>=1)"))&&(X(G("((i1.u16.p36>=1)&&(i1.u17.p54>=1))")))))&&("(i1.u16.p36>=1)"))&&("(i1.u17.p54>=1)")))))
Formula 3 simplified : F("(i1.u16.p36>=1)" & "(i1.u17.p54>=1)" & (!G"((i6.i1.u5.p14>=1)&&(i6.i1.u34.p8>=1))" U (F"(i7.u39.p86>=1)" & XG"((i1.u16.p36>=1)&&(i1.u17.p54>=1))")))
Computing Next relation with stutter on 396 deadlock states
[2020-05-22 07:51:55] [INFO ] Computation of Finished co-enabling matrix. took 4310 ms. Total solver calls (SAT/UNSAT): 4753(8/4745)
[2020-05-22 07:51:55] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2020-05-22 07:51:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:51:55] [INFO ] Built C files in 5454ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 1549 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 67 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( <>(( ( (!( []((LTLAP8==true))) )U(( <>((LTLAP9==true)) ) && ( X([]((LTLAP10==true))) )) ) && ( (LTLAP11==true) ) ) && ( (LTLAP12==true) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( <>(( ( (!( []((LTLAP8==true))) )U(( <>((LTLAP9==true)) ) && ( X([]((LTLAP10==true))) )) ) && ( (LTLAP11==true) ) ) && ( (LTLAP12==true) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( <>(( ( (!( []((LTLAP8==true))) )U(( <>((LTLAP9==true)) ) && ( X([]((LTLAP10==true))) )) ) && ( (LTLAP11==true) ) ) && ( (LTLAP12==true) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
4820 unique states visited
0 strongly connected components in search stack
6519 transitions explored
886 items max in DFS search stack
611 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,10.0958,277184,1,0,385105,858,2022,393966,168,3565,1472294
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(G(!(F(X("(i0.i1.u7.p21>=1)")))))))
Formula 4 simplified : G!FX"(i0.i1.u7.p21>=1)"
Computing Next relation with stutter on 396 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 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,10.1044,277448,1,0,385241,858,2058,394107,168,3565,1473362
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(F(G(F((F(((F("((i3.i1.u30.p69>=1)&&(i3.i0.u33.p77>=1))"))&&("(i5.u35.p57>=1)"))&&("(i5.u36.p81>=1)")))||("(i3.i2.u31.p73<1)")))))))
Formula 5 simplified : FGF("(i3.i2.u31.p73<1)" | F("(i5.u35.p57>=1)" & "(i5.u36.p81>=1)" & F"((i3.i1.u30.p69>=1)&&(i3.i0.u33.p77>=1))"))
Computing Next relation with stutter on 396 deadlock states
271 unique states visited
271 strongly connected components in search stack
271 transitions explored
271 items max in DFS search stack
149 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,11.604,304360,1,0,423435,858,2145,433383,168,3565,1641358
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(X((!(X(X(X("(((i4.i1.u2.p107<1)||(i4.i1.u38.p83<1))&&(i3.i2.u31.p74<1))")))))U("(((i4.i1.u2.p107>=1)&&(i4.i1.u38.p83>=1))||((i0.i0.u13.p10>=1)&&(i0.i0.u45.p99>=1)))")))))
Formula 6 simplified : X(!XXX"(((i4.i1.u2.p107<1)||(i4.i1.u38.p83<1))&&(i3.i2.u31.p74<1))" U "(((i4.i1.u2.p107>=1)&&(i4.i1.u38.p83>=1))||((i0.i0.u13.p10>=1)&&(i0.i0.u45.p99>=1)))")
Computing Next relation with stutter on 396 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
1 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,11.607,304624,1,0,423443,858,2200,433384,168,3565,1641530
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F((G(X("((i7.u24.p55>=1)&&(i7.u39.p87>=1))")))U("(i2.u20.p47<1)")))))
Formula 7 simplified : !XF(GX"((i7.u24.p55>=1)&&(i7.u39.p87>=1))" U "(i2.u20.p47<1)")
Computing Next relation with stutter on 396 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 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,11.6077,304624,1,0,423443,858,2219,433384,168,3565,1641543
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((X(!(G("((i0.i0.u0.p11>=1)&&(i1.u14.p31>=1))"))))&&("((i0.i0.u0.p11<1)||(i1.u14.p31<1))"))))
Formula 8 simplified : !X("((i0.i0.u0.p11<1)||(i1.u14.p31<1))" & X!G"((i0.i0.u0.p11>=1)&&(i1.u14.p31>=1))")
Computing Next relation with stutter on 396 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 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,11.6087,304624,1,0,423443,858,2251,433384,168,3565,1641589
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(X("((i7.u41.p94>=1)||(i0.i1.u6.p17>=1))"))))
Formula 9 simplified : !GX"((i7.u41.p94>=1)||(i0.i1.u6.p17>=1))"
Computing Next relation with stutter on 396 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 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,11.6224,304624,1,0,423550,858,2268,433606,168,3565,1642094
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(F((G((G(F("((i4.i0.u10.p24>=1)&&(i4.i0.u21.p49>=1))")))U("((i6.i0.u4.p13>=1)&&(i2.u19.p46>=1))")))U(!(F(X("((i6.i0.u4.p13>=1)&&(i2.u19.p46>=1))"))))))))
Formula 10 simplified : F(G(GF"((i4.i0.u10.p24>=1)&&(i4.i0.u21.p49>=1))" U "((i6.i0.u4.p13>=1)&&(i2.u19.p46>=1))") U !FX"((i6.i0.u4.p13>=1)&&(i2.u19.p46>=1))")
Computing Next relation with stutter on 396 deadlock states
888 unique states visited
888 strongly connected components in search stack
889 transitions explored
888 items max in DFS search stack
0 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,11.6295,304624,1,0,423556,858,2285,433612,168,3565,1643634
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DoubleExponent-PT-002-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(X((F(X("(i0.i1.u6.p17>=1)")))&&(X(G("((i4.i1.u2.p107>=1)&&(i4.i1.u43.p95>=1))")))))))
Formula 11 simplified : X(FX"(i0.i1.u6.p17>=1)" & XG"((i4.i1.u2.p107>=1)&&(i4.i1.u43.p95>=1))")
Computing Next relation with stutter on 396 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 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,11.6309,304888,1,0,423556,858,2320,433612,168,3565,1643652
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590133923518

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-002"
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"

# 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-002, 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 r066-tajo-158922814800754"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;