Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389200729.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R050C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389200729
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 3.1K May 14 00:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 14 00:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 17:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 17:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 13 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 212K May 12 20:53 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 ResAllocation-PT-R050C002-00
FORMULA_NAME ResAllocation-PT-R050C002-01
FORMULA_NAME ResAllocation-PT-R050C002-02
FORMULA_NAME ResAllocation-PT-R050C002-03
FORMULA_NAME ResAllocation-PT-R050C002-04
FORMULA_NAME ResAllocation-PT-R050C002-05
FORMULA_NAME ResAllocation-PT-R050C002-06
FORMULA_NAME ResAllocation-PT-R050C002-07
FORMULA_NAME ResAllocation-PT-R050C002-08
FORMULA_NAME ResAllocation-PT-R050C002-09
FORMULA_NAME ResAllocation-PT-R050C002-10
FORMULA_NAME ResAllocation-PT-R050C002-11
FORMULA_NAME ResAllocation-PT-R050C002-12
FORMULA_NAME ResAllocation-PT-R050C002-13
FORMULA_NAME ResAllocation-PT-R050C002-14
FORMULA_NAME ResAllocation-PT-R050C002-15

=== Now, execution of the tool begins

BK_START 1590556237728

[2020-05-27 05:10:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-27 05:10:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:10:40] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2020-05-27 05:10:40] [INFO ] Transformed 200 places.
[2020-05-27 05:10:40] [INFO ] Transformed 102 transitions.
[2020-05-27 05:10:40] [INFO ] Parsed PT model containing 200 places and 102 transitions in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 150 resets, run finished after 513 ms. (steps per millisecond=194 ) properties seen :[0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1]
// Phase 1: matrix 102 rows 200 cols
[2020-05-27 05:10:41] [INFO ] Computed 100 place invariants in 7 ms
[2020-05-27 05:10:41] [INFO ] [Real]Absence check using 100 positive place invariants in 69 ms returned sat
[2020-05-27 05:10:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:41] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-05-27 05:10:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:41] [INFO ] [Nat]Absence check using 100 positive place invariants in 123 ms returned sat
[2020-05-27 05:10:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:42] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2020-05-27 05:10:42] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 21 ms.
[2020-05-27 05:10:42] [INFO ] Added : 48 causal constraints over 10 iterations in 300 ms. Result :sat
[2020-05-27 05:10:42] [INFO ] [Real]Absence check using 100 positive place invariants in 343 ms returned sat
[2020-05-27 05:10:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:43] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2020-05-27 05:10:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:43] [INFO ] [Nat]Absence check using 100 positive place invariants in 30 ms returned sat
[2020-05-27 05:10:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:43] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2020-05-27 05:10:43] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-27 05:10:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2020-05-27 05:10:43] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 9 ms.
[2020-05-27 05:10:43] [INFO ] Added : 93 causal constraints over 19 iterations in 247 ms. Result :sat
[2020-05-27 05:10:43] [INFO ] [Real]Absence check using 100 positive place invariants in 29 ms returned sat
[2020-05-27 05:10:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:43] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2020-05-27 05:10:43] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 37 ms.
[2020-05-27 05:10:44] [INFO ] Added : 91 causal constraints over 19 iterations in 372 ms. Result :sat
[2020-05-27 05:10:44] [INFO ] [Real]Absence check using 100 positive place invariants in 22 ms returned unsat
[2020-05-27 05:10:44] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned unsat
[2020-05-27 05:10:44] [INFO ] [Real]Absence check using 100 positive place invariants in 18 ms returned unsat
[2020-05-27 05:10:44] [INFO ] [Real]Absence check using 100 positive place invariants in 8 ms returned unsat
[2020-05-27 05:10:44] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned unsat
[2020-05-27 05:10:44] [INFO ] [Real]Absence check using 100 positive place invariants in 4 ms returned unsat
[2020-05-27 05:10:44] [INFO ] [Real]Absence check using 100 positive place invariants in 27 ms returned sat
[2020-05-27 05:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:44] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2020-05-27 05:10:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:44] [INFO ] [Nat]Absence check using 100 positive place invariants in 42 ms returned sat
[2020-05-27 05:10:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:44] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-05-27 05:10:44] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 8 ms.
[2020-05-27 05:10:44] [INFO ] Added : 48 causal constraints over 10 iterations in 109 ms. Result :sat
[2020-05-27 05:10:45] [INFO ] [Real]Absence check using 100 positive place invariants in 11 ms returned unsat
[2020-05-27 05:10:45] [INFO ] [Real]Absence check using 100 positive place invariants in 10 ms returned unsat
[2020-05-27 05:10:45] [INFO ] [Real]Absence check using 100 positive place invariants in 19 ms returned unsat
[2020-05-27 05:10:45] [INFO ] [Real]Absence check using 100 positive place invariants in 41 ms returned unsat
[2020-05-27 05:10:45] [INFO ] [Real]Absence check using 100 positive place invariants in 4 ms returned unsat
[2020-05-27 05:10:45] [INFO ] [Real]Absence check using 100 positive place invariants in 44 ms returned sat
[2020-05-27 05:10:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:45] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-05-27 05:10:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:45] [INFO ] [Nat]Absence check using 100 positive place invariants in 46 ms returned sat
[2020-05-27 05:10:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:45] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2020-05-27 05:10:46] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 17 ms.
[2020-05-27 05:10:46] [INFO ] Added : 49 causal constraints over 10 iterations in 150 ms. Result :sat
[2020-05-27 05:10:46] [INFO ] [Real]Absence check using 100 positive place invariants in 64 ms returned unsat
[2020-05-27 05:10:46] [INFO ] [Real]Absence check using 100 positive place invariants in 32 ms returned sat
[2020-05-27 05:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:46] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2020-05-27 05:10:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:46] [INFO ] [Nat]Absence check using 100 positive place invariants in 47 ms returned sat
[2020-05-27 05:10:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:46] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2020-05-27 05:10:46] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 19 ms.
[2020-05-27 05:10:46] [INFO ] Added : 49 causal constraints over 10 iterations in 133 ms. Result :sat
[2020-05-27 05:10:46] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned unsat
[2020-05-27 05:10:47] [INFO ] [Real]Absence check using 100 positive place invariants in 87 ms returned sat
[2020-05-27 05:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:47] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2020-05-27 05:10:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:47] [INFO ] [Nat]Absence check using 100 positive place invariants in 97 ms returned sat
[2020-05-27 05:10:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:47] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2020-05-27 05:10:47] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-27 05:10:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2020-05-27 05:10:47] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 6 ms.
[2020-05-27 05:10:47] [INFO ] Added : 49 causal constraints over 10 iterations in 107 ms. Result :sat
[2020-05-27 05:10:47] [INFO ] [Real]Absence check using 100 positive place invariants in 33 ms returned sat
[2020-05-27 05:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:47] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-05-27 05:10:47] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-27 05:10:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2020-05-27 05:10:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:48] [INFO ] [Nat]Absence check using 100 positive place invariants in 43 ms returned sat
[2020-05-27 05:10:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:48] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2020-05-27 05:10:48] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-27 05:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2020-05-27 05:10:48] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 5 ms.
[2020-05-27 05:10:48] [INFO ] Added : 49 causal constraints over 10 iterations in 114 ms. Result :sat
[2020-05-27 05:10:48] [INFO ] [Real]Absence check using 100 positive place invariants in 90 ms returned sat
[2020-05-27 05:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:48] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2020-05-27 05:10:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:48] [INFO ] [Nat]Absence check using 100 positive place invariants in 46 ms returned sat
[2020-05-27 05:10:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:49] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2020-05-27 05:10:49] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-27 05:10:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2020-05-27 05:10:49] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 23 ms.
[2020-05-27 05:10:49] [INFO ] Added : 52 causal constraints over 11 iterations in 146 ms. Result :sat
[2020-05-27 05:10:49] [INFO ] [Real]Absence check using 100 positive place invariants in 30 ms returned unsat
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
[2020-05-27 05:10:49] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-27 05:10:49] [INFO ] Flatten gal took : 140 ms
FORMULA ResAllocation-PT-R050C002-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 05:10:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-27 05:10:49] [INFO ] Flatten gal took : 33 ms
[2020-05-27 05:10:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ResAllocation-PT-R050C002-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 05:10:49] [INFO ] Applying decomposition
[2020-05-27 05:10:49] [INFO ] Flatten gal took : 17 ms
[2020-05-27 05:10:50] [INFO ] Input system was already deterministic with 102 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 102 rows 200 cols
[2020-05-27 05:10:50] [INFO ] Computed 100 place invariants in 3 ms
inv : p_1_2 + r_1_2 = 1
inv : p_0_35 + r_0_35 + p_1_35 = 1
inv : p_0_26 + r_0_26 + p_1_26 = 1
inv : p_0_44 + r_0_44 + p_1_44 = 1
inv : p_0_17 + r_0_17 + p_1_17 = 1
inv : p_1_12 + r_1_12 = 1
inv : p_0_1 + r_0_1 + p_1_1 = 1
inv : p_1_41 + r_1_41 = 1
inv : p_1_37 + r_1_37 = 1
inv : p_1_17 + r_1_17 = 1
inv : p_0_8 + r_0_8 + p_1_8 = 1
inv : p_0_24 + r_0_24 + p_1_24 = 1
inv : p_1_16 + r_1_16 = 1
inv : p_0_28 + r_0_28 + p_1_28 = 1
inv : p_1_32 + r_1_32 = 1
inv : p_0_10 + r_0_10 + p_1_10 = 1
inv : p_1_6 + r_1_6 = 1
inv : p_0_12 + r_0_12 + p_1_12 = 1
inv : p_1_27 + r_1_27 = 1
inv : p_1_22 + r_1_22 = 1
inv : p_1_46 + r_1_46 = 1
inv : p_0_42 + r_0_42 + p_1_42 = 1
inv : p_1_3 + r_1_3 = 1
inv : p_1_11 + r_1_11 = 1
inv : p_1_18 + r_1_18 = 1
inv : p_0_48 + r_0_48 + p_1_48 = 1
inv : p_0_31 + r_0_31 + p_1_31 = 1
inv : p_0_22 + r_0_22 + p_1_22 = 1
inv : p_1_8 + r_1_8 = 1
inv : p_1_28 + r_1_28 = 1
inv : p_0_39 + r_0_39 + p_1_39 = 1
inv : p_0_14 + r_0_14 + p_1_14 = 1
inv : p_1_40 + r_1_40 = 1
inv : p_1_25 + r_1_25 = 1
inv : p_1_21 + r_1_21 = 1
inv : p_1_47 + r_1_47 = 1
inv : p_0_37 + r_0_37 + p_1_37 = 1
inv : p_1_31 + r_1_31 = 1
inv : p_0_46 + r_0_46 + p_1_46 = 1
inv : p_0_7 + r_0_7 + p_1_7 = 1
inv : p_0_20 + r_0_20 + p_1_20 = 1
inv : p_0_33 + r_0_33 + p_1_33 = 1
inv : p_0_3 + r_0_3 + p_1_3 = 1
inv : p_0_5 + r_0_5 + p_1_5 = 1
inv : p_1_15 + r_1_15 = 1
inv : p_1_39 + r_1_39 = 1
inv : p_0_0 + r_0_0 + p_1_0 = 1
inv : p_1_34 + r_1_34 = 1
inv : p_1_44 + r_1_44 = 1
inv : p_0_9 + r_0_9 + p_1_9 = 1
inv : p_0_18 + r_0_18 + p_1_18 = 1
inv : p_1_24 + r_1_24 = 1
inv : p_0_43 + r_0_43 + p_1_43 = 1
inv : p_0_36 + r_0_36 + p_1_36 = 1
inv : p_1_49 + r_1_49 = 1
inv : p_0_16 + r_0_16 + p_1_16 = 1
inv : p_1_29 + r_1_29 = 1
inv : p_1_5 + r_1_5 = 1
inv : p_1_9 + r_1_9 = 1
inv : p_0_45 + r_0_45 + p_1_45 = 1
inv : p_0_11 + r_0_11 + p_1_11 = 1
inv : p_0_29 + r_0_29 + p_1_29 = 1
inv : p_1_0 + r_1_0 = 1
inv : p_1_43 + r_1_43 = 1
inv : p_1_14 + r_1_14 = 1
inv : p_0_25 + r_0_25 + p_1_25 = 1
inv : p_1_19 + r_1_19 = 1
inv : p_1_35 + r_1_35 = 1
inv : p_1_30 + r_1_30 = 1
inv : p_1_38 + r_1_38 = 1
inv : p_0_41 + r_0_41 + p_1_41 = 1
inv : p_0_27 + r_0_27 + p_1_27 = 1
inv : p_0_13 + r_0_13 + p_1_13 = 1
inv : p_1_23 + r_1_23 = 1
inv : p_0_40 + r_0_40 + p_1_40 = 1
inv : p_0_21 + r_0_21 + p_1_21 = 1
inv : p_0_23 + r_0_23 + p_1_23 = 1
inv : p_0_38 + r_0_38 + p_1_38 = 1
inv : p_1_48 + r_1_48 = 1
inv : p_1_45 + r_1_45 = 1
inv : p_0_30 + r_0_30 + p_1_30 = 1
inv : p_1_33 + r_1_33 = 1
inv : p_0_15 + r_0_15 + p_1_15 = 1
inv : p_1_1 + r_1_1 = 1
inv : p_1_13 + r_1_13 = 1
inv : p_1_10 + r_1_10 = 1
inv : p_1_26 + r_1_26 = 1
inv : p_0_2 + r_0_2 + p_1_2 = 1
inv : p_1_42 + r_1_42 = 1
inv : p_1_4 + r_1_4 = 1
inv : p_0_6 + r_0_6 + p_1_6 = 1
inv : p_1_20 + r_1_20 = 1
inv : p_1_36 + r_1_36 = 1
inv : p_0_32 + r_0_32 + p_1_32 = 1
inv : p_0_47 + r_0_47 + p_1_47 = 1
inv : p_0_49 + r_0_49 + p_1_49 = 1
inv : p_0_4 + r_0_4 + p_1_4 = 1
inv : p_1_7 + r_1_7 = 1
inv : p_0_34 + r_0_34 + p_1_34 = 1
inv : p_0_19 + r_0_19 + p_1_19 = 1
Total of 100 invariants.
[2020-05-27 05:10:50] [INFO ] Computed 100 place invariants in 5 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/graph15899187659929939582.txt, -o, /tmp/graph15899187659929939582.bin, -w, /tmp/graph15899187659929939582.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/graph15899187659929939582.bin, -l, -1, -v, -w, /tmp/graph15899187659929939582.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 05:10:50] [INFO ] Decomposing Gal with order
[2020-05-27 05:10:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 05:10:50] [INFO ] Removed a total of 4 redundant transitions.
[2020-05-27 05:10:50] [INFO ] Flatten gal took : 114 ms
[2020-05-27 05:10:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-27 05:10:50] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 11 ms
[2020-05-27 05:10:50] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 11 LTL properties
Checking formula 0 : !((!(X(G((X(("(gi9.gu41.p_0_45<=gi9.gu41.p_0_42)")U(!(X("(gi9.gu41.p_0_45<=gi9.gu41.p_0_42)")))))&&("(gi2.gu6.r_1_39<=gi2.gu6.p_0_9)"))))))
Formula 0 simplified : XG("(gi2.gu6.r_1_39<=gi2.gu6.p_0_9)" & X("(gi9.gu41.p_0_45<=gi9.gu41.p_0_42)" U !X"(gi9.gu41.p_0_45<=gi9.gu41.p_0_42)"))
[2020-05-27 05:10:50] [INFO ] Proved 200 variables to be positive in 727 ms
[2020-05-27 05:10:50] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2020-05-27 05:10:50] [INFO ] Computation of disable matrix completed :0/102 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:10:50] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:10:50] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2020-05-27 05:10:50] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions gi10.gu45.t_0_50, t_1_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/100/2/102
Computing Next relation with stutter on 49 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
44 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,0.544752,28908,1,0,219,91645,224,107,5898,36378,215
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R050C002-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G(F((("(gi15.gu61.r_1_46<=gi15.gu61.r_1_17)")U(F("(gi15.gu61.r_1_46>gi15.gu61.r_1_17)")))&&("(gi1.gi0.gu3.p_0_43>=1)"))))||(X(!(G(F("(gi3.gi0.gu10.p_1_20<=gi3.gi0.gu10.p_0_13)")))))))
Formula 1 simplified : !(GF("(gi1.gi0.gu3.p_0_43>=1)" & ("(gi15.gu61.r_1_46<=gi15.gu61.r_1_17)" U F"(gi15.gu61.r_1_46>gi15.gu61.r_1_17)")) | X!GF"(gi3.gi0.gu10.p_1_20<=gi3.gi0.gu10.p_0_13)")
Computing Next relation with stutter on 49 deadlock states
[2020-05-27 05:10:51] [INFO ] Computing symmetric co enabling matrix : 102 transitions.
[2020-05-27 05:10:53] [INFO ] Computation of Finished co-enabling matrix. took 1634 ms. Total solver calls (SAT/UNSAT): 251(50/201)
[2020-05-27 05:10:53] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2020-05-27 05:10:53] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:10:53] [INFO ] Built C files in 3463ms 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 2092 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 66 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](<>(( ((LTLAP2==true))U(<>((LTLAP3==true))) ) && ( (LTLAP4==true) )))) || ( X(!( [](<>((LTLAP5==true)))) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](<>(( ((LTLAP2==true))U(<>((LTLAP3==true))) ) && ( (LTLAP4==true) )))) || ( X(!( [](<>((LTLAP5==true)))) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](<>(( ((LTLAP2==true))U(<>((LTLAP3==true))) ) && ( (LTLAP4==true) )))) || ( X(!( [](<>((LTLAP5==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)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
8962 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,90.1659,2197152,1,0,7721,1.26829e+07,262,6433,6118,2.03242e+07,12996
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G("(gi1.gi0.gu3.r_0_43<=gi1.gi0.gu3.p_0_4)"))U(G(F("(gi10.gu69.p_1_27<=gi10.gu69.r_1_49)")))))
Formula 2 simplified : !(G"(gi1.gi0.gu3.r_0_43<=gi1.gi0.gu3.p_0_4)" U GF"(gi10.gu69.p_1_27<=gi10.gu69.r_1_49)")
Computing Next relation with stutter on 49 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
3847 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.625,2211336,1,0,7747,1.27049e+07,17,6452,2753,2.03498e+07,4302
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(!(F(G(X(X(X(!(F("(gi15.gu31.r_0_33>gi15.gu61.r_1_17)")))))))))))
Formula 3 simplified : !F!FGXXX!F"(gi15.gu31.r_0_33>gi15.gu61.r_1_17)"
Computing Next relation with stutter on 49 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
200 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,130.63,2211568,1,0,7747,1.27049e+07,32,6452,3652,2.03498e+07,6536
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(G((X(X(X("(gu13.p_0_16<=gu13.r_1_25)"))))&&(X("(gu13.p_0_16<=gu13.r_1_25)")))))))
Formula 4 simplified : !XFG(X"(gu13.p_0_16<=gu13.r_1_25)" & XXX"(gu13.p_0_16<=gu13.r_1_25)")
Computing Next relation with stutter on 49 deadlock states
675 unique states visited
674 strongly connected components in search stack
677 transitions explored
675 items max in DFS search stack
492 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,135.545,2211568,1,0,7747,1.27049e+07,37,6452,3657,2.03498e+07,14532
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G("(gu30.p_1_13<=gu30.p_0_33)"))))
Formula 5 simplified : !XG"(gu30.p_1_13<=gu30.p_0_33)"
Computing Next relation with stutter on 49 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
647 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,142.023,2211568,1,0,8387,1.27049e+07,45,9132,3662,2.03498e+07,20921
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(X("(gi1.gi1.gu83.p_1_44>=1)"))))
Formula 6 simplified : X"(gi1.gi1.gu83.p_1_44>=1)"
Computing Next relation with stutter on 49 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,142.023,2211568,1,0,8387,1.27049e+07,48,9132,3663,2.03498e+07,20923
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R050C002-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F((!(X("(gi14.gu7.p_0_10<=gi14.gu7.r_0_16)")))||("(gu70.p_0_7>gu70.r_1_27)"))))
Formula 7 simplified : !F("(gu70.p_0_7>gu70.r_1_27)" | !X"(gi14.gu7.p_0_10<=gi14.gu7.r_0_16)")
Computing Next relation with stutter on 49 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1386 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,155.875,2211568,1,0,10894,1.27049e+07,62,11919,3676,2.03498e+07,27224
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X(F("((gi5.gi1.gu66.p_1_0<=gi5.gi1.gu66.p_1_23)||(gi0.gu1.r_0_2<=gi0.gu1.p_1_29))")))))
Formula 8 simplified : !FXF"((gi5.gi1.gu66.p_1_0<=gi5.gi1.gu66.p_1_23)||(gi0.gu1.r_0_2<=gi0.gu1.p_1_29))"
Computing Next relation with stutter on 49 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,155.876,2211568,1,0,10894,1.27049e+07,71,11919,3684,2.03498e+07,27228
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R050C002-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X((G(F(G(X(X("(gi11.gu63.r_0_6<=gi11.gu63.p_1_19)"))))))&&("(gu53.r_1_34<=gu53.r_1_8)")))))
Formula 9 simplified : !XX("(gu53.r_1_34<=gu53.r_1_8)" & GFGXX"(gi11.gu63.r_0_6<=gi11.gu63.p_1_19)")
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
[2020-05-27 05:30:53] [INFO ] Flatten gal took : 97 ms
[2020-05-27 05:30:53] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-27 05:30:53] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X(X((G(F(G(X(X("(r_0_6<=p_1_19)"))))))&&("(r_1_34<=r_1_8)")))))
Formula 0 simplified : !XX("(r_1_34<=r_1_8)" & GFGXX"(r_0_6<=p_1_19)")
Reverse transition relation is NOT exact ! Due to transitions t_0_50, t_1_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/100/2/102
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
[2020-05-27 05:50:57] [INFO ] Flatten gal took : 16 ms
[2020-05-27 05:50:57] [INFO ] Input system was already deterministic with 102 transitions.
[2020-05-27 05:50:57] [INFO ] Transformed 200 places.
[2020-05-27 05:50:57] [INFO ] Transformed 102 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-27 05:50:57] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-27 05:50:57] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((G(F(G(X(X("(r_0_6<=p_1_19)"))))))&&("(r_1_34<=r_1_8)")))))
Formula 0 simplified : !XX("(r_1_34<=r_1_8)" & GFGXX"(r_0_6<=p_1_19)")
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/100/2/102
Computing Next relation with stutter on 49 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R050C002.tgz
mv ResAllocation-PT-R050C002 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;