fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r051-ebro-158902546000292
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DES-PT-40a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.850 2899006.00 2957547.00 1036.90 F??????????????? normal

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.r051-ebro-158902546000292.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 DES-PT-40a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546000292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 3.0K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 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 83K 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 DES-PT-40a-CTLFireability-00
FORMULA_NAME DES-PT-40a-CTLFireability-01
FORMULA_NAME DES-PT-40a-CTLFireability-02
FORMULA_NAME DES-PT-40a-CTLFireability-03
FORMULA_NAME DES-PT-40a-CTLFireability-04
FORMULA_NAME DES-PT-40a-CTLFireability-05
FORMULA_NAME DES-PT-40a-CTLFireability-06
FORMULA_NAME DES-PT-40a-CTLFireability-07
FORMULA_NAME DES-PT-40a-CTLFireability-08
FORMULA_NAME DES-PT-40a-CTLFireability-09
FORMULA_NAME DES-PT-40a-CTLFireability-10
FORMULA_NAME DES-PT-40a-CTLFireability-11
FORMULA_NAME DES-PT-40a-CTLFireability-12
FORMULA_NAME DES-PT-40a-CTLFireability-13
FORMULA_NAME DES-PT-40a-CTLFireability-14
FORMULA_NAME DES-PT-40a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589549848077

