Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.1K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 53K May 12 08:13 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME net-ReachabilityCardinality-00
FORMULA_NAME net-ReachabilityCardinality-01
FORMULA_NAME net-ReachabilityCardinality-02
FORMULA_NAME net-ReachabilityCardinality-03
FORMULA_NAME net-ReachabilityCardinality-04
FORMULA_NAME net-ReachabilityCardinality-05
FORMULA_NAME net-ReachabilityCardinality-06
FORMULA_NAME net-ReachabilityCardinality-07
FORMULA_NAME net-ReachabilityCardinality-08
FORMULA_NAME net-ReachabilityCardinality-09
FORMULA_NAME net-ReachabilityCardinality-10
FORMULA_NAME net-ReachabilityCardinality-11
FORMULA_NAME net-ReachabilityCardinality-12
FORMULA_NAME net-ReachabilityCardinality-13
FORMULA_NAME net-ReachabilityCardinality-14
FORMULA_NAME net-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621342158060

[2021-05-18 12:49:19] [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]
[2021-05-18 12:49:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:49:19] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-18 12:49:19] [INFO ] Transformed 163 places.
[2021-05-18 12:49:19] [INFO ] Transformed 348 transitions.
[2021-05-18 12:49:19] [INFO ] Found NUPN structural information;
[2021-05-18 12:49:19] [INFO ] Parsed PT model containing 163 places and 348 transitions in 90 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA net-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA net-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 924 resets, run finished after 73 ms. (steps per millisecond=136 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0]
FORMULA net-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 120 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 1, 0, 0]
FORMULA net-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA net-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-18 12:49:19] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
// Phase 1: matrix 307 rows 163 cols
[2021-05-18 12:49:19] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-18 12:49:20] [INFO ] [Real]Absence check using 10 positive place invariants in 24 ms returned sat
[2021-05-18 12:49:20] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2021-05-18 12:49:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:20] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-18 12:49:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-18 12:49:20] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:49:20] [INFO ] Deduced a trap composed of 30 places in 76 ms
[2021-05-18 12:49:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2021-05-18 12:49:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 52 ms returned sat
[2021-05-18 12:49:20] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-18 12:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:20] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-18 12:49:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:49:20] [INFO ] Deduced a trap composed of 40 places in 72 ms
[2021-05-18 12:49:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2021-05-18 12:49:20] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 21 ms.
[2021-05-18 12:49:23] [INFO ] Added : 174 causal constraints over 36 iterations in 2457 ms. Result :sat
[2021-05-18 12:49:23] [INFO ] Deduced a trap composed of 40 places in 47 ms
[2021-05-18 12:49:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2021-05-18 12:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:49:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:23] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-18 12:49:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 46 ms returned sat
[2021-05-18 12:49:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:23] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-18 12:49:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-18 12:49:23] [INFO ] Deduced a trap composed of 30 places in 27 ms
[2021-05-18 12:49:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-18 12:49:23] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 18 ms.
[2021-05-18 12:49:24] [INFO ] Added : 139 causal constraints over 28 iterations in 605 ms. Result :sat
[2021-05-18 12:49:24] [INFO ] Deduced a trap composed of 30 places in 26 ms
[2021-05-18 12:49:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-18 12:49:24] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:49:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:24] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-18 12:49:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 53 ms returned sat
[2021-05-18 12:49:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-18 12:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:24] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:49:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:49:24] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 16 ms.
[2021-05-18 12:49:26] [INFO ] Added : 172 causal constraints over 36 iterations in 1343 ms. Result :sat
[2021-05-18 12:49:26] [INFO ] Deduced a trap composed of 42 places in 47 ms
[2021-05-18 12:49:26] [INFO ] Deduced a trap composed of 41 places in 37 ms
[2021-05-18 12:49:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
[2021-05-18 12:49:26] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:49:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:26] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-18 12:49:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 45 ms returned sat
[2021-05-18 12:49:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-18 12:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:26] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-18 12:49:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-18 12:49:26] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 20 ms.
[2021-05-18 12:49:27] [INFO ] Added : 161 causal constraints over 33 iterations in 1096 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-18 12:49:27] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-18 12:49:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-18 12:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:28] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2021-05-18 12:49:28] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 46 places in 57 ms
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 44 places in 51 ms
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 39 places in 49 ms
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 39 places in 49 ms
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 37 places in 51 ms
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 39 places in 50 ms
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 39 places in 49 ms
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 37 places in 50 ms
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 39 places in 52 ms
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 39 places in 51 ms
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 40 places in 50 ms
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 40 places in 50 ms
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 45 places in 50 ms
[2021-05-18 12:49:28] [INFO ] Deduced a trap composed of 39 places in 45 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 44 places in 47 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 30 places in 51 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 39 places in 49 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 40 places in 42 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 37 places in 44 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 39 places in 40 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 40 places in 44 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 39 places in 32 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 39 places in 32 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 37 places in 43 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 39 places in 42 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 38 places in 54 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 39 places in 61 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 39 places in 43 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 40 places in 44 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 38 places in 44 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 39 places in 44 ms
[2021-05-18 12:49:29] [INFO ] Deduced a trap composed of 39 places in 35 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 43 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 38 places in 52 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 39 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 32 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 46 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 41 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 42 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 35 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 41 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 40 places in 31 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 38 places in 32 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 33 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 31 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 31 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 40 places in 42 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 40 places in 33 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 38 places in 43 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 32 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 40 places in 33 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 40 places in 33 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 32 ms
[2021-05-18 12:49:30] [INFO ] Deduced a trap composed of 39 places in 31 ms
[2021-05-18 12:49:31] [INFO ] Deduced a trap composed of 39 places in 33 ms
[2021-05-18 12:49:31] [INFO ] Deduced a trap composed of 40 places in 33 ms
[2021-05-18 12:49:31] [INFO ] Deduced a trap composed of 39 places in 31 ms
[2021-05-18 12:49:31] [INFO ] Deduced a trap composed of 39 places in 31 ms
[2021-05-18 12:49:31] [INFO ] Deduced a trap composed of 39 places in 40 ms
[2021-05-18 12:49:31] [INFO ] Deduced a trap composed of 38 places in 33 ms
[2021-05-18 12:49:31] [INFO ] Deduced a trap composed of 39 places in 40 ms
[2021-05-18 12:49:31] [INFO ] Deduced a trap composed of 39 places in 41 ms
[2021-05-18 12:49:31] [INFO ] Deduced a trap composed of 38 places in 40 ms
[2021-05-18 12:49:31] [INFO ] Deduced a trap composed of 40 places in 39 ms
[2021-05-18 12:49:31] [INFO ] Deduced a trap composed of 39 places in 40 ms
[2021-05-18 12:49:31] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 3389 ms
[2021-05-18 12:49:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:49:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 43 ms returned sat
[2021-05-18 12:49:31] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2021-05-18 12:49:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:49:31] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2021-05-18 12:49:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-18 12:49:31] [INFO ] Computed and/alt/rep : 318/2550/306 causal constraints in 19 ms.
[2021-05-18 12:49:33] [INFO ] Added : 178 causal constraints over 36 iterations in 1519 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
Incomplete Parikh walk after 17400 steps, including 1157 resets, run finished after 72 ms. (steps per millisecond=241 ) properties seen :[0, 0, 0, 1, 0] could not realise parikh vector
FORMULA net-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 18300 steps, including 745 resets, run finished after 66 ms. (steps per millisecond=277 ) properties seen :[1, 1, 0, 1] could not realise parikh vector
FORMULA net-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA net-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 2117 steps, including 42 resets, run visited all 1 properties in 7 ms. (steps per millisecond=302 )
FORMULA net-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621342174399

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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