Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 360K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 257K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.4K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 100K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1620948855103

Running Version 0
[2021-05-13 23:34:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2021-05-13 23:34:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:34:16] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-13 23:34:16] [INFO ] Transformed 102 places.
[2021-05-13 23:34:16] [INFO ] Transformed 126 transitions.
[2021-05-13 23:34:16] [INFO ] Found NUPN structural information;
[2021-05-13 23:34:16] [INFO ] Parsed PT model containing 102 places and 126 transitions in 92 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 102) seen :90
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2021-05-13 23:34:17] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-13 23:34:17] [INFO ] Computed 11 place invariants in 12 ms
[2021-05-13 23:34:17] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-13 23:34:17] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 8 ms returned sat
[2021-05-13 23:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:17] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-13 23:34:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:34:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:17] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 5 ms returned sat
[2021-05-13 23:34:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:17] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-13 23:34:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-13 23:34:17] [INFO ] [Nat]Added 26 Read/Feed constraints in 14 ms returned sat
[2021-05-13 23:34:17] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2021-05-13 23:34:17] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2021-05-13 23:34:17] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 18 ms to minimize.
[2021-05-13 23:34:17] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2021-05-13 23:34:17] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2021-05-13 23:34:17] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2021-05-13 23:34:17] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2021-05-13 23:34:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 470 ms
[2021-05-13 23:34:17] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 8 ms.
[2021-05-13 23:34:18] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2021-05-13 23:34:18] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2021-05-13 23:34:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2021-05-13 23:34:18] [INFO ] Added : 90 causal constraints over 19 iterations in 300 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-13 23:34:18] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-13 23:34:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-13 23:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:18] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-13 23:34:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:34:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:18] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:18] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-13 23:34:18] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-13 23:34:18] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2021-05-13 23:34:18] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2021-05-13 23:34:18] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2021-05-13 23:34:18] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2021-05-13 23:34:18] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2021-05-13 23:34:18] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2021-05-13 23:34:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 202 ms
[2021-05-13 23:34:18] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 8 ms.
[2021-05-13 23:34:18] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2021-05-13 23:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-13 23:34:18] [INFO ] Added : 99 causal constraints over 21 iterations in 213 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-13 23:34:18] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-13 23:34:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-13 23:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:18] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-13 23:34:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:34:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:18] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-13 23:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:18] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-13 23:34:18] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-13 23:34:18] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2021-05-13 23:34:18] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2021-05-13 23:34:18] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2021-05-13 23:34:18] [INFO ] Deduced a trap composed of 34 places in 18 ms of which 0 ms to minimize.
[2021-05-13 23:34:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 139 ms
[2021-05-13 23:34:18] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 7 ms.
[2021-05-13 23:34:19] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2021-05-13 23:34:19] [INFO ] Deduced a trap composed of 29 places in 21 ms of which 0 ms to minimize.
[2021-05-13 23:34:19] [INFO ] Deduced a trap composed of 36 places in 18 ms of which 0 ms to minimize.
[2021-05-13 23:34:19] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:34:19] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
[2021-05-13 23:34:19] [INFO ] Deduced a trap composed of 28 places in 18 ms of which 0 ms to minimize.
[2021-05-13 23:34:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 251 ms
[2021-05-13 23:34:19] [INFO ] Added : 94 causal constraints over 19 iterations in 397 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-13 23:34:19] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:19] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-13 23:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:19] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-13 23:34:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:34:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:19] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:19] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-13 23:34:19] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-13 23:34:19] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2021-05-13 23:34:19] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2021-05-13 23:34:19] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2021-05-13 23:34:19] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2021-05-13 23:34:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 116 ms
[2021-05-13 23:34:19] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 6 ms.
[2021-05-13 23:34:19] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 1 ms to minimize.
[2021-05-13 23:34:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-13 23:34:19] [INFO ] Added : 98 causal constraints over 20 iterations in 194 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-13 23:34:19] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-13 23:34:19] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-13 23:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:19] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-13 23:34:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:34:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:19] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-13 23:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-13 23:34:19] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-13 23:34:19] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2021-05-13 23:34:19] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 30 places in 17 ms of which 1 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 28 places in 17 ms of which 0 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 192 ms
[2021-05-13 23:34:20] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 8 ms.
[2021-05-13 23:34:20] [INFO ] Added : 83 causal constraints over 17 iterations in 129 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-13 23:34:20] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:20] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-13 23:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:20] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-13 23:34:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:34:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-13 23:34:20] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:20] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-13 23:34:20] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 0 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 25 places in 17 ms of which 0 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 30 places in 19 ms of which 0 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 156 ms
[2021-05-13 23:34:20] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 7 ms.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 12 places in 9 ms of which 0 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2021-05-13 23:34:20] [INFO ] Added : 102 causal constraints over 21 iterations in 181 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-13 23:34:20] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-13 23:34:20] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-13 23:34:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:34:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:20] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:20] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-13 23:34:20] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2021-05-13 23:34:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 163 ms
[2021-05-13 23:34:20] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 10 ms.
[2021-05-13 23:34:21] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 8 ms to minimize.
[2021-05-13 23:34:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-13 23:34:21] [INFO ] Added : 77 causal constraints over 16 iterations in 175 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 23:34:21] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-13 23:34:21] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:21] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-13 23:34:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:34:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:21] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:21] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-13 23:34:21] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-13 23:34:21] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2021-05-13 23:34:21] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2021-05-13 23:34:21] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2021-05-13 23:34:21] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2021-05-13 23:34:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 125 ms
[2021-05-13 23:34:21] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 7 ms.
[2021-05-13 23:34:21] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2021-05-13 23:34:21] [INFO ] Deduced a trap composed of 8 places in 12 ms of which 0 ms to minimize.
[2021-05-13 23:34:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2021-05-13 23:34:21] [INFO ] Added : 94 causal constraints over 19 iterations in 211 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-13 23:34:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:21] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-13 23:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:21] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-13 23:34:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:34:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:21] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-13 23:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:21] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-13 23:34:21] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-13 23:34:21] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2021-05-13 23:34:21] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2021-05-13 23:34:21] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2021-05-13 23:34:21] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2021-05-13 23:34:21] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2021-05-13 23:34:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 154 ms
[2021-05-13 23:34:21] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 6 ms.
[2021-05-13 23:34:21] [INFO ] Added : 90 causal constraints over 19 iterations in 141 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-13 23:34:21] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-13 23:34:21] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:22] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-13 23:34:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:34:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:22] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-13 23:34:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:22] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-13 23:34:22] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 46 places in 26 ms of which 0 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 26 places in 16 ms of which 0 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 193 ms
[2021-05-13 23:34:22] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 7 ms.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 15 places in 14 ms of which 0 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2021-05-13 23:34:22] [INFO ] Added : 88 causal constraints over 18 iterations in 220 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-13 23:34:22] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:22] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-13 23:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:22] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-13 23:34:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:34:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:22] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:34:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:22] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-13 23:34:22] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 7 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 26 places in 18 ms of which 1 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 188 ms
[2021-05-13 23:34:22] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 6 ms.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 1 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Deduced a trap composed of 15 places in 9 ms of which 0 ms to minimize.
[2021-05-13 23:34:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 45 ms
[2021-05-13 23:34:22] [INFO ] Added : 93 causal constraints over 19 iterations in 197 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 23:34:23] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:23] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-13 23:34:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:23] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-13 23:34:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:34:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-13 23:34:23] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 23:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:34:23] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-13 23:34:23] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-13 23:34:23] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2021-05-13 23:34:23] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2021-05-13 23:34:23] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2021-05-13 23:34:23] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2021-05-13 23:34:23] [INFO ] Deduced a trap composed of 26 places in 18 ms of which 1 ms to minimize.
[2021-05-13 23:34:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 148 ms
[2021-05-13 23:34:23] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 11 ms.
[2021-05-13 23:34:23] [INFO ] Deduced a trap composed of 8 places in 11 ms of which 0 ms to minimize.
[2021-05-13 23:34:23] [INFO ] Deduced a trap composed of 15 places in 14 ms of which 1 ms to minimize.
[2021-05-13 23:34:23] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 0 ms to minimize.
[2021-05-13 23:34:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 72 ms
[2021-05-13 23:34:23] [INFO ] Added : 97 causal constraints over 20 iterations in 225 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Incomplete Parikh walk after 15800 steps, including 516 resets, run finished after 64 ms. (steps per millisecond=246 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 17800 steps, including 774 resets, run finished after 67 ms. (steps per millisecond=265 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 13700 steps, including 358 resets, run finished after 38 ms. (steps per millisecond=360 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11100 steps, including 445 resets, run finished after 35 ms. (steps per millisecond=317 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10600 steps, including 626 resets, run finished after 26 ms. (steps per millisecond=407 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16600 steps, including 571 resets, run finished after 40 ms. (steps per millisecond=415 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 7700 steps, including 221 resets, run finished after 18 ms. (steps per millisecond=427 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14800 steps, including 576 resets, run finished after 37 ms. (steps per millisecond=400 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12100 steps, including 568 resets, run finished after 29 ms. (steps per millisecond=417 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 9900 steps, including 531 resets, run finished after 24 ms. (steps per millisecond=412 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 13000 steps, including 392 resets, run finished after 31 ms. (steps per millisecond=419 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16000 steps, including 460 resets, run finished after 39 ms. (steps per millisecond=410 ) properties (out of 10) seen :0 could not realise parikh vector
Support contains 10 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 102 transition count 96
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 72 transition count 96
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 60 place count 72 transition count 78
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 96 place count 54 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 52 transition count 76
Applied a total of 100 rules in 21 ms. Remains 52 /102 variables (removed 50) and now considering 76/126 (removed 50) transitions.
Finished structural reductions, in 1 iterations. Remains : 52/102 places, 76/126 transitions.
[2021-05-13 23:34:24] [INFO ] Flatten gal took : 32 ms
[2021-05-13 23:34:24] [INFO ] Flatten gal took : 10 ms
[2021-05-13 23:34:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8092355894171249220.gal : 7 ms
[2021-05-13 23:34:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15042838937218471862.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8092355894171249220.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15042838937218471862.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.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8092355894171249220.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15042838937218471862.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15042838937218471862.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :4 after 17
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :17 after 25
Invariant property smplace_14 does not hold.
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :25 after 48
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :48 after 64
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :64 after 283
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :283 after 604
Invariant property smplace_15 does not hold.
Invariant property smplace_8 does not hold.
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :604 after 1058
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,1958,0.060416,5712,2,985,17,7252,13,0,294,7076,0
Total reachable state count : 1958

Verifying 10 reachability properties.
Invariant property smplace_8 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_8,104,0.060832,5976,2,249,17,7252,14,0,297,7076,0
Invariant property smplace_11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_11,40,0.061117,5976,2,249,17,7252,14,0,298,7076,0
Invariant property smplace_13 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_13,104,0.061313,5976,2,249,17,7252,14,0,299,7076,0
Invariant property smplace_14 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_14,24,0.061534,5976,2,176,17,7252,15,0,301,7076,0
Invariant property smplace_15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_15,36,0.061897,5976,2,240,17,7252,16,0,303,7076,0
Invariant property smplace_18 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_18,40,0.062228,5976,2,249,17,7252,16,0,304,7076,0
Invariant property smplace_40 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_40,104,0.062409,5976,2,249,17,7252,16,0,305,7076,0
Invariant property smplace_43 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_43,40,0.062581,5976,2,249,17,7252,16,0,306,7076,0
Invariant property smplace_80 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_80,40,0.062839,5976,2,249,17,7252,16,0,307,7076,0
Invariant property smplace_83 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_83,104,0.063233,5976,2,249,17,7252,16,0,308,7076,0
Able to resolve query StableMarking after proving 102 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL

BK_STOP 1620948865196

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Peterson-PT-2"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-2, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r147-tall-162089138200378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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