fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r026-tajo-162038143900446
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BusinessProcesses-PT-16

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
309.611 51178.00 81062.00 193.90 TTTTFTFFFFFFFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143900446.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BusinessProcesses-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900446
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 159K 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

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

=== Now, execution of the tool begins

BK_START 1620547727634

Running Version 0
[2021-05-09 08:08:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-09 08:08:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:08:50] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2021-05-09 08:08:50] [INFO ] Transformed 638 places.
[2021-05-09 08:08:50] [INFO ] Transformed 578 transitions.
[2021-05-09 08:08:50] [INFO ] Found NUPN structural information;
[2021-05-09 08:08:50] [INFO ] Parsed PT model containing 638 places and 578 transitions in 189 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 15 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 66 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :2
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 570 rows 630 cols
[2021-05-09 08:08:50] [INFO ] Computed 100 place invariants in 41 ms
[2021-05-09 08:08:51] [INFO ] [Real]Absence check using 62 positive place invariants in 28 ms returned sat
[2021-05-09 08:08:51] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-09 08:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:08:51] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2021-05-09 08:08:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:08:51] [INFO ] [Real]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:08:51] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-09 08:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:08:52] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2021-05-09 08:08:52] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 3 ms to minimize.
[2021-05-09 08:08:58] [INFO ] Deduced a trap composed of 14 places in 6584 ms of which 2 ms to minimize.
[2021-05-09 08:08:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-09 08:08:59] [INFO ] [Real]Absence check using 62 positive place invariants in 272 ms returned sat
[2021-05-09 08:08:59] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 17 ms returned sat
[2021-05-09 08:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:09:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 2
[2021-05-09 08:09:04] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2021-05-09 08:09:04] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2021-05-09 08:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:09:04] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2021-05-09 08:09:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:09:04] [INFO ] [Nat]Absence check using 62 positive place invariants in 25 ms returned sat
[2021-05-09 08:09:04] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 16 ms returned sat
[2021-05-09 08:09:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:09:04] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2021-05-09 08:09:05] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 14 ms to minimize.
[2021-05-09 08:09:05] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 2 ms to minimize.
[2021-05-09 08:09:05] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 1 ms to minimize.
[2021-05-09 08:09:06] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
[2021-05-09 08:09:06] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 13 ms to minimize.
[2021-05-09 08:09:06] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 0 ms to minimize.
[2021-05-09 08:09:06] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 0 ms to minimize.
[2021-05-09 08:09:06] [INFO ] Deduced a trap composed of 146 places in 289 ms of which 1 ms to minimize.
[2021-05-09 08:09:07] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:09:07] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:09:07] [INFO ] Deduced a trap composed of 14 places in 555 ms of which 1 ms to minimize.
[2021-05-09 08:09:08] [INFO ] Deduced a trap composed of 152 places in 420 ms of which 1 ms to minimize.
[2021-05-09 08:09:08] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 1 ms to minimize.
[2021-05-09 08:09:08] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 0 ms to minimize.
[2021-05-09 08:09:09] [INFO ] Deduced a trap composed of 41 places in 305 ms of which 1 ms to minimize.
[2021-05-09 08:09:09] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 2 ms to minimize.
[2021-05-09 08:09:09] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 1 ms to minimize.
[2021-05-09 08:09:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-09 08:09:09] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2021-05-09 08:09:09] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 08:09:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:09:10] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2021-05-09 08:09:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:09:10] [INFO ] [Nat]Absence check using 62 positive place invariants in 39 ms returned sat
[2021-05-09 08:09:10] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 20 ms returned sat
[2021-05-09 08:09:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:09:10] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2021-05-09 08:09:10] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 1 ms to minimize.
[2021-05-09 08:09:11] [INFO ] Deduced a trap composed of 133 places in 196 ms of which 1 ms to minimize.
[2021-05-09 08:09:11] [INFO ] Deduced a trap composed of 126 places in 218 ms of which 2 ms to minimize.
[2021-05-09 08:09:11] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:09:11] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:09:11] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 1 ms to minimize.
[2021-05-09 08:09:12] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:09:12] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:09:12] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:09:12] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 1 ms to minimize.
[2021-05-09 08:09:12] [INFO ] Deduced a trap composed of 125 places in 174 ms of which 1 ms to minimize.
[2021-05-09 08:09:12] [INFO ] Deduced a trap composed of 149 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:09:13] [INFO ] Deduced a trap composed of 128 places in 177 ms of which 1 ms to minimize.
[2021-05-09 08:09:13] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:09:13] [INFO ] Deduced a trap composed of 133 places in 173 ms of which 1 ms to minimize.
[2021-05-09 08:09:13] [INFO ] Deduced a trap composed of 134 places in 149 ms of which 7 ms to minimize.
[2021-05-09 08:09:14] [INFO ] Deduced a trap composed of 124 places in 179 ms of which 0 ms to minimize.
[2021-05-09 08:09:14] [INFO ] Deduced a trap composed of 140 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:09:14] [INFO ] Deduced a trap composed of 127 places in 143 ms of which 1 ms to minimize.
[2021-05-09 08:09:14] [INFO ] Deduced a trap composed of 122 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:09:14] [INFO ] Deduced a trap composed of 131 places in 176 ms of which 1 ms to minimize.
[2021-05-09 08:09:14] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:09:15] [INFO ] Deduced a trap composed of 135 places in 176 ms of which 1 ms to minimize.
[2021-05-09 08:09:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-09 08:09:15] [INFO ] [Real]Absence check using 62 positive place invariants in 23 ms returned sat
[2021-05-09 08:09:15] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 29 ms returned sat
[2021-05-09 08:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:09:15] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2021-05-09 08:09:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:09:15] [INFO ] [Nat]Absence check using 62 positive place invariants in 216 ms returned sat
[2021-05-09 08:09:15] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 40 ms returned sat
[2021-05-09 08:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:09:16] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2021-05-09 08:09:16] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:09:16] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:09:16] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:09:16] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2021-05-09 08:09:16] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:09:17] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 1 ms to minimize.
[2021-05-09 08:09:17] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:09:17] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:09:17] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2021-05-09 08:09:17] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2021-05-09 08:09:17] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:09:17] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:09:17] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2021-05-09 08:09:18] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 13 ms to minimize.
[2021-05-09 08:09:18] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2021-05-09 08:09:18] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2021-05-09 08:09:18] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2021-05-09 08:09:18] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2021-05-09 08:09:18] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:09:18] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2021-05-09 08:09:18] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2405 ms
[2021-05-09 08:09:18] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 43 ms.
[2021-05-09 08:09:20] [INFO ] Deduced a trap composed of 8 places in 342 ms of which 1 ms to minimize.
[2021-05-09 08:09:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-09 08:09:21] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2021-05-09 08:09:21] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 16 ms returned sat
[2021-05-09 08:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:09:21] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-09 08:09:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:09:21] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:09:21] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2021-05-09 08:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:09:21] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2021-05-09 08:09:21] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 0 ms to minimize.
[2021-05-09 08:09:22] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:09:22] [INFO ] Deduced a trap composed of 138 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:09:22] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2021-05-09 08:09:22] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 2 ms to minimize.
[2021-05-09 08:09:22] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 8 ms to minimize.
[2021-05-09 08:09:23] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 14 ms to minimize.
[2021-05-09 08:09:23] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 0 ms to minimize.
[2021-05-09 08:09:23] [INFO ] Deduced a trap composed of 149 places in 157 ms of which 1 ms to minimize.
[2021-05-09 08:09:23] [INFO ] Deduced a trap composed of 140 places in 203 ms of which 0 ms to minimize.
[2021-05-09 08:09:23] [INFO ] Deduced a trap composed of 149 places in 213 ms of which 1 ms to minimize.
[2021-05-09 08:09:24] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 0 ms to minimize.
[2021-05-09 08:09:24] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 0 ms to minimize.
[2021-05-09 08:09:24] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 1 ms to minimize.
[2021-05-09 08:09:24] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 1 ms to minimize.
[2021-05-09 08:09:24] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 1 ms to minimize.
[2021-05-09 08:09:25] [INFO ] Deduced a trap composed of 146 places in 160 ms of which 1 ms to minimize.
[2021-05-09 08:09:25] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 0 ms to minimize.
[2021-05-09 08:09:25] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 1 ms to minimize.
[2021-05-09 08:09:25] [INFO ] Deduced a trap composed of 149 places in 161 ms of which 0 ms to minimize.
[2021-05-09 08:09:25] [INFO ] Deduced a trap composed of 140 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:09:26] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 1 ms to minimize.
[2021-05-09 08:09:26] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 1 ms to minimize.
[2021-05-09 08:09:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-09 08:09:26] [INFO ] [Real]Absence check using 62 positive place invariants in 22 ms returned sat
[2021-05-09 08:09:26] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-09 08:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:09:26] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2021-05-09 08:09:27] [INFO ] Deduced a trap composed of 11 places in 706 ms of which 1 ms to minimize.
[2021-05-09 08:09:27] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 1 ms to minimize.
[2021-05-09 08:09:28] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:09:28] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2021-05-09 08:09:28] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:09:28] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:09:28] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2021-05-09 08:09:28] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:09:29] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:09:29] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 14 ms to minimize.
[2021-05-09 08:09:29] [INFO ] Deduced a trap composed of 145 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:09:29] [INFO ] Deduced a trap composed of 141 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:09:29] [INFO ] Deduced a trap composed of 89 places in 190 ms of which 1 ms to minimize.
[2021-05-09 08:09:30] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 0 ms to minimize.
[2021-05-09 08:09:30] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 1 ms to minimize.
[2021-05-09 08:09:30] [INFO ] Deduced a trap composed of 146 places in 169 ms of which 0 ms to minimize.
[2021-05-09 08:09:30] [INFO ] Deduced a trap composed of 151 places in 185 ms of which 0 ms to minimize.
[2021-05-09 08:09:30] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3862 ms
[2021-05-09 08:09:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:09:30] [INFO ] [Nat]Absence check using 62 positive place invariants in 35 ms returned sat
[2021-05-09 08:09:30] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 19 ms returned sat
[2021-05-09 08:09:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:09:31] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2021-05-09 08:09:31] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2021-05-09 08:09:31] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 0 ms to minimize.
[2021-05-09 08:09:31] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 37 ms to minimize.
[2021-05-09 08:09:32] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 1 ms to minimize.
[2021-05-09 08:09:32] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 1 ms to minimize.
[2021-05-09 08:09:32] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 1 ms to minimize.
[2021-05-09 08:09:32] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 1 ms to minimize.
[2021-05-09 08:09:33] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2021-05-09 08:09:33] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 0 ms to minimize.
[2021-05-09 08:09:33] [INFO ] Deduced a trap composed of 56 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:09:33] [INFO ] Deduced a trap composed of 145 places in 158 ms of which 1 ms to minimize.
[2021-05-09 08:09:33] [INFO ] Deduced a trap composed of 141 places in 167 ms of which 0 ms to minimize.
[2021-05-09 08:09:34] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:09:34] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:09:34] [INFO ] Deduced a trap composed of 144 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:09:34] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:09:34] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3287 ms
[2021-05-09 08:09:34] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 39 ms.
[2021-05-09 08:09:35] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 0 ms to minimize.
[2021-05-09 08:09:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 1 different solutions.
Support contains 17 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 349 edges and 630 vertex of which 7 / 630 are part of one of the 1 SCC in 27 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1283 edges and 624 vertex of which 618 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 137 place count 618 transition count 426
Reduce places removed 135 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 138 rules applied. Total rules applied 275 place count 483 transition count 423
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 278 place count 480 transition count 423
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 278 place count 480 transition count 332
Deduced a syphon composed of 91 places in 5 ms
Ensure Unique test removed 16 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 476 place count 373 transition count 332
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 556 place count 293 transition count 252
Iterating global reduction 3 with 80 rules applied. Total rules applied 636 place count 293 transition count 252
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 636 place count 293 transition count 244
Deduced a syphon composed of 8 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 655 place count 282 transition count 244
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 843 place count 187 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 845 place count 186 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 847 place count 186 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 849 place count 184 transition count 153
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 850 place count 184 transition count 153
Applied a total of 850 rules in 181 ms. Remains 184 /630 variables (removed 446) and now considering 153/570 (removed 417) transitions.
Finished structural reductions, in 1 iterations. Remains : 184/630 places, 153/570 transitions.
[2021-05-09 08:09:36] [INFO ] Flatten gal took : 64 ms
[2021-05-09 08:09:36] [INFO ] Flatten gal took : 17 ms
[2021-05-09 08:09:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5232949711204429008.gal : 39 ms
[2021-05-09 08:09:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1286752045397319828.prop : 1 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/ReachabilityCardinality5232949711204429008.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1286752045397319828.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/ReachabilityCardinality5232949711204429008.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1286752045397319828.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1286752045397319828.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :6 after 35
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :35 after 69
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :69 after 189
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :189 after 685
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :685 after 1025
Invariant property BusinessProcesses-PT-16-ReachabilityCardinality-07 does not hold.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-16-ReachabilityCardinality-06 does not hold.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-16-ReachabilityCardinality-03 is true.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1025 after 3117
Invariant property BusinessProcesses-PT-16-ReachabilityCardinality-14 does not hold.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3117 after 12909
Reachability property BusinessProcesses-PT-16-ReachabilityCardinality-15 is true.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-16-ReachabilityCardinality-13 is true.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :12909 after 33069
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :33069 after 47133
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :47133 after 188973
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :188973 after 344301
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,603309,1.84276,48616,2,16393,23,148637,7,0,896,106461,0
Total reachable state count : 603309

Verifying 7 reachability properties.
Reachability property BusinessProcesses-PT-16-ReachabilityCardinality-03 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
BusinessProcesses-PT-16-ReachabilityCardinality-03,4,1.85387,48880,2,199,23,148637,8,0,902,106461,0
Invariant property BusinessProcesses-PT-16-ReachabilityCardinality-05 is true.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-16-ReachabilityCardinality-05,0,1.88481,48880,1,0,23,148637,8,0,908,106461,0
Invariant property BusinessProcesses-PT-16-ReachabilityCardinality-06 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
BusinessProcesses-PT-16-ReachabilityCardinality-06,24,1.88587,48880,2,284,23,148637,9,0,910,106461,0
Invariant property BusinessProcesses-PT-16-ReachabilityCardinality-07 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
BusinessProcesses-PT-16-ReachabilityCardinality-07,4,1.89261,48880,2,199,23,148637,10,0,915,106461,0
Reachability property BusinessProcesses-PT-16-ReachabilityCardinality-13 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
BusinessProcesses-PT-16-ReachabilityCardinality-13,960,1.89385,48880,2,897,23,148637,11,0,924,106461,0
Invariant property BusinessProcesses-PT-16-ReachabilityCardinality-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
BusinessProcesses-PT-16-ReachabilityCardinality-14,2,1.89616,48880,2,187,23,148637,12,0,929,106461,0
Reachability property BusinessProcesses-PT-16-ReachabilityCardinality-15 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
BusinessProcesses-PT-16-ReachabilityCardinality-15,1,1.89714,48880,2,185,23,148637,13,0,934,106461,0
All properties solved without resorting to model-checking.

BK_STOP 1620547778812

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="BusinessProcesses-PT-16"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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 BusinessProcesses-PT-16, 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 r026-tajo-162038143900446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 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 ;