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.r292-tall-162124156400391.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 HealthRecord-PT-17, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156400391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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.2K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:49 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 119K 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-ReachabilityFireability-00
FORMULA_NAME net-ReachabilityFireability-01
FORMULA_NAME net-ReachabilityFireability-02
FORMULA_NAME net-ReachabilityFireability-03
FORMULA_NAME net-ReachabilityFireability-04
FORMULA_NAME net-ReachabilityFireability-05
FORMULA_NAME net-ReachabilityFireability-06
FORMULA_NAME net-ReachabilityFireability-07
FORMULA_NAME net-ReachabilityFireability-08
FORMULA_NAME net-ReachabilityFireability-09
FORMULA_NAME net-ReachabilityFireability-10
FORMULA_NAME net-ReachabilityFireability-11
FORMULA_NAME net-ReachabilityFireability-12
FORMULA_NAME net-ReachabilityFireability-13
FORMULA_NAME net-ReachabilityFireability-14
FORMULA_NAME net-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621284183125

Running Version 0
[2021-05-17 20:43:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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, 3600]
[2021-05-17 20:43:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:43:04] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-17 20:43:04] [INFO ] Transformed 624 places.
[2021-05-17 20:43:04] [INFO ] Transformed 828 transitions.
[2021-05-17 20:43:04] [INFO ] Found NUPN structural information;
[2021-05-17 20:43:04] [INFO ] Parsed PT model containing 624 places and 828 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 87 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :7
FORMULA net-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA net-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 828 rows 624 cols
[2021-05-17 20:43:05] [INFO ] Computed 18 place invariants in 29 ms
[2021-05-17 20:43:05] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2021-05-17 20:43:05] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:43:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:05] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-17 20:43:06] [INFO ] Deduced a trap composed of 204 places in 263 ms of which 6 ms to minimize.
[2021-05-17 20:43:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2021-05-17 20:43:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:43:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2021-05-17 20:43:06] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:43:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:06] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2021-05-17 20:43:06] [INFO ] Deduced a trap composed of 204 places in 209 ms of which 2 ms to minimize.
[2021-05-17 20:43:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2021-05-17 20:43:06] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 66 ms.
[2021-05-17 20:43:09] [INFO ] Added : 287 causal constraints over 58 iterations in 2242 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-17 20:43:09] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2021-05-17 20:43:09] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:43:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:09] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2021-05-17 20:43:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:43:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2021-05-17 20:43:09] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:43:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:09] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2021-05-17 20:43:10] [INFO ] Deduced a trap composed of 130 places in 117 ms of which 2 ms to minimize.
[2021-05-17 20:43:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 140 ms
[2021-05-17 20:43:10] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2021-05-17 20:43:10] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:10] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-17 20:43:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:43:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2021-05-17 20:43:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:43:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:10] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2021-05-17 20:43:11] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 0 ms to minimize.
[2021-05-17 20:43:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2021-05-17 20:43:11] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 41 ms.
[2021-05-17 20:43:11] [INFO ] Added : 89 causal constraints over 19 iterations in 708 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-17 20:43:11] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2021-05-17 20:43:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:12] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-17 20:43:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:43:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2021-05-17 20:43:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:43:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:12] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2021-05-17 20:43:12] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 1 ms to minimize.
[2021-05-17 20:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2021-05-17 20:43:12] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 46 ms.
[2021-05-17 20:43:13] [INFO ] Added : 108 causal constraints over 22 iterations in 895 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-17 20:43:13] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2021-05-17 20:43:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:14] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2021-05-17 20:43:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:43:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2021-05-17 20:43:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:14] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2021-05-17 20:43:14] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 0 ms to minimize.
[2021-05-17 20:43:14] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 1 ms to minimize.
[2021-05-17 20:43:15] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 0 ms to minimize.
[2021-05-17 20:43:15] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 0 ms to minimize.
[2021-05-17 20:43:15] [INFO ] Deduced a trap composed of 156 places in 165 ms of which 0 ms to minimize.
[2021-05-17 20:43:15] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 2 ms to minimize.
[2021-05-17 20:43:15] [INFO ] Deduced a trap composed of 191 places in 99 ms of which 0 ms to minimize.
[2021-05-17 20:43:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1209 ms
[2021-05-17 20:43:15] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 43 ms.
[2021-05-17 20:43:17] [INFO ] Added : 259 causal constraints over 53 iterations in 1926 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-17 20:43:17] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2021-05-17 20:43:17] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:18] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2021-05-17 20:43:18] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 54 ms.
[2021-05-17 20:43:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:43:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2021-05-17 20:43:18] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:43:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:18] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2021-05-17 20:43:18] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 51 ms.
[2021-05-17 20:43:20] [INFO ] Deduced a trap composed of 130 places in 88 ms of which 0 ms to minimize.
[2021-05-17 20:43:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2021-05-17 20:43:20] [INFO ] Added : 262 causal constraints over 53 iterations in 2068 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-17 20:43:20] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2021-05-17 20:43:20] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:21] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2021-05-17 20:43:21] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 0 ms to minimize.
[2021-05-17 20:43:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2021-05-17 20:43:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:43:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2021-05-17 20:43:21] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:21] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2021-05-17 20:43:21] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 0 ms to minimize.
[2021-05-17 20:43:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2021-05-17 20:43:21] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 41 ms.
[2021-05-17 20:43:22] [INFO ] Added : 114 causal constraints over 24 iterations in 851 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-17 20:43:22] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2021-05-17 20:43:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:43:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:23] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-17 20:43:23] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 1 ms to minimize.
[2021-05-17 20:43:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2021-05-17 20:43:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:43:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2021-05-17 20:43:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:43:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:23] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2021-05-17 20:43:23] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 0 ms to minimize.
[2021-05-17 20:43:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2021-05-17 20:43:23] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 50 ms.
[2021-05-17 20:43:25] [INFO ] Added : 271 causal constraints over 55 iterations in 2000 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-17 20:43:25] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2021-05-17 20:43:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2021-05-17 20:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:26] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2021-05-17 20:43:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:43:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 36 ms returned sat
[2021-05-17 20:43:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:43:26] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2021-05-17 20:43:26] [INFO ] Deduced a trap composed of 138 places in 113 ms of which 0 ms to minimize.
[2021-05-17 20:43:26] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 1 ms to minimize.
[2021-05-17 20:43:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2021-05-17 20:43:27] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 52 ms.
[2021-05-17 20:43:27] [INFO ] Added : 133 causal constraints over 27 iterations in 963 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
FORMULA net-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Incomplete Parikh walk after 38600 steps, including 292 resets, run finished after 166 ms. (steps per millisecond=232 ) properties (out of 8) seen :1 could not realise parikh vector
FORMULA net-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11800 steps, including 111 resets, run finished after 38 ms. (steps per millisecond=310 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16200 steps, including 189 resets, run finished after 45 ms. (steps per millisecond=360 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA net-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 64200 steps, including 463 resets, run finished after 189 ms. (steps per millisecond=339 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 30100 steps, including 237 resets, run finished after 92 ms. (steps per millisecond=327 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 15900 steps, including 148 resets, run finished after 45 ms. (steps per millisecond=353 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA net-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 67600 steps, including 637 resets, run finished after 185 ms. (steps per millisecond=365 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA net-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 17800 steps, including 245 resets, run finished after 42 ms. (steps per millisecond=423 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 16 out of 624 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 699 edges and 624 vertex of which 85 / 624 are part of one of the 20 SCC in 5 ms
Free SCC test removed 65 places
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Graph (complete) has 1202 edges and 559 vertex of which 541 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.13 ms
Discarding 18 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 541 transition count 457
Reduce places removed 269 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 312 rules applied. Total rules applied 583 place count 272 transition count 414
Reduce places removed 16 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 24 rules applied. Total rules applied 607 place count 256 transition count 406
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 616 place count 248 transition count 405
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 616 place count 248 transition count 395
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 636 place count 238 transition count 395
Discarding 83 places :
Symmetric choice reduction at 4 with 83 rule applications. Total rules 719 place count 155 transition count 246
Iterating global reduction 4 with 83 rules applied. Total rules applied 802 place count 155 transition count 246
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 813 place count 144 transition count 224
Iterating global reduction 4 with 11 rules applied. Total rules applied 824 place count 144 transition count 224
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 833 place count 135 transition count 206
Iterating global reduction 4 with 9 rules applied. Total rules applied 842 place count 135 transition count 206
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 854 place count 123 transition count 194
Iterating global reduction 4 with 12 rules applied. Total rules applied 866 place count 123 transition count 194
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 875 place count 123 transition count 185
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 876 place count 122 transition count 183
Iterating global reduction 5 with 1 rules applied. Total rules applied 877 place count 122 transition count 183
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 935 place count 93 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 939 place count 93 transition count 150
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 940 place count 92 transition count 149
Iterating global reduction 6 with 1 rules applied. Total rules applied 941 place count 92 transition count 149
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 961 place count 82 transition count 215
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 970 place count 82 transition count 206
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 975 place count 82 transition count 201
Free-agglomeration rule applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 997 place count 82 transition count 179
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1019 place count 60 transition count 179
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1022 place count 60 transition count 176
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 1031 place count 60 transition count 176
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 1038 place count 60 transition count 176
Applied a total of 1038 rules in 138 ms. Remains 60 /624 variables (removed 564) and now considering 176/828 (removed 652) transitions.
[2021-05-17 20:43:28] [INFO ] Flow matrix only has 159 transitions (discarded 17 similar events)
// Phase 1: matrix 159 rows 60 cols
[2021-05-17 20:43:28] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 20:43:29] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/624 places, 176/828 transitions.
[2021-05-17 20:43:29] [INFO ] Flatten gal took : 51 ms
[2021-05-17 20:43:29] [INFO ] Flatten gal took : 17 ms
[2021-05-17 20:43:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14472470071681001012.gal : 10 ms
[2021-05-17 20:43:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17310541002600808216.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/ReachabilityCardinality14472470071681001012.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17310541002600808216.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/ReachabilityCardinality14472470071681001012.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17310541002600808216.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17310541002600808216.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 177
Invariant property net-ReachabilityFireability-03 does not hold.
FORMULA net-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :177 after 3017
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :3017 after 3961
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :3961 after 7438
Invariant property net-ReachabilityFireability-15 does not hold.
FORMULA net-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :7438 after 11525
Reachability property net-ReachabilityFireability-08 is true.
FORMULA net-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :11525 after 11841
Invariant property net-ReachabilityFireability-05 does not hold.
FORMULA net-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
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,12257,0.146629,7392,2,1896,17,13588,6,0,442,9464,0
Total reachable state count : 12257

Verifying 4 reachability properties.
Invariant property net-ReachabilityFireability-03 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
net-ReachabilityFireability-03,320,0.185645,7392,2,244,17,13588,7,0,463,9464,0
Invariant property net-ReachabilityFireability-05 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
net-ReachabilityFireability-05,1,0.186315,7656,2,61,17,13588,8,0,465,9464,0
Reachability property net-ReachabilityFireability-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
net-ReachabilityFireability-08,1,0.187321,7656,2,61,17,13588,9,0,473,9464,0
Invariant property net-ReachabilityFireability-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
net-ReachabilityFireability-15,64,0.199541,7656,2,181,17,13588,10,0,487,9464,0
All properties solved without resorting to model-checking.

BK_STOP 1621284210490

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 ReachabilityFireability -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 3600 -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="HealthRecord-PT-17"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is HealthRecord-PT-17, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156400391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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