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

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R050C002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590556252846

[2020-05-27 05:10:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:10:55] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2020-05-27 05:10:55] [INFO ] Transformed 200 places.
[2020-05-27 05:10:55] [INFO ] Transformed 102 transitions.
[2020-05-27 05:10:55] [INFO ] Parsed PT model containing 200 places and 102 transitions in 150 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 86 ms. (steps per millisecond=116 ) properties seen :[0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0]
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 102 rows 200 cols
[2020-05-27 05:10:55] [INFO ] Computed 100 place invariants in 8 ms
[2020-05-27 05:10:55] [INFO ] [Real]Absence check using 100 positive place invariants in 72 ms returned sat
[2020-05-27 05:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:56] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2020-05-27 05:10:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:56] [INFO ] [Nat]Absence check using 100 positive place invariants in 58 ms returned sat
[2020-05-27 05:10:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:56] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2020-05-27 05:10:56] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-05-27 05:10:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2020-05-27 05:10:56] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 39 ms.
[2020-05-27 05:10:57] [INFO ] Added : 79 causal constraints over 16 iterations in 466 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned unsat
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using 100 positive place invariants in 53 ms returned unsat
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using 100 positive place invariants in 80 ms returned unsat
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using 100 positive place invariants in 21 ms returned unsat
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using 100 positive place invariants in 37 ms returned unsat
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using 100 positive place invariants in 49 ms returned unsat
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 100 positive place invariants in 51 ms returned unsat
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 61800 steps, including 148 resets, run finished after 217 ms. (steps per millisecond=284 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 197 transition count 100
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 197 transition count 99
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 195 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 193 transition count 98
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 193 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 191 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 189 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 189 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 187 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 185 transition count 94
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 185 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 183 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 29 place count 181 transition count 92
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 181 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 32 place count 179 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 35 place count 177 transition count 90
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 177 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 38 place count 175 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 41 place count 173 transition count 88
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 42 place count 173 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 44 place count 171 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 47 place count 169 transition count 86
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 48 place count 169 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 50 place count 167 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 53 place count 165 transition count 84
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 54 place count 165 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 56 place count 163 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 59 place count 161 transition count 82
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 60 place count 161 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 62 place count 159 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 63 place count 159 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 64 place count 158 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 65 place count 158 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 68 place count 155 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 70 place count 154 transition count 78
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 71 place count 154 transition count 77
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 74 place count 151 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 76 place count 150 transition count 76
Applied a total of 76 rules in 255 ms. Remains 150 /200 variables (removed 50) and now considering 76/102 (removed 26) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/200 places, 76/102 transitions.
Incomplete random walk after 1000000 steps, including 2695 resets, run finished after 2244 ms. (steps per millisecond=445 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 438 resets, run finished after 1378 ms. (steps per millisecond=725 ) properties seen :[0]
Interrupted probabilistic random walk after 20957281 steps, run timeout after 30001 ms. (steps per millisecond=698 ) properties seen :[0]
Probabilistic random walk after 20957281 steps, saw 3465319 distinct states, run finished after 30001 ms. (steps per millisecond=698 ) properties seen :[0]
// Phase 1: matrix 76 rows 150 cols
[2020-05-27 05:11:32] [INFO ] Computed 76 place invariants in 3 ms
[2020-05-27 05:11:32] [INFO ] [Real]Absence check using 76 positive place invariants in 121 ms returned sat
[2020-05-27 05:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:32] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2020-05-27 05:11:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:11:32] [INFO ] [Nat]Absence check using 76 positive place invariants in 31 ms returned sat
[2020-05-27 05:11:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:32] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2020-05-27 05:11:32] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-27 05:11:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2020-05-27 05:11:32] [INFO ] Computed and/alt/rep : 74/74/74 causal constraints in 17 ms.
[2020-05-27 05:11:32] [INFO ] Added : 58 causal constraints over 12 iterations in 130 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 41300 steps, including 163 resets, run finished after 83 ms. (steps per millisecond=497 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 150/150 places, 76/76 transitions.
Applied a total of 0 rules in 14 ms. Remains 150 /150 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 76/76 transitions.
Starting structural reductions, iteration 0 : 150/150 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 150 cols
[2020-05-27 05:11:32] [INFO ] Computed 76 place invariants in 2 ms
[2020-05-27 05:11:33] [INFO ] Implicit Places using invariants in 365 ms returned [77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 145, 147, 149]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 380 ms to find 37 implicit places.
[2020-05-27 05:11:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 113 cols
[2020-05-27 05:11:33] [INFO ] Computed 39 place invariants in 1 ms
[2020-05-27 05:11:33] [INFO ] Dead Transitions using invariants and state equation in 139 ms returned []
Starting structural reductions, iteration 1 : 113/150 places, 76/76 transitions.
Applied a total of 0 rules in 5 ms. Remains 113 /113 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2020-05-27 05:11:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 113 cols
[2020-05-27 05:11:33] [INFO ] Computed 39 place invariants in 1 ms
[2020-05-27 05:11:33] [INFO ] Dead Transitions using invariants and state equation in 207 ms returned []
Finished structural reductions, in 2 iterations. Remains : 113/150 places, 76/76 transitions.
Incomplete random walk after 1000000 steps, including 2696 resets, run finished after 1438 ms. (steps per millisecond=695 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 435 resets, run finished after 733 ms. (steps per millisecond=1364 ) properties seen :[0]
Interrupted probabilistic random walk after 27426061 steps, run timeout after 30001 ms. (steps per millisecond=914 ) properties seen :[0]
Probabilistic random walk after 27426061 steps, saw 4490634 distinct states, run finished after 30004 ms. (steps per millisecond=914 ) properties seen :[0]
// Phase 1: matrix 76 rows 113 cols
[2020-05-27 05:12:05] [INFO ] Computed 39 place invariants in 1 ms
[2020-05-27 05:12:05] [INFO ] [Real]Absence check using 39 positive place invariants in 22 ms returned sat
[2020-05-27 05:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:12:06] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2020-05-27 05:12:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:12:06] [INFO ] [Nat]Absence check using 39 positive place invariants in 106 ms returned sat
[2020-05-27 05:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:12:06] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2020-05-27 05:12:06] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-27 05:12:06] [INFO ] Deduced a trap composed of 3 places in 31 ms
[2020-05-27 05:12:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2020-05-27 05:12:06] [INFO ] Computed and/alt/rep : 74/74/74 causal constraints in 4 ms.
[2020-05-27 05:12:06] [INFO ] Added : 58 causal constraints over 12 iterations in 91 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 42700 steps, including 160 resets, run finished after 58 ms. (steps per millisecond=736 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 113/113 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 76/76 transitions.
Starting structural reductions, iteration 0 : 113/113 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 113 cols
[2020-05-27 05:12:06] [INFO ] Computed 39 place invariants in 0 ms
[2020-05-27 05:12:06] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 76 rows 113 cols
[2020-05-27 05:12:06] [INFO ] Computed 39 place invariants in 0 ms
[2020-05-27 05:12:07] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2020-05-27 05:12:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 113 cols
[2020-05-27 05:12:07] [INFO ] Computed 39 place invariants in 1 ms
[2020-05-27 05:12:07] [INFO ] Dead Transitions using invariants and state equation in 128 ms returned []
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 76/76 transitions.
Incomplete random walk after 100000 steps, including 269 resets, run finished after 118 ms. (steps per millisecond=847 ) properties seen :[0]
// Phase 1: matrix 76 rows 113 cols
[2020-05-27 05:12:07] [INFO ] Computed 39 place invariants in 1 ms
[2020-05-27 05:12:07] [INFO ] [Real]Absence check using 39 positive place invariants in 25 ms returned sat
[2020-05-27 05:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:12:07] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-05-27 05:12:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:12:07] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2020-05-27 05:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:12:07] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2020-05-27 05:12:07] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-05-27 05:12:07] [INFO ] Deduced a trap composed of 3 places in 16 ms
[2020-05-27 05:12:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2020-05-27 05:12:07] [INFO ] Computed and/alt/rep : 74/74/74 causal constraints in 6 ms.
[2020-05-27 05:12:07] [INFO ] Added : 58 causal constraints over 12 iterations in 99 ms. Result :sat
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 111 transition count 75
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 111 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 110 transition count 74
Applied a total of 5 rules in 19 ms. Remains 110 /113 variables (removed 3) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 110 cols
[2020-05-27 05:12:07] [INFO ] Computed 38 place invariants in 0 ms
[2020-05-27 05:12:07] [INFO ] [Real]Absence check using 38 positive place invariants in 17 ms returned sat
[2020-05-27 05:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:12:07] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-05-27 05:12:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:12:07] [INFO ] [Nat]Absence check using 38 positive place invariants in 14 ms returned sat
[2020-05-27 05:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:12:07] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2020-05-27 05:12:07] [INFO ] Computed and/alt/rep : 72/72/72 causal constraints in 4 ms.
[2020-05-27 05:12:08] [INFO ] Added : 57 causal constraints over 12 iterations in 66 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2020-05-27 05:12:08] [INFO ] Flatten gal took : 73 ms
Using solver Z3 to compute partial order matrices.
[2020-05-27 05:12:08] [INFO ] Flatten gal took : 39 ms
Built C files in :
/home/mcc/execution
[2020-05-27 05:12:08] [INFO ] Applying decomposition
[2020-05-27 05:12:08] [INFO ] Flatten gal took : 7 ms
[2020-05-27 05:12:08] [INFO ] Input system was already deterministic with 76 transitions.
[2020-05-27 05:12:08] [INFO ] Input system was already deterministic with 76 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/graph11320876324083870636.txt, -o, /tmp/graph11320876324083870636.bin, -w, /tmp/graph11320876324083870636.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 76 rows 113 cols
[2020-05-27 05:12:08] [INFO ] Computed 39 place invariants in 0 ms
inv : p_0_34 + r_0_34 + p_1_34 = 1
inv : p_0_23 + r_0_23 + p_1_23 = 1
inv : p_0_12 + r_0_12 + p_1_12 = 1
inv : r_0_10 + p_1_10 = 1
inv : p_0_43 + r_0_43 + p_1_43 = 1
inv : p_0_25 + r_0_25 + p_1_25 = 1
inv : p_0_14 + r_0_14 + p_1_14 = 1
inv : p_0_32 + r_0_32 + p_1_32 = 1
inv : p_0_36 + r_0_36 + p_1_36 = 1
inv : p_0_15 + r_0_15 + p_1_15 = 1
inv : p_0_26 + r_0_26 + p_1_26 = 1
inv : p_0_37 + r_0_37 + p_1_37 = 1
inv : p_0_42 + r_0_42 + p_1_42 = 1
inv : p_0_31 + r_0_31 + p_1_31 = 1
inv : p_0_20 + r_0_20 + p_1_20 = 1
inv : p_1_10 + r_1_10 = 1
inv : p_0_16 + r_0_16 + p_1_16 = 1
inv : r_0_47 + p_1_47 = 1
inv : p_0_44 + r_0_44 + p_1_44 = 1
inv : p_0_33 + r_0_33 + p_1_33 = 1
inv : p_0_19 + r_0_19 + p_1_19 = 1
inv : p_0_35 + r_0_35 + p_1_35 = 1
inv : p_0_30 + r_0_30 + p_1_30 = 1
inv : p_0_21 + r_0_21 + p_1_21 = 1
inv : p_0_13 + r_0_13 + p_1_13 = 1
inv : p_0_38 + r_0_38 + p_1_38 = 1
inv : p_0_41 + r_0_41 + p_1_41 = 1
inv : p_0_24 + r_0_24 + p_1_24 = 1
inv : p_0_27 + r_0_27 + p_1_27 = 1
inv : p_0_18 + r_0_18 + p_1_18 = 1
inv : p_0_11 + r_0_11 + p_1_11 = 1
inv : p_0_40 + r_0_40 + p_1_40 = 1
inv : p_0_39 + r_0_39 + p_1_39 = 1
inv : p_0_46 + r_0_46 + p_1_46 = 1
inv : p_0_29 + r_0_29 + p_1_29 = 1
inv : p_0_22 + r_0_22 + p_1_22 = 1
inv : p_0_17 + r_0_17 + p_1_17 = 1
inv : p_0_28 + r_0_28 + p_1_28 = 1
inv : p_0_45 + r_0_45 + p_1_45 = 1
Total of 39 invariants.
[2020-05-27 05:12:08] [INFO ] Computed 39 place invariants in 2 ms
[2020-05-27 05:12:08] [INFO ] Ran tautology test, simplified 0 / 1 in 424 ms.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph11320876324083870636.bin, -l, -1, -v, -w, /tmp/graph11320876324083870636.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 05:12:08] [INFO ] BMC solution for property ResAllocation-PT-R050C002-ReachabilityCardinality-00(UNSAT) depth K=0 took 82 ms
[2020-05-27 05:12:08] [INFO ] BMC solution for property ResAllocation-PT-R050C002-ReachabilityCardinality-00(UNSAT) depth K=1 took 1 ms
[2020-05-27 05:12:08] [INFO ] BMC solution for property ResAllocation-PT-R050C002-ReachabilityCardinality-00(UNSAT) depth K=2 took 9 ms
[2020-05-27 05:12:08] [INFO ] Decomposing Gal with order
[2020-05-27 05:12:08] [INFO ] BMC solution for property ResAllocation-PT-R050C002-ReachabilityCardinality-00(UNSAT) depth K=3 took 38 ms
[2020-05-27 05:12:08] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 76 rows 113 cols
[2020-05-27 05:12:08] [INFO ] Computed 39 place invariants in 0 ms
inv : p_0_34 + r_0_34 + p_1_34 = 1
inv : p_0_23 + r_0_23 + p_1_23 = 1
inv : p_0_12 + r_0_12 + p_1_12 = 1
inv : r_0_10 + p_1_10 = 1
inv : p_0_43 + r_0_43 + p_1_43 = 1
inv : p_0_25 + r_0_25 + p_1_25 = 1
inv : p_0_14 + r_0_14 + p_1_14 = 1
inv : p_0_32 + r_0_32 + p_1_32 = 1
inv : p_0_36 + r_0_36 + p_1_36 = 1
inv : p_0_15 + r_0_15 + p_1_15 = 1
inv : p_0_26 + r_0_26 + p_1_26 = 1
inv : p_0_37 + r_0_37 + p_1_37 = 1
inv : p_0_42 + r_0_42 + p_1_42 = 1
inv : p_0_31 + r_0_31 + p_1_31 = 1
inv : p_0_20 + r_0_20 + p_1_20 = 1
inv : p_1_10 + r_1_10 = 1
inv : p_0_16 + r_0_16 + p_1_16 = 1
inv : r_0_47 + p_1_47 = 1
inv : p_0_44 + r_0_44 + p_1_44 = 1
inv : p_0_33 + r_0_33 + p_1_33 = 1
inv : p_0_19 + r_0_19 + p_1_19 = 1
inv : p_0_35 + r_0_35 + p_1_35 = 1
inv : p_0_30 + r_0_30 + p_1_30 = 1
inv : p_0_21 + r_0_21 + p_1_21 = 1
inv : p_0_13 + r_0_13 + p_1_13 = 1
inv : p_0_38 + r_0_38 + p_1_38 = 1
inv : p_0_41 + r_0_41 + p_1_41 = 1
inv : p_0_24 + r_0_24 + p_1_24 = 1
inv : p_0_27 + r_0_27 + p_1_27 = 1
inv : p_0_18 + r_0_18 + p_1_18 = 1
inv : p_0_11 + r_0_11 + p_1_11 = 1
inv : p_0_40 + r_0_40 + p_1_40 = 1
inv : p_0_39 + r_0_39 + p_1_39 = 1
inv : p_0_46 + r_0_46 + p_1_46 = 1
inv : p_0_29 + r_0_29 + p_1_29 = 1
inv : p_0_22 + r_0_22 + p_1_22 = 1
inv : p_0_17 + r_0_17 + p_1_17 = 1
inv : p_0_28 + r_0_28 + p_1_28 = 1
inv : p_0_45 + r_0_45 + p_1_45 = 1
Total of 39 invariants.
[2020-05-27 05:12:08] [INFO ] Computed 39 place invariants in 1 ms
[2020-05-27 05:12:09] [INFO ] Flatten gal took : 50 ms
[2020-05-27 05:12:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-27 05:12:09] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 10 ms
[2020-05-27 05:12:09] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : ResAllocation-PT-R050C002-ReachabilityCardinality-00 with value :((gu22.p_0_32<=gu22.r_1_10)||((gi0.gi2.gi1.gi1.gu37.p_1_47>=1)&&((gu22.p_0_32<=gu22.p_0_42)||(gu38.p_1_15<=gu38.p_0_44))))
[2020-05-27 05:12:09] [INFO ] BMC solution for property ResAllocation-PT-R050C002-ReachabilityCardinality-00(UNSAT) depth K=4 took 268 ms
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
[2020-05-27 05:12:09] [INFO ] Proved 113 variables to be positive in 576 ms
[2020-05-27 05:12:09] [INFO ] Computing symmetric may disable matrix : 76 transitions.
SDD proceeding with computation, new max is 2048
[2020-05-27 05:12:09] [INFO ] Computation of disable matrix completed :0/76 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:12:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:12:09] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2020-05-27 05:12:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,2.74878e+12,0.119623,6720,2,295,24,13920,7,0,538,16201,0
Total reachable state count : 2748779069440

