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-159033389200730.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389200730
=====================================================================

--------------------
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 1590556246048

[2020-05-27 05:10:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 05:10:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:10:49] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2020-05-27 05:10:49] [INFO ] Transformed 200 places.
[2020-05-27 05:10:49] [INFO ] Transformed 102 transitions.
[2020-05-27 05:10:49] [INFO ] Parsed PT model containing 200 places and 102 transitions in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 58 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 150 resets, run finished after 506 ms. (steps per millisecond=197 ) properties seen :[0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 102 rows 200 cols
[2020-05-27 05:10:49] [INFO ] Computed 100 place invariants in 11 ms
[2020-05-27 05:10:50] [INFO ] [Real]Absence check using 100 positive place invariants in 122 ms returned sat
[2020-05-27 05:10:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:50] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2020-05-27 05:10:50] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 21 ms.
[2020-05-27 05:10:50] [INFO ] Added : 85 causal constraints over 17 iterations in 378 ms. Result :sat
[2020-05-27 05:10:51] [INFO ] [Real]Absence check using 100 positive place invariants in 350 ms returned sat
[2020-05-27 05:10:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:51] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2020-05-27 05:10:51] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 30 ms.
[2020-05-27 05:10:51] [INFO ] Added : 85 causal constraints over 17 iterations in 222 ms. Result :sat
[2020-05-27 05:10:51] [INFO ] [Real]Absence check using 100 positive place invariants in 39 ms returned sat
[2020-05-27 05:10:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:52] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2020-05-27 05:10:52] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 9 ms.
[2020-05-27 05:10:52] [INFO ] Added : 85 causal constraints over 17 iterations in 253 ms. Result :sat
[2020-05-27 05:10:52] [INFO ] [Real]Absence check using 100 positive place invariants in 50 ms returned sat
[2020-05-27 05:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:52] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2020-05-27 05:10:52] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-27 05:10:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2020-05-27 05:10:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:52] [INFO ] [Nat]Absence check using 100 positive place invariants in 36 ms returned sat
[2020-05-27 05:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:53] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2020-05-27 05:10:53] [INFO ] Deduced a trap composed of 4 places in 146 ms
[2020-05-27 05:10:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2020-05-27 05:10:53] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 35 ms.
[2020-05-27 05:10:53] [INFO ] Added : 84 causal constraints over 17 iterations in 391 ms. Result :sat
[2020-05-27 05:10:53] [INFO ] [Real]Absence check using 100 positive place invariants in 46 ms returned sat
[2020-05-27 05:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:54] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2020-05-27 05:10:54] [INFO ] Deduced a trap composed of 4 places in 340 ms
[2020-05-27 05:10:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 381 ms
[2020-05-27 05:10:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:54] [INFO ] [Nat]Absence check using 100 positive place invariants in 146 ms returned sat
[2020-05-27 05:10:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:55] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2020-05-27 05:10:55] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-05-27 05:10:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2020-05-27 05:10:55] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 26 ms.
[2020-05-27 05:10:55] [INFO ] Added : 94 causal constraints over 19 iterations in 258 ms. Result :sat
[2020-05-27 05:10:55] [INFO ] [Real]Absence check using 100 positive place invariants in 58 ms returned sat
[2020-05-27 05:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:55] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-05-27 05:10:55] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-27 05:10:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2020-05-27 05:10:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:55] [INFO ] [Nat]Absence check using 100 positive place invariants in 46 ms returned sat
[2020-05-27 05:10:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:56] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2020-05-27 05:10:56] [INFO ] Deduced a trap composed of 4 places in 294 ms
[2020-05-27 05:10:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2020-05-27 05:10:56] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 20 ms.
[2020-05-27 05:10:56] [INFO ] Added : 98 causal constraints over 20 iterations in 279 ms. Result :sat
[2020-05-27 05:10:56] [INFO ] [Real]Absence check using 100 positive place invariants in 30 ms returned sat
[2020-05-27 05:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2020-05-27 05:10:57] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-05-27 05:10:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2020-05-27 05:10:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:57] [INFO ] [Nat]Absence check using 100 positive place invariants in 171 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:57] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2020-05-27 05:10:57] [INFO ] Deduced a trap composed of 4 places in 154 ms
[2020-05-27 05:10:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2020-05-27 05:10:57] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 8 ms.
[2020-05-27 05:10:57] [INFO ] Added : 82 causal constraints over 17 iterations in 221 ms. Result :sat
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using 100 positive place invariants in 31 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2020-05-27 05:10:58] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-05-27 05:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2020-05-27 05:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using 100 positive place invariants in 37 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2020-05-27 05:10:58] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-05-27 05:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2020-05-27 05:10:58] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 16 ms.
[2020-05-27 05:10:58] [INFO ] Added : 82 causal constraints over 17 iterations in 195 ms. Result :sat
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 100 positive place invariants in 32 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2020-05-27 05:10:59] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 6 ms.
[2020-05-27 05:10:59] [INFO ] Added : 87 causal constraints over 18 iterations in 343 ms. Result :sat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 100 positive place invariants in 27 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2020-05-27 05:10:59] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 6 ms.
[2020-05-27 05:10:59] [INFO ] Added : 49 causal constraints over 10 iterations in 143 ms. Result :sat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 100 positive place invariants in 145 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:00] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2020-05-27 05:11:00] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 6 ms.
[2020-05-27 05:11:00] [INFO ] Added : 47 causal constraints over 10 iterations in 107 ms. Result :sat
[2020-05-27 05:11:00] [INFO ] [Real]Absence check using 100 positive place invariants in 34 ms returned sat
[2020-05-27 05:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:00] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2020-05-27 05:11:00] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2020-05-27 05:11:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2020-05-27 05:11:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:11:00] [INFO ] [Nat]Absence check using 100 positive place invariants in 31 ms returned sat
[2020-05-27 05:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:00] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2020-05-27 05:11:00] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2020-05-27 05:11:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2020-05-27 05:11:00] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 17 ms.
[2020-05-27 05:11:00] [INFO ] Added : 84 causal constraints over 17 iterations in 153 ms. Result :sat
[2020-05-27 05:11:00] [INFO ] [Real]Absence check using 100 positive place invariants in 107 ms returned sat
[2020-05-27 05:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:01] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2020-05-27 05:11:01] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 7 ms.
[2020-05-27 05:11:01] [INFO ] Added : 47 causal constraints over 10 iterations in 118 ms. Result :sat
[2020-05-27 05:11:01] [INFO ] [Real]Absence check using 100 positive place invariants in 43 ms returned sat
[2020-05-27 05:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:01] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2020-05-27 05:11:01] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 7 ms.
[2020-05-27 05:11:01] [INFO ] Added : 47 causal constraints over 10 iterations in 106 ms. Result :sat
[2020-05-27 05:11:01] [INFO ] [Real]Absence check using 100 positive place invariants in 27 ms returned sat
[2020-05-27 05:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:01] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2020-05-27 05:11:01] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 20 ms.
[2020-05-27 05:11:01] [INFO ] Added : 47 causal constraints over 10 iterations in 137 ms. Result :sat
[2020-05-27 05:11:01] [INFO ] [Real]Absence check using 100 positive place invariants in 36 ms returned sat
[2020-05-27 05:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:02] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2020-05-27 05:11:02] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 7 ms.
[2020-05-27 05:11:02] [INFO ] Added : 49 causal constraints over 10 iterations in 113 ms. Result :sat
[2020-05-27 05:11:02] [INFO ] [Real]Absence check using 100 positive place invariants in 30 ms returned sat
[2020-05-27 05:11:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:02] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2020-05-27 05:11:02] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-27 05:11:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2020-05-27 05:11:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:11:02] [INFO ] [Nat]Absence check using 100 positive place invariants in 44 ms returned sat
[2020-05-27 05:11:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:02] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2020-05-27 05:11:02] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-05-27 05:11:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2020-05-27 05:11:02] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 8 ms.
[2020-05-27 05:11:02] [INFO ] Added : 95 causal constraints over 19 iterations in 185 ms. Result :sat
[2020-05-27 05:11:03] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-27 05:11:03] [INFO ] Flatten gal took : 115 ms
FORMULA ResAllocation-PT-R050C002-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 05:11:03] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
[2020-05-27 05:11:03] [INFO ] Applying decomposition
[2020-05-27 05:11:03] [INFO ] Flatten gal took : 26 ms
Built C files in :
/home/mcc/execution
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/graph7173216819334791871.txt, -o, /tmp/graph7173216819334791871.bin, -w, /tmp/graph7173216819334791871.weights], workingDir=null]
[2020-05-27 05:11:03] [INFO ] Input system was already deterministic with 102 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph7173216819334791871.bin, -l, -1, -v, -w, /tmp/graph7173216819334791871.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 102 rows 200 cols
[2020-05-27 05:11:03] [INFO ] Computed 100 place invariants in 17 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:11:03] [INFO ] Computed 100 place invariants in 35 ms
[2020-05-27 05:11:03] [INFO ] Decomposing Gal with order
[2020-05-27 05:11:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 05:11:04] [INFO ] Flatten gal took : 196 ms
[2020-05-27 05:11:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-27 05:11:04] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 8 ms
[2020-05-27 05:11:04] [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 : !((("((i7.i0.u37.p_0_37>=1)&&(i7.i0.u38.r_0_38>=1))")U(G("((i7.i0.u37.p_0_37<1)||(i7.i0.u38.r_0_38<1))"))))
Formula 0 simplified : !("((i7.i0.u37.p_0_37>=1)&&(i7.i0.u38.r_0_38>=1))" U G"((i7.i0.u37.p_0_37<1)||(i7.i0.u38.r_0_38<1))")
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i9.i1.u49.t_0_50, i10.i1.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
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
35 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.422701,27020,1,0,25224,53,1416,36172,51,66,35587
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(!(F(X(((X("((((i6.i1.u35.p_0_35<1)||(i7.i0.u36.r_0_36<1))&&(i6.i0.u31.p_0_31>=1))&&(i6.i0.u32.r_0_32>=1))"))||("(i6.i1.u35.p_0_35<1)"))||("(i7.i0.u36.r_0_36<1)")))))))
Formula 1 simplified : !F!FX("(i6.i1.u35.p_0_35<1)" | "(i7.i0.u36.r_0_36<1)" | X"((((i6.i1.u35.p_0_35<1)||(i7.i0.u36.r_0_36<1))&&(i6.i0.u31.p_0_31>=1))&&(i6.i0.u32.r_0_32>=1))")
Computing Next relation with stutter on 49 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.43898,28436,1,0,26028,53,1447,39138,51,66,36953
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(G(("((i7.i0.u36.p_0_36<1)||(i7.i0.u37.r_0_37<1))")U((G(X("((i2.u13.p_0_13<1)||(i2.u14.r_0_14<1))")))U("((i2.u13.p_0_13>=1)&&(i2.u14.r_0_14>=1))")))))))
Formula 2 simplified : !XFG("((i7.i0.u36.p_0_36<1)||(i7.i0.u37.r_0_37<1))" U (GX"((i2.u13.p_0_13<1)||(i2.u14.r_0_14<1))" U "((i2.u13.p_0_13>=1)&&(i2.u14.r_0_14>=1))"))
Computing Next relation with stutter on 49 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
42 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.868689,44252,1,0,59702,53,1550,81690,51,66,79046
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X(((G("(((i2.u15.r_0_15>=1)&&(i2.u65.r_1_15>=1))&&(i3.i0.u66.p_1_16>=1))"))&&(X(F(G("((i9.i0.u47.p_0_47>=1)&&(i9.i1.u48.r_0_48>=1))")))))&&((F("(i9.i1.u49.p_0_49>=1)"))||("((i9.i0.u47.p_0_47>=1)&&(i9.i1.u48.r_0_48>=1))"))))))
Formula 3 simplified : !GX(G"(((i2.u15.r_0_15>=1)&&(i2.u65.r_1_15>=1))&&(i3.i0.u66.p_1_16>=1))" & XFG"((i9.i0.u47.p_0_47>=1)&&(i9.i1.u48.r_0_48>=1))" & ("((i9.i0.u47.p_0_47>=1)&&(i9.i1.u48.r_0_48>=1))" | F"(i9.i1.u49.p_0_49>=1)"))
Computing Next relation with stutter on 49 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2 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.888625,44492,1,0,60800,53,1585,83931,51,66,80765
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F(("(((i3.i1.u20.r_0_20>=1)&&(i3.i1.u70.r_1_20>=1))&&(i3.i1.u71.p_1_21>=1))")U("((i6.i1.u35.p_0_35<1)||(i7.i0.u36.r_0_36<1))")))))
Formula 4 simplified : !GF("(((i3.i1.u20.r_0_20>=1)&&(i3.i1.u70.r_1_20>=1))&&(i3.i1.u71.p_1_21>=1))" U "((i6.i1.u35.p_0_35<1)||(i7.i0.u36.r_0_36<1))")
Computing Next relation with stutter on 49 deadlock states
[2020-05-27 05:11:05] [INFO ] Proved 200 variables to be positive in 1930 ms
[2020-05-27 05:11:05] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2020-05-27 05:11:05] [INFO ] Computation of disable matrix completed :0/102 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:11:05] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:11:05] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2020-05-27 05:11:05] [INFO ] Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:11:07] [INFO ] Computing symmetric co enabling matrix : 102 transitions.
[2020-05-27 05:11:08] [INFO ] Computation of Finished co-enabling matrix. took 1465 ms. Total solver calls (SAT/UNSAT): 251(50/201)
[2020-05-27 05:11:08] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2020-05-27 05:11:08] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:11:08] [INFO ] Built C files in 5125ms 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 2408 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 130 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAP11==true))U((LTLAP12==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAP11==true))U((LTLAP12==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAP11==true))U((LTLAP12==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
641 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,7.30497,136628,1,0,328228,53,1599,189744,51,66,157937
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R050C002-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X("((i5.u28.p_0_28>=1)&&(i5.u29.r_0_29>=1))"))U("((i10.i0.u3.p_0_3>=1)&&(i0.i0.u4.r_0_4>=1))")))
Formula 5 simplified : !(X"((i5.u28.p_0_28>=1)&&(i5.u29.r_0_29>=1))" U "((i10.i0.u3.p_0_3>=1)&&(i0.i0.u4.r_0_4>=1))")
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
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,7.31058,137156,1,0,328439,53,1614,189948,51,66,158509
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F("(((i1.i0.u8.r_0_8>=1)&&(i1.i0.u58.r_1_8>=1))&&(i1.i0.u59.p_1_9>=1))")))
Formula 6 simplified : !F"(((i1.i0.u8.r_0_8>=1)&&(i1.i0.u58.r_1_8>=1))&&(i1.i0.u59.p_1_9>=1))"
Computing Next relation with stutter on 49 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
30 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,7.60825,144020,1,0,346035,53,1669,210971,51,66,176361
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G((!(G("((i7.i0.u36.p_0_36>=1)&&(i7.i0.u37.r_0_37>=1))")))U("((((i1.i1.u11.r_0_11<1)||(i1.i1.u61.r_1_11<1))||(i1.i1.u62.p_1_12<1))||(((i1.i1.u12.r_0_12>=1)&&(i1.i1.u62.r_1_12>=1))&&(i2.u63.p_1_13>=1)))")))U(X(F("(((i1.i1.u11.r_0_11>=1)&&(i1.i1.u61.r_1_11>=1))&&(i1.i1.u62.p_1_12>=1))")))))
Formula 7 simplified : !(G(!G"((i7.i0.u36.p_0_36>=1)&&(i7.i0.u37.r_0_37>=1))" U "((((i1.i1.u11.r_0_11<1)||(i1.i1.u61.r_1_11<1))||(i1.i1.u62.p_1_12<1))||(((i1.i1.u12.r_0_12>=1)&&(i1.i1.u62.r_1_12>=1))&&(i2.u63.p_1_13>=1)))") U XF"(((i1.i1.u11.r_0_11>=1)&&(i1.i1.u61.r_1_11>=1))&&(i1.i1.u62.p_1_12>=1))")
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
13 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,7.74291,148496,1,0,354861,53,1703,221626,51,66,189081
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 : !(((G(!((G((((G("(((i2.u14.r_0_14>=1)&&(i2.u64.r_1_14>=1))&&(i2.u65.p_1_15>=1))"))&&("(i6.i0.u32.r_0_32>=1)"))&&("(i6.i0.u82.r_1_32>=1)"))&&("(i6.i1.u83.p_1_33>=1)")))U(("(((i6.i0.u32.r_0_32>=1)&&(i6.i0.u82.r_1_32>=1))&&(i6.i1.u83.p_1_33>=1))")U(F("((i4.i0.u24.p_0_24>=1)&&(i4.i1.u25.r_0_25>=1))"))))))||(X("(((i3.i1.u20.r_0_20>=1)&&(i3.i1.u70.r_1_20>=1))&&(i3.i1.u71.p_1_21>=1))"))))
Formula 8 simplified : !(G!(G("(i6.i0.u32.r_0_32>=1)" & "(i6.i0.u82.r_1_32>=1)" & "(i6.i1.u83.p_1_33>=1)" & G"(((i2.u14.r_0_14>=1)&&(i2.u64.r_1_14>=1))&&(i2.u65.p_1_15>=1))") U ("(((i6.i0.u32.r_0_32>=1)&&(i6.i0.u82.r_1_32>=1))&&(i6.i1.u83.p_1_33>=1))" U F"((i4.i0.u24.p_0_24>=1)&&(i4.i1.u25.r_0_25>=1))")) | X"(((i3.i1.u20.r_0_20>=1)&&(i3.i1.u70.r_1_20>=1))&&(i3.i1.u71.p_1_21>=1))")
Computing Next relation with stutter on 49 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
12 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,7.86284,152684,1,0,366403,53,1751,234754,51,66,203425
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G(F("(((i1.i0.u9.r_0_9>=1)&&(i1.i0.u59.r_1_9>=1))&&(i1.i1.u60.p_1_10>=1))")))U((G(!(X("(((i6.i0.u31.r_0_31>=1)&&(i6.i0.u81.r_1_31>=1))&&(i6.i0.u82.p_1_32>=1))"))))&&(X("(((i8.u44.r_0_44>=1)&&(i8.u94.r_1_44>=1))&&(i9.i0.u95.p_1_45>=1))")))))
Formula 9 simplified : !(GF"(((i1.i0.u9.r_0_9>=1)&&(i1.i0.u59.r_1_9>=1))&&(i1.i1.u60.p_1_10>=1))" U (G!X"(((i6.i0.u31.r_0_31>=1)&&(i6.i0.u81.r_1_31>=1))&&(i6.i0.u82.p_1_32>=1))" & X"(((i8.u44.r_0_44>=1)&&(i8.u94.r_1_44>=1))&&(i9.i0.u95.p_1_45>=1))"))
Computing Next relation with stutter on 49 deadlock states
672 unique states visited
4 strongly connected components in search stack
674 transitions explored
672 items max in DFS search stack
4213 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.9887,560036,1,0,1.12144e+06,53,1811,1.31827e+06,51,66,619168
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(F(!(F(((("((i9.i0.u46.p_0_46>=1)&&(i9.i0.u47.r_0_47>=1))")U("(((i4.i1.u26.r_0_26>=1)&&(i4.i1.u76.r_1_26>=1))&&(i5.u77.p_1_27>=1))"))||("(i4.i0.u24.p_0_24<1)"))||("(i4.i1.u25.r_0_25<1)"))))))))
Formula 10 simplified : !FGF!F("(i4.i0.u24.p_0_24<1)" | "(i4.i1.u25.r_0_25<1)" | ("((i9.i0.u46.p_0_46>=1)&&(i9.i0.u47.r_0_47>=1))" U "(((i4.i1.u26.r_0_26>=1)&&(i4.i1.u76.r_1_26>=1))&&(i5.u77.p_1_27>=1))"))
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
[2020-05-27 05:31:08] [INFO ] Flatten gal took : 37 ms
[2020-05-27 05:31:08] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
[2020-05-27 05:31:08] [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, --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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((F(G(F(!(F(((("((p_0_46>=1)&&(r_0_47>=1))")U("(((r_0_26>=1)&&(r_1_26>=1))&&(p_1_27>=1))"))||("(p_0_24<1)"))||("(r_0_25<1)"))))))))
Formula 0 simplified : !FGF!F("(p_0_24<1)" | "(r_0_25<1)" | ("((p_0_46>=1)&&(r_0_47>=1))" U "(((r_0_26>=1)&&(r_1_26>=1))&&(p_1_27>=1))"))
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
930 unique states visited
930 strongly connected components in search stack
930 transitions explored
930 items max in DFS search stack
109117 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,1091.2,5136296,1,0,2361,1.53471e+07,26,1716,2831,4.14447e+07,2589
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(G("((p_0_30>=1)&&(r_0_31>=1))"))))
Formula 1 simplified : !XG"((p_0_30>=1)&&(r_0_31>=1))"
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
21 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,1091.44,5136296,1,0,2361,1.53471e+07,35,1716,3667,4.14447e+07,2615
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1590558588614

--------------------
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="ResAllocation-PT-R050C002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R050C002, 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 r193-csrt-159033389200730"
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 [ "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 ;