[2020-05-15 13:37:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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-15 13:37:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 13:37:31] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2020-05-15 13:37:31] [INFO ] Transformed 274 places.
[2020-05-15 13:37:31] [INFO ] Transformed 231 transitions.
[2020-05-15 13:37:31] [INFO ] Found NUPN structural information;
[2020-05-15 13:37:31] [INFO ] Parsed PT model containing 274 places and 231 transitions in 236 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 60 ms.
Incomplete random walk after 100000 steps, including 2259 resets, run finished after 819 ms. (steps per millisecond=122 ) properties seen :[0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0]
// Phase 1: matrix 217 rows 274 cols
[2020-05-15 13:37:32] [INFO ] Computed 59 place invariants in 56 ms
[2020-05-15 13:37:33] [INFO ] [Real]Absence check using 34 positive place invariants in 69 ms returned sat
[2020-05-15 13:37:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 53 ms returned sat
[2020-05-15 13:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:33] [INFO ] [Real]Absence check using state equation in 231 ms returned unsat
[2020-05-15 13:37:33] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 13:37:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2020-05-15 13:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:34] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2020-05-15 13:37:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:37:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 58 ms returned sat
[2020-05-15 13:37:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 110 ms returned sat
[2020-05-15 13:37:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:35] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2020-05-15 13:37:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 13:37:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-05-15 13:37:35] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 49 ms.
[2020-05-15 13:37:37] [INFO ] Added : 199 causal constraints over 41 iterations in 2149 ms. Result :sat
[2020-05-15 13:37:37] [INFO ] Deduced a trap composed of 11 places in 126 ms
[2020-05-15 13:37:37] [INFO ] Deduced a trap composed of 13 places in 87 ms
[2020-05-15 13:37:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 367 ms
[2020-05-15 13:37:37] [INFO ] [Real]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-05-15 13:37:37] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2020-05-15 13:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:38] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2020-05-15 13:37:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:37:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 53 ms returned sat
[2020-05-15 13:37:38] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 61 ms returned sat
[2020-05-15 13:37:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:39] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2020-05-15 13:37:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 13:37:39] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 62 ms.
[2020-05-15 13:37:42] [INFO ] Added : 213 causal constraints over 43 iterations in 2540 ms. Result :sat
[2020-05-15 13:37:42] [INFO ] Deduced a trap composed of 16 places in 88 ms
[2020-05-15 13:37:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2020-05-15 13:37:42] [INFO ] [Real]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-05-15 13:37:42] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 45 ms returned sat
[2020-05-15 13:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:42] [INFO ] [Real]Absence check using state equation in 351 ms returned unsat
[2020-05-15 13:37:42] [INFO ] [Real]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-05-15 13:37:42] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2020-05-15 13:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:43] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2020-05-15 13:37:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:37:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 32 ms returned sat
[2020-05-15 13:37:43] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 45 ms returned sat
[2020-05-15 13:37:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:44] [INFO ] [Nat]Absence check using state equation in 785 ms returned sat
[2020-05-15 13:37:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 13:37:44] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 36 ms.
[2020-05-15 13:37:46] [INFO ] Added : 184 causal constraints over 37 iterations in 1903 ms. Result :sat
[2020-05-15 13:37:46] [INFO ] Deduced a trap composed of 19 places in 78 ms
[2020-05-15 13:37:46] [INFO ] Deduced a trap composed of 17 places in 125 ms
[2020-05-15 13:37:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2020-05-15 13:37:46] [INFO ] [Real]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-05-15 13:37:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2020-05-15 13:37:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:47] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2020-05-15 13:37:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:37:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 56 ms returned sat
[2020-05-15 13:37:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 48 ms returned sat
[2020-05-15 13:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:48] [INFO ] [Nat]Absence check using state equation in 819 ms returned sat
[2020-05-15 13:37:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 13:37:48] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 50 ms.
[2020-05-15 13:37:51] [INFO ] Added : 163 causal constraints over 33 iterations in 2526 ms. Result :sat
[2020-05-15 13:37:51] [INFO ] Deduced a trap composed of 9 places in 184 ms
[2020-05-15 13:37:51] [INFO ] Deduced a trap composed of 17 places in 169 ms
[2020-05-15 13:37:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 504 ms
[2020-05-15 13:37:51] [INFO ] [Real]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-05-15 13:37:51] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 48 ms returned sat
[2020-05-15 13:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:52] [INFO ] [Real]Absence check using state equation in 1040 ms returned sat
[2020-05-15 13:37:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:37:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 46 ms returned sat
[2020-05-15 13:37:53] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 195 ms returned sat
[2020-05-15 13:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:54] [INFO ] [Nat]Absence check using state equation in 1228 ms returned sat
[2020-05-15 13:37:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-05-15 13:37:54] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 46 ms.
[2020-05-15 13:37:56] [INFO ] Added : 131 causal constraints over 27 iterations in 1554 ms. Result :sat
[2020-05-15 13:37:56] [INFO ] Deduced a trap composed of 19 places in 102 ms
[2020-05-15 13:37:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2020-05-15 13:37:56] [INFO ] [Real]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-05-15 13:37:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 51 ms returned sat
[2020-05-15 13:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:57] [INFO ] [Real]Absence check using state equation in 1076 ms returned sat
[2020-05-15 13:37:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:37:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-05-15 13:37:57] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 74 ms returned sat
[2020-05-15 13:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:37:58] [INFO ] [Nat]Absence check using state equation in 851 ms returned sat
[2020-05-15 13:37:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-15 13:37:58] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 31 ms.
[2020-05-15 13:38:01] [INFO ] Added : 176 causal constraints over 36 iterations in 2428 ms. Result :sat
[2020-05-15 13:38:01] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-05-15 13:38:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 41 ms returned sat
[2020-05-15 13:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:01] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2020-05-15 13:38:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:38:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 47 ms returned sat
[2020-05-15 13:38:01] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 54 ms returned sat
[2020-05-15 13:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:02] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2020-05-15 13:38:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2020-05-15 13:38:02] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 28 ms.
[2020-05-15 13:38:04] [INFO ] Added : 136 causal constraints over 28 iterations in 2085 ms. Result :sat
[2020-05-15 13:38:04] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-05-15 13:38:05] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2020-05-15 13:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:05] [INFO ] [Real]Absence check using state equation in 94 ms returned unsat
[2020-05-15 13:38:05] [INFO ] [Real]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-05-15 13:38:05] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2020-05-15 13:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:05] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2020-05-15 13:38:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:38:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-05-15 13:38:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 46 ms returned sat
[2020-05-15 13:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:06] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2020-05-15 13:38:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-05-15 13:38:06] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 26 ms.
[2020-05-15 13:38:09] [INFO ] Added : 185 causal constraints over 37 iterations in 2525 ms. Result :sat
[2020-05-15 13:38:09] [INFO ] Deduced a trap composed of 9 places in 365 ms
[2020-05-15 13:38:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 457 ms
[2020-05-15 13:38:09] [INFO ] [Real]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-05-15 13:38:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2020-05-15 13:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:10] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2020-05-15 13:38:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:38:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 43 ms returned sat
[2020-05-15 13:38:10] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 44 ms returned sat
[2020-05-15 13:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:11] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2020-05-15 13:38:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 13:38:11] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 28 ms.
[2020-05-15 13:38:13] [INFO ] Added : 181 causal constraints over 37 iterations in 2318 ms. Result :sat
[2020-05-15 13:38:13] [INFO ] [Real]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-05-15 13:38:13] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 51 ms returned sat
[2020-05-15 13:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:15] [INFO ] [Real]Absence check using state equation in 1065 ms returned sat
[2020-05-15 13:38:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:38:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-05-15 13:38:15] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 134 ms returned sat
[2020-05-15 13:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:16] [INFO ] [Nat]Absence check using state equation in 1025 ms returned sat
[2020-05-15 13:38:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-05-15 13:38:16] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 53 ms.
[2020-05-15 13:38:18] [INFO ] Added : 190 causal constraints over 39 iterations in 2204 ms. Result :sat
[2020-05-15 13:38:18] [INFO ] [Real]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-05-15 13:38:18] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2020-05-15 13:38:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:19] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2020-05-15 13:38:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:38:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 43 ms returned sat
[2020-05-15 13:38:19] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 163 ms returned sat
[2020-05-15 13:38:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:20] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2020-05-15 13:38:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 13:38:20] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 32 ms.
[2020-05-15 13:38:22] [INFO ] Added : 151 causal constraints over 31 iterations in 1670 ms. Result :sat
[2020-05-15 13:38:22] [INFO ] [Real]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-05-15 13:38:22] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 13:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:22] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2020-05-15 13:38:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:38:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 46 ms returned sat
[2020-05-15 13:38:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2020-05-15 13:38:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:23] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2020-05-15 13:38:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-05-15 13:38:24] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 26 ms.
[2020-05-15 13:38:26] [INFO ] Added : 170 causal constraints over 35 iterations in 2037 ms. Result :sat
[2020-05-15 13:38:26] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 13:38:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 13:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:26] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2020-05-15 13:38:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:38:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-05-15 13:38:27] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 148 ms returned sat
[2020-05-15 13:38:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:27] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2020-05-15 13:38:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 13:38:27] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 29 ms.
[2020-05-15 13:38:29] [INFO ] Added : 114 causal constraints over 24 iterations in 1526 ms. Result :sat
[2020-05-15 13:38:29] [INFO ] [Real]Absence check using 34 positive place invariants in 48 ms returned sat
[2020-05-15 13:38:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 55 ms returned sat
[2020-05-15 13:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:30] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2020-05-15 13:38:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:38:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-05-15 13:38:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 119 ms returned sat
[2020-05-15 13:38:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:31] [INFO ] [Nat]Absence check using state equation in 1279 ms returned sat
[2020-05-15 13:38:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-05-15 13:38:31] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 25 ms.
[2020-05-15 13:38:33] [INFO ] Added : 155 causal constraints over 31 iterations in 1808 ms. Result :sat
[2020-05-15 13:38:33] [INFO ] Deduced a trap composed of 13 places in 89 ms
[2020-05-15 13:38:33] [INFO ] Deduced a trap composed of 12 places in 84 ms
[2020-05-15 13:38:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2020-05-15 13:38:33] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 13:38:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 13:38:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:34] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2020-05-15 13:38:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:38:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 43 ms returned sat
[2020-05-15 13:38:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 80 ms returned sat
[2020-05-15 13:38:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:35] [INFO ] [Nat]Absence check using state equation in 925 ms returned sat
[2020-05-15 13:38:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2020-05-15 13:38:35] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 31 ms.
[2020-05-15 13:38:38] [INFO ] Added : 197 causal constraints over 40 iterations in 2561 ms. Result :sat
[2020-05-15 13:38:38] [INFO ] Deduced a trap composed of 18 places in 156 ms
[2020-05-15 13:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2020-05-15 13:38:38] [INFO ] [Real]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-05-15 13:38:38] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2020-05-15 13:38:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:39] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2020-05-15 13:38:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:38:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 45 ms returned sat
[2020-05-15 13:38:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 47 ms returned sat
[2020-05-15 13:38:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:40] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2020-05-15 13:38:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 13:38:40] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 50 ms.
[2020-05-15 13:38:43] [INFO ] Added : 209 causal constraints over 43 iterations in 3158 ms. Result :sat
[2020-05-15 13:38:43] [INFO ] [Real]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-05-15 13:38:43] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 39 ms returned sat
[2020-05-15 13:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:44] [INFO ] [Real]Absence check using state equation in 856 ms returned sat
[2020-05-15 13:38:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:38:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 48 ms returned sat
[2020-05-15 13:38:44] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 59 ms returned sat
[2020-05-15 13:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:38:45] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2020-05-15 13:38:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 13:38:45] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 29 ms.
[2020-05-15 13:38:46] [INFO ] Added : 110 causal constraints over 23 iterations in 1450 ms. Result :sat
[2020-05-15 13:38:46] [INFO ] Deduced a trap composed of 19 places in 140 ms
[2020-05-15 13:38:47] [INFO ] Deduced a trap composed of 11 places in 196 ms
[2020-05-15 13:38:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 597 ms
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-15 13:38:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 13:38:47] [INFO ] Flatten gal took : 173 ms
[2020-05-15 13:38:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 13:38:48] [INFO ] Flatten gal took : 92 ms
FORMULA DES-PT-40a-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 13:38:48] [INFO ] Applying decomposition
[2020-05-15 13:38:48] [INFO ] Flatten gal took : 49 ms
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/graph15042640075813384584.txt, -o, /tmp/graph15042640075813384584.bin, -w, /tmp/graph15042640075813384584.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/graph15042640075813384584.bin, -l, -1, -v, -w, /tmp/graph15042640075813384584.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 13:38:48] [INFO ] Decomposing Gal with order
[2020-05-15 13:38:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 13:38:48] [INFO ] Removed a total of 15 redundant transitions.
[2020-05-15 13:38:48] [INFO ] Flatten gal took : 108 ms
[2020-05-15 13:38:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 16 ms.
[2020-05-15 13:38:48] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 17 ms
[2020-05-15 13:38:48] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 5 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 29 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.52256e+13,12.6326,304872,61932,5912,960260,21596,293,505702,381,154454,0


Converting to forward existential form...Done !
original formula: EG((AF(((u2.p121==1)&&(u2.p164==1))) + AF(((((i11.u29.p223==1)&&(i11.u37.p239==1))&&(i5.u27.p219==1))&&(i5.u35.p235==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(((u2.p121==1)&&(u2.p164==1))))) + !(EG(!(((((i11.u29.p223==1)&&(i11.u37.p239==1))&&(i5.u27.p219==1))&&(i5.u35.p235==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t186, t187, t220, u2.t8, u2.t90, u2.t94, u2.t95, u2.t96, u2.t97, u2.t98, u2.t99, u2.t100, u2.t101, u2.t102, u2.t103, u2.t104, u2.t105, u2.t106, u2.t107, u2.t108, u2.t109, u2.t110, u2.t111, u2.t112, u2.t113, u2.t114, u2.t115, u2.t116, u2.t117, u2.t118, u2.t119, u2.t120, u2.t121, u2.t122, u2.t123, u2.t124, u2.t125, u2.t126, u2.t127, u2.t128, u2.t129, u13.t169, u14.t11, u48.t5, u48.t50, i0.i0.u0.t10, i0.i0.u6.t229, i0.i1.t0, i0.i1.t218, i0.i1.t228, i0.i1.u1.t9, i4.t198, i4.t4, i4.t3, i4.u16.t195, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/159/56/215
ITS-tools command line returned an error code 139
[2020-05-15 13:44:55] [INFO ] Applying decomposition
[2020-05-15 13:44:55] [INFO ] Flatten gal took : 65 ms
[2020-05-15 13:44:55] [INFO ] Decomposing Gal with order
[2020-05-15 13:44:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 13:44:55] [INFO ] Removed a total of 291 redundant transitions.
[2020-05-15 13:44:55] [INFO ] Flatten gal took : 110 ms
[2020-05-15 13:44:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 14 ms.
[2020-05-15 13:44:55] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 9 ms
[2020-05-15 13:44:55] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 47 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-15 14:05:21] [INFO ] Flatten gal took : 46 ms
[2020-05-15 14:05:21] [INFO ] Input system was already deterministic with 217 transitions.
[2020-05-15 14:05:21] [INFO ] Transformed 274 places.
[2020-05-15 14:05:21] [INFO ] Transformed 217 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-15 14:05:21] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 5 ms
[2020-05-15 14:05:21] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.52256e+13,1106.87,3936340,2,6.28068e+06,5,1.88131e+07,6,0,1312,1.52004e+07,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.

BK_STOP 1589552747083

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="DES-PT-40a"
export BK_EXAMINATION="CTLFireability"
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 DES-PT-40a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r051-ebro-158902546000292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;