Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171300186.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is HealthRecord-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171300186
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.1K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 53K May 12 08:13 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 HealthRecord-PT-15-00
FORMULA_NAME HealthRecord-PT-15-01
FORMULA_NAME HealthRecord-PT-15-02
FORMULA_NAME HealthRecord-PT-15-03
FORMULA_NAME HealthRecord-PT-15-04
FORMULA_NAME HealthRecord-PT-15-05
FORMULA_NAME HealthRecord-PT-15-06
FORMULA_NAME HealthRecord-PT-15-07
FORMULA_NAME HealthRecord-PT-15-08
FORMULA_NAME HealthRecord-PT-15-09
FORMULA_NAME HealthRecord-PT-15-10
FORMULA_NAME HealthRecord-PT-15-11
FORMULA_NAME HealthRecord-PT-15-12
FORMULA_NAME HealthRecord-PT-15-13
FORMULA_NAME HealthRecord-PT-15-14
FORMULA_NAME HealthRecord-PT-15-15

=== Now, execution of the tool begins

BK_START 1621342137996

[2021-05-18 12:48:59] [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]
[2021-05-18 12:49:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:49:00] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2021-05-18 12:49:00] [INFO ] Transformed 163 places.
[2021-05-18 12:49:00] [INFO ] Transformed 348 transitions.
[2021-05-18 12:49:00] [INFO ] Found NUPN structural information;
[2021-05-18 12:49:00] [INFO ] Parsed PT model containing 163 places and 348 transitions in 139 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 9236 resets, run finished after 371 ms. (steps per millisecond=269 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1]
[2021-05-18 12:49:00] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
// Phase 1: matrix 307 rows 163 cols
[2021-05-18 12:49:00] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-18 12:49:00] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2021-05-18 12:49:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2021-05-18 12:49:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:00] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-18 12:49:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:49:00] [INFO ] [Real]Added 1 Read/Feed constraints in 16 ms returned sat
[2021-05-18 12:49:01] [INFO ] Deduced a trap composed of 45 places in 119 ms
[2021-05-18 12:49:01] [INFO ] Deduced a trap composed of 39 places in 93 ms
[2021-05-18 12:49:01] [INFO ] Deduced a trap composed of 38 places in 56 ms
[2021-05-18 12:49:01] [INFO ] Deduced a trap composed of 38 places in 51 ms
[2021-05-18 12:49:01] [INFO ] Deduced a trap composed of 39 places in 50 ms
[2021-05-18 12:49:01] [INFO ] Deduced a trap composed of 37 places in 48 ms
[2021-05-18 12:49:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 541 ms
[2021-05-18 12:49:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 49 ms returned sat
[2021-05-18 12:49:01] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:01] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2021-05-18 12:49:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:49:01] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 40 ms.
[2021-05-18 12:49:02] [INFO ] Added : 157 causal constraints over 32 iterations in 1109 ms. Result :sat
[2021-05-18 12:49:02] [INFO ] Deduced a trap composed of 30 places in 50 ms
[2021-05-18 12:49:02] [INFO ] Deduced a trap composed of 38 places in 41 ms
[2021-05-18 12:49:03] [INFO ] Deduced a trap composed of 39 places in 35 ms
[2021-05-18 12:49:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 233 ms
[2021-05-18 12:49:03] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:49:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:03] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-18 12:49:03] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:49:03] [INFO ] Deduced a trap composed of 30 places in 43 ms
[2021-05-18 12:49:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2021-05-18 12:49:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:49:03] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:03] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:49:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:03] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 20 ms.
[2021-05-18 12:49:05] [INFO ] Added : 159 causal constraints over 32 iterations in 2061 ms. Result :sat
[2021-05-18 12:49:05] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:49:05] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:05] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-18 12:49:05] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:49:05] [INFO ] Deduced a trap composed of 31 places in 32 ms
[2021-05-18 12:49:05] [INFO ] Deduced a trap composed of 30 places in 25 ms
[2021-05-18 12:49:05] [INFO ] Deduced a trap composed of 30 places in 29 ms
[2021-05-18 12:49:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 121 ms
[2021-05-18 12:49:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 46 ms returned sat
[2021-05-18 12:49:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:06] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:49:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:06] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2021-05-18 12:49:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2021-05-18 12:49:06] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 27 ms.
[2021-05-18 12:49:07] [INFO ] Added : 175 causal constraints over 36 iterations in 1452 ms. Result :sat
[2021-05-18 12:49:07] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:49:07] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:07] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-18 12:49:07] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:07] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 37 ms.
[2021-05-18 12:49:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:49:08] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:08] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-18 12:49:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:08] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 21 ms.
[2021-05-18 12:49:09] [INFO ] Added : 199 causal constraints over 40 iterations in 1786 ms. Result :sat
[2021-05-18 12:49:09] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:49:09] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:10] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-18 12:49:10] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-18 12:49:10] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 22 ms.
[2021-05-18 12:49:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:49:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:10] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:49:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:49:10] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 31 ms.
[2021-05-18 12:49:11] [INFO ] Added : 165 causal constraints over 34 iterations in 1150 ms. Result :sat
[2021-05-18 12:49:11] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:49:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:11] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-18 12:49:11] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:11] [INFO ] Deduced a trap composed of 40 places in 51 ms
[2021-05-18 12:49:11] [INFO ] Deduced a trap composed of 30 places in 27 ms
[2021-05-18 12:49:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2021-05-18 12:49:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:49:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-18 12:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:12] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:49:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:12] [INFO ] Deduced a trap composed of 38 places in 48 ms
[2021-05-18 12:49:12] [INFO ] Deduced a trap composed of 30 places in 41 ms
[2021-05-18 12:49:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2021-05-18 12:49:12] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 19 ms.
[2021-05-18 12:49:13] [INFO ] Added : 175 causal constraints over 35 iterations in 1514 ms. Result :sat
[2021-05-18 12:49:13] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:49:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:13] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:49:13] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:13] [INFO ] Deduced a trap composed of 30 places in 24 ms
[2021-05-18 12:49:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2021-05-18 12:49:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:49:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:14] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:49:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:49:14] [INFO ] Deduced a trap composed of 30 places in 20 ms
[2021-05-18 12:49:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-18 12:49:14] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 16 ms.
[2021-05-18 12:49:14] [INFO ] Added : 151 causal constraints over 31 iterations in 802 ms. Result :sat
[2021-05-18 12:49:14] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:49:14] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:15] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:49:15] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:15] [INFO ] Deduced a trap composed of 30 places in 26 ms
[2021-05-18 12:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2021-05-18 12:49:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 46 ms returned sat
[2021-05-18 12:49:15] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:15] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2021-05-18 12:49:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:49:15] [INFO ] Deduced a trap composed of 30 places in 21 ms
[2021-05-18 12:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-18 12:49:15] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 18 ms.
[2021-05-18 12:49:16] [INFO ] Added : 151 causal constraints over 31 iterations in 790 ms. Result :sat
[2021-05-18 12:49:16] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 12:49:16] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:16] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:49:16] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:16] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 16 ms.
[2021-05-18 12:49:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2021-05-18 12:49:16] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:16] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-18 12:49:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:16] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 16 ms.
[2021-05-18 12:49:17] [INFO ] Added : 187 causal constraints over 38 iterations in 1325 ms. Result :sat
[2021-05-18 12:49:17] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:49:17] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:18] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-18 12:49:18] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:18] [INFO ] Deduced a trap composed of 30 places in 29 ms
[2021-05-18 12:49:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-18 12:49:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 46 ms returned sat
[2021-05-18 12:49:18] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:18] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-18 12:49:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:18] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 16 ms.
[2021-05-18 12:49:19] [INFO ] Added : 162 causal constraints over 33 iterations in 1146 ms. Result :sat
[2021-05-18 12:49:19] [INFO ] Deduced a trap composed of 30 places in 22 ms
[2021-05-18 12:49:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2021-05-18 12:49:19] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:49:19] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:19] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-18 12:49:19] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:49:19] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 16 ms.
[2021-05-18 12:49:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 44 ms returned sat
[2021-05-18 12:49:19] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:19] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-18 12:49:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:49:20] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 16 ms.
[2021-05-18 12:49:21] [INFO ] Added : 172 causal constraints over 35 iterations in 1882 ms. Result :sat
[2021-05-18 12:49:22] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-18 12:49:22] [INFO ] Flatten gal took : 92 ms
FORMULA HealthRecord-PT-15-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:49:22] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 12:49:22] [INFO ] Applying decomposition
[2021-05-18 12:49:22] [INFO ] Flatten gal took : 80 ms
[2021-05-18 12:49:22] [INFO ] Input system was already deterministic with 319 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/graph14468670044669302720.txt, -o, /tmp/graph14468670044669302720.bin, -w, /tmp/graph14468670044669302720.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/graph14468670044669302720.bin, -l, -1, -v, -w, /tmp/graph14468670044669302720.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 12:49:22] [INFO ] Decomposing Gal with order
[2021-05-18 12:49:22] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 307 out of 319 initially.
// Phase 1: matrix 307 rows 163 cols
[2021-05-18 12:49:22] [INFO ] Computed 18 place invariants in 4 ms
inv : 2*p0 + p79 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 = 2
inv : 2*p0 + p86 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 = 2
inv : -p0 + p80 + p81 + p82 + p83 + p84 + p85 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 - p161 - p162 = -1
inv : -p0 + p66 + p67 + p68 + p69 + p70 + p71 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 - p161 - p162 = -1
inv : -p0 + p39 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 - p161 - p162 = -1
inv : -p0 + p1 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 - p161 - p162 = -1
inv : 2*p0 + p65 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 = 2
inv : p0 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 = 1
inv : 2*p0 + p72 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 = 2
inv : -p0 + p20 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 - p161 - p162 = -1
inv : -p0 + p73 + p74 + p75 + p76 + p77 + p78 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 - p161 - p162 = -1
inv : 2*p0 + p58 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 = 2
inv : -p0 + p59 + p60 + p61 + p62 + p63 + p64 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 - p161 - p162 = -1
inv : p0 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 = 1
inv : 2*p0 + p40 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 = 2
inv : -p0 + p87 + p88 + p89 + p90 + p91 + p92 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 - p102 - p103 - p104 - p105 - p106 - p107 - p108 - p109 - p110 - p111 - p112 - p113 - p114 - p115 - p116 - p117 - p118 - p119 - p121 - p122 - p123 - p124 - p125 - p126 - p127 - p128 - p129 - p130 - p131 - p132 - p133 - p134 - p135 - p136 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 - p145 - p146 - p147 - p148 - p149 - p150 - p151 - p152 - p153 - p154 - p155 - p156 - p157 - p158 - p159 - p160 - p161 - p162 = -1
inv : 2*p0 + p21 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 = 2
inv : 2*p0 + p2 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 = 2
Total of 18 invariants.
[2021-05-18 12:49:22] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-18 12:49:22] [INFO ] Removed a total of 53 redundant transitions.
[2021-05-18 12:49:22] [INFO ] Flatten gal took : 63 ms
[2021-05-18 12:49:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2021-05-18 12:49:22] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2021-05-18 12:49:22] [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 : !((F(G((((("(u12.p147==1)")U("(u0.p14==1)"))||("(u12.p147==1)"))U(X("(u0.p5==1)")))||(G(X("((i8.u10.p117!=1)||(u12.p151!=1))")))))))
Formula 0 simplified : !FG((("(u12.p147==1)" | ("(u12.p147==1)" U "(u0.p14==1)")) U X"(u0.p5==1)") | GX"((i8.u10.p117!=1)||(u12.p151!=1))")
built 13 ordering constraints for composite.
built 24 ordering constraints for composite.
[2021-05-18 12:49:22] [INFO ] Proved 163 variables to be positive in 308 ms
[2021-05-18 12:49:22] [INFO ] Computing symmetric may disable matrix : 319 transitions.
[2021-05-18 12:49:22] [INFO ] Computation of disable matrix completed :0/319 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:49:22] [INFO ] Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:49:22] [INFO ] Computing symmetric may enable matrix : 319 transitions.
[2021-05-18 12:49:22] [INFO ] Computation of Complete enable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 12:49:24] [INFO ] Computing symmetric co enabling matrix : 319 transitions.
[2021-05-18 12:49:26] [INFO ] Computation of co-enabling matrix(3/319) took 2317 ms. Total solver calls (SAT/UNSAT): 1263(563/700)
[2021-05-18 12:49:30] [INFO ] Computation of co-enabling matrix(8/319) took 6062 ms. Total solver calls (SAT/UNSAT): 2818(1503/1315)
[2021-05-18 12:49:34] [INFO ] Computation of co-enabling matrix(13/319) took 9825 ms. Total solver calls (SAT/UNSAT): 4348(2441/1907)
[2021-05-18 12:49:37] [INFO ] Computation of co-enabling matrix(17/319) took 12888 ms. Total solver calls (SAT/UNSAT): 5554(3192/2362)
Reverse transition relation is NOT exact ! Due to transitions t12, u0.t227, u0.t228, u0.t229, u0.t230, u0.t231, u0.t232, u0.t233, u0.t234, u0.t235, u0.t236, u0.t237, u0.t238, u0.t239, u0.t240, u0.t242, u0.t243, u0.t245, u0.t246, u0.t248, u0.t249, u0.t251, u0.t252, u0.t254, u0.t255, u0.t256, u0.t258, u0.t259, u0.t261, u0.t262, u0.t265, u1.t188, u1.t189, u1.t190, u1.t191, u1.t192, u1.t193, u1.t194, u1.t195, u1.t196, u1.t197, u1.t198, u1.t199, u1.t200, u1.t201, u1.t203, u1.t204, u1.t206, u1.t207, u1.t209, u1.t210, u1.t212, u1.t213, u1.t215, u1.t216, u1.t217, u1.t219, u1.t220, u1.t222, u1.t223, u1.t226, u2.t149, u2.t150, u2.t151, u2.t152, u2.t153, u2.t154, u2.t155, u2.t156, u2.t157, u2.t158, u2.t159, u2.t160, u2.t161, u2.t162, u2.t164, u2.t165, u2.t167, u2.t168, u2.t170, u2.t171, u2.t173, u2.t174, u2.t176, u2.t177, u2.t178, u2.t180, u2.t181, u2.t183, u2.t184, u2.t187, u3.t140, u3.t141, u3.t142, u3.t143, u3.t144, u3.t146, u3.t147, u3.t148, u4.t131, u4.t132, u4.t133, u4.t134, u4.t135, u4.t137, u4.t138, u4.t139, u5.t122, u5.t123, u5.t124, u5.t125, u5.t126, u5.t128, u5.t129, u5.t130, u6.t113, u6.t114, u6.t115, u6.t116, u6.t117, u6.t119, u6.t120, u6.t121, u7.t104, u7.t105, u7.t106, u7.t107, u7.t108, u7.t110, u7.t111, u7.t112, u12.t1, u12.t2, u12.t3, u12.t4, u12.t5, u12.t6, u12.t7, u12.t8, u12.t9, u12.t14, u12.t15, u12.t16, u12.t17, u12.t18, u12.t19, u12.t20, u12.t21, u12.t22, u12.t23, u12.t24, u12.t25, u12.t26, u12.t27, u12.t28, u12.t29, u12.t30, u12.t31, u12.t32, u12.t33, u12.t34, u12.t35, u12.t36, u12.t37, u12.t38, u12.t39, u12.t40, u12.t41, u12.t42, u12.t43, u12.t44, u12.t45, u12.t46, u12.t47, u12.t48, u12.t49, u12.t50, u12.t51, u12.t52, u12.t53, u12.t54, u12.t55, u12.t56, u12.t57, u12.t58, u12.t59, i8.t68, i8.t62, i8.u10.t60, i8.u10.t61, i8.u10.t70, i8.u10.t71, i8.u10.t72, i8.u10.t73, i8.u10.t74, i8.u10.t75, i8.u10.t76, i8.u10.t77, i8.u10.t78, i8.u10.t79, i8.u10.t80, i8.u10.t81, i8.u10.t82, i8.u10.t83, i8.u10.t84, i8.u10.t85, i8.u10.t86, i8.u10.t87, i8.u10.t88, i8.u10.t89, i8.u10.t90, i8.u10.t91, i8.u10.t92, i8.u10.t93, i8.u10.t94, i8.u10.t95, i8.u10.t96, i8.u10.t97, i8.u10.t98, i8.u10.t99, i8.u10.t100, i8.u10.t101, i8.u10.t102, i8.u10.t103, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/90/224/314
Computing Next relation with stutter on 513 deadlock states
[2021-05-18 12:49:40] [INFO ] Computation of co-enabling matrix(21/319) took 15997 ms. Total solver calls (SAT/UNSAT): 6744(3943/2801)
[2021-05-18 12:49:43] [INFO ] Computation of co-enabling matrix(25/319) took 19046 ms. Total solver calls (SAT/UNSAT): 7918(4695/3223)
32 unique states visited
31 strongly connected components in search stack
35 transitions explored
32 items max in DFS search stack
2221 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,22.2468,397332,1,0,675383,78327,2589,1.17311e+06,2136,1.33878e+06,815822
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-15-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G((G("(u1.p23==1)"))||("((u3.p62==1)&&(u12.p160==1))")))||(F((("(u1.p32==1)")U("((u0.p17==1)&&(u12.p160==1))"))||("(u12.p129==1)")))))
Formula 1 simplified : !(G("((u3.p62==1)&&(u12.p160==1))" | G"(u1.p23==1)") | F("(u12.p129==1)" | ("(u1.p32==1)" U "((u0.p17==1)&&(u12.p160==1))")))
Computing Next relation with stutter on 513 deadlock states
[2021-05-18 12:49:46] [INFO ] Computation of co-enabling matrix(29/319) took 22069 ms. Total solver calls (SAT/UNSAT): 9076(5446/3630)
[2021-05-18 12:49:49] [INFO ] Computation of co-enabling matrix(33/319) took 25076 ms. Total solver calls (SAT/UNSAT): 10218(6199/4019)
[2021-05-18 12:49:52] [INFO ] Computation of co-enabling matrix(37/319) took 28133 ms. Total solver calls (SAT/UNSAT): 11344(6951/4393)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
801 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,30.2587,686616,1,0,1.32847e+06,80287,2674,2.06723e+06,2145,1.33878e+06,1230590
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-15-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F(X(F(G(F("(u1.p23==1)"))))))||((X("(u1.p27==1)"))U("(u2.p55==1)"))))
Formula 2 simplified : !(FXFGF"(u1.p23==1)" | (X"(u1.p27==1)" U "(u2.p55==1)"))
Computing Next relation with stutter on 513 deadlock states
[2021-05-18 12:49:55] [INFO ] Computation of co-enabling matrix(41/319) took 31194 ms. Total solver calls (SAT/UNSAT): 12454(7702/4752)
[2021-05-18 12:49:58] [INFO ] Computation of co-enabling matrix(45/319) took 34288 ms. Total solver calls (SAT/UNSAT): 13548(8455/5093)
[2021-05-18 12:50:01] [INFO ] Computation of co-enabling matrix(49/319) took 37376 ms. Total solver calls (SAT/UNSAT): 14626(9206/5420)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
904 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,39.297,980780,1,0,1.93061e+06,88515,2824,3.07512e+06,2149,1.61481e+06,1699212
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-15-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G((X("(u5.p75==1)"))&&("(u4.p71==1)")))||(X(F((!(X(X("(u5.p75!=1)"))))&&("(u12.p125!=1)"))))))
Formula 3 simplified : !(G("(u4.p71==1)" & X"(u5.p75==1)") | XF("(u12.p125!=1)" & !XX"(u5.p75!=1)"))
Computing Next relation with stutter on 513 deadlock states
[2021-05-18 12:50:04] [INFO ] Computation of co-enabling matrix(53/319) took 40417 ms. Total solver calls (SAT/UNSAT): 15688(9956/5732)
[2021-05-18 12:50:07] [INFO ] Computation of co-enabling matrix(57/319) took 43537 ms. Total solver calls (SAT/UNSAT): 16734(10707/6027)
[2021-05-18 12:50:10] [INFO ] Computation of co-enabling matrix(61/319) took 46607 ms. Total solver calls (SAT/UNSAT): 17764(11465/6299)
23 unique states visited
23 strongly connected components in search stack
23 transitions explored
23 items max in DFS search stack
914 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,48.4378,1255804,1,0,2.4676e+06,93718,2859,4.01758e+06,2149,1.95342e+06,2024610
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HealthRecord-PT-15-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!((G((F("((u0.p17==1)&&(u12.p160==1))"))||("((u0.p17==1)&&(u12.p160==1))")))U(G("(i8.u10.p94==1)")))))
Formula 4 simplified : G("((u0.p17==1)&&(u12.p160==1))" | F"((u0.p17==1)&&(u12.p160==1))") U G"(i8.u10.p94==1)"
Computing Next relation with stutter on 513 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
7 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,48.5171,1258708,1,0,2.47294e+06,94161,2894,4.02608e+06,2151,1.96281e+06,2032238
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA HealthRecord-PT-15-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X(G(!((G(F((G("(u4.p68==1)"))||("(u3.p58!=1)"))))U("(i8.u10.p107==1)")))))))
Formula 5 simplified : !XXG!(GF("(u3.p58!=1)" | G"(u4.p68==1)") U "(i8.u10.p107==1)")
Computing Next relation with stutter on 513 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
145 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,49.9639,1315732,1,0,2.59466e+06,95027,2917,4.22003e+06,2153,2.0106e+06,2111939
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-15-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((!(G(("(i8.u10.p100==1)")U("(u12.p126!=1)"))))||(!(G("((u12.p156!=1)||(u1.p25!=1))"))))))
Formula 6 simplified : !F(!G("(i8.u10.p100==1)" U "(u12.p126!=1)") | !G"((u12.p156!=1)||(u1.p25!=1))")
Computing Next relation with stutter on 513 deadlock states
[2021-05-18 12:50:13] [INFO ] Computation of co-enabling matrix(65/319) took 49689 ms. Total solver calls (SAT/UNSAT): 18778(12231/6547)
[2021-05-18 12:50:17] [INFO ] Computation of co-enabling matrix(70/319) took 53403 ms. Total solver calls (SAT/UNSAT): 20023(13189/6834)
[2021-05-18 12:50:21] [INFO ] Computation of co-enabling matrix(75/319) took 57085 ms. Total solver calls (SAT/UNSAT): 21243(14146/7097)
[2021-05-18 12:50:24] [INFO ] Computation of co-enabling matrix(80/319) took 60778 ms. Total solver calls (SAT/UNSAT): 22438(15104/7334)
[2021-05-18 12:50:28] [INFO ] Computation of co-enabling matrix(85/319) took 64483 ms. Total solver calls (SAT/UNSAT): 23608(16061/7547)
[2021-05-18 12:50:32] [INFO ] Computation of co-enabling matrix(90/319) took 68180 ms. Total solver calls (SAT/UNSAT): 24753(17019/7734)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2148 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,71.4449,2040116,1,0,4.04072e+06,100708,2966,6.5114e+06,2157,2.36767e+06,2775261
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-15-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(G(!(F("(u12.p129==1)")))))))
Formula 7 simplified : !XXG!F"(u12.p129==1)"
Computing Next relation with stutter on 513 deadlock states
[2021-05-18 12:50:36] [INFO ] Computation of co-enabling matrix(95/319) took 71853 ms. Total solver calls (SAT/UNSAT): 25873(17976/7897)
[2021-05-18 12:50:39] [INFO ] Computation of co-enabling matrix(100/319) took 75539 ms. Total solver calls (SAT/UNSAT): 26968(18934/8034)
[2021-05-18 12:50:42] [INFO ] Computation of co-enabling matrix(113/319) took 78606 ms. Total solver calls (SAT/UNSAT): 28374(20269/8105)
[2021-05-18 12:50:45] [INFO ] Computation of co-enabling matrix(147/319) took 81712 ms. Total solver calls (SAT/UNSAT): 31035(22930/8105)
[2021-05-18 12:50:48] [INFO ] Computation of co-enabling matrix(178/319) took 84767 ms. Total solver calls (SAT/UNSAT): 33732(25627/8105)
[2021-05-18 12:50:52] [INFO ] Computation of co-enabling matrix(209/319) took 87848 ms. Total solver calls (SAT/UNSAT): 36429(28324/8105)
[2021-05-18 12:50:55] [INFO ] Computation of co-enabling matrix(238/319) took 90972 ms. Total solver calls (SAT/UNSAT): 38883(30706/8177)
[2021-05-18 12:50:58] [INFO ] Computation of co-enabling matrix(259/319) took 93995 ms. Total solver calls (SAT/UNSAT): 40311(31310/9001)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
2617 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,97.6295,2257716,1,0,4.4627e+06,107535,1059,7.24719e+06,1013,2.64743e+06,20140
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-15-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(((F("(u12.p132==1)"))||("(u1.p29!=1)"))||((F("(u1.p29==1)"))&&("(u12.p132==1)")))))
Formula 8 simplified : !X("(u1.p29!=1)" | F"(u12.p132==1)" | ("(u12.p132==1)" & F"(u1.p29==1)"))
Computing Next relation with stutter on 513 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
25 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,97.8818,2257716,1,0,4.4627e+06,107535,1212,7.24719e+06,1126,2.64743e+06,37725
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA HealthRecord-PT-15-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(X(((!(G("(i8.u10.p110!=1)")))||(G("((i8.u10.p117==1)&&(u12.p122==1))")))||("(u2.p57==1)")))))
Formula 9 simplified : !FX("(u2.p57==1)" | !G"(i8.u10.p110!=1)" | G"((i8.u10.p117==1)&&(u12.p122==1))")
Computing Next relation with stutter on 513 deadlock states
[2021-05-18 12:51:01] [INFO ] Computation of Finished co-enabling matrix. took 96973 ms. Total solver calls (SAT/UNSAT): 41948(31620/10328)
[2021-05-18 12:51:01] [INFO ] Computing Do-Not-Accords matrix : 319 transitions.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
84 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,98.7219,2257716,1,0,4.4627e+06,107535,1278,7.24719e+06,1135,2.64743e+06,138730
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA HealthRecord-PT-15-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F((G(("(u12.p162!=1)")U("(u1.p27==1)")))U(F("(u2.p53==1)"))))U(F("(u2.p53==1)"))))
Formula 10 simplified : !(F(G("(u12.p162!=1)" U "(u1.p27==1)") U F"(u2.p53==1)") U F"(u2.p53==1)")
Computing Next relation with stutter on 513 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
108 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,99.8083,2257716,1,0,4.4627e+06,107535,1356,7.24719e+06,1137,2.64743e+06,246441
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA HealthRecord-PT-15-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(G("(u2.p55==1)"))))
Formula 11 simplified : !FG"(u2.p55==1)"
Computing Next relation with stutter on 513 deadlock states
[2021-05-18 12:51:02] [INFO ] Computation of Completed DNA matrix. took 1513 ms. Total solver calls (SAT/UNSAT): 1731(0/1731)
[2021-05-18 12:51:02] [INFO ] Built C files in 100422ms 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 3360 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 42 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAP10==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, -p, --pins-guards, --when, --ltl, <>([]((LTLAP10==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, -p, --pins-guards, --when, --ltl, <>([]((LTLAP10==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)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2841 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,128.217,2257716,1,0,4.4627e+06,107535,1374,7.24719e+06,1138,2.64743e+06,1526428
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA HealthRecord-PT-15-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621342303975

--------------------
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="HealthRecord-PT-15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is HealthRecord-PT-15, 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 r303-tall-162124171300186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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