Verifying 1 reachability properties.
Invariant property ResAllocation-PT-R050C002-ReachabilityCardinality-00 is true.
FORMULA ResAllocation-PT-R050C002-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R050C002-ReachabilityCardinality-00,0,0.120395,6984,1,0,24,13920,7,0,543,16201,0
[2020-05-27 05:12:09] [WARNING] Interrupting SMT solver.
[2020-05-27 05:12:09] [INFO ] Proved 113 variables to be positive in 385 ms
[2020-05-27 05:12:09] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 05:12:09] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-27 05:12:09] [WARNING] Unexpected error occurred while running SMT. Was verifying ResAllocation-PT-R050C002-ReachabilityCardinality-00 SMT depth 5
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-27 05:12:09] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
[2020-05-27 05:12:09] [INFO ] During BMC, SMT solver timed out at depth 5
[2020-05-27 05:12:09] [INFO ] BMC solving timed out (3600000 secs) at depth 5
[2020-05-27 05:12:09] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
[2020-05-27 05:12:09] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 41) 1) (>= (select s0 44) 1)) (= (store (store (store (store s0 41 (- (select s0 41) 1)) 43 (+ (select s0 43) 1)) 42 (+ (select s0 42) 1)) 44 (- (select s0 44) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (>= (select s0 41) 1) (>= (select s0 44) 1)) (= (store (store (store (store s0 41 (- (select s0 41) 1)) 43 (+ (select s0 43) 1)) 42 (+ (select s0 42) 1)) 44 (- (select s0 44) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 05:12:09] [INFO ] Built C files in 799ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590556329649

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-159033389200734"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;