fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r028-tall-165251936100146
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for BusinessProcesses-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
297.436 23865.00 33765.00 944.80 FFFTTFTTTTFFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r028-tall-165251936100146.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BusinessProcesses-PT-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 5.7K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 30 00:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 00:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 00:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 30 00:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 104K May 10 09:33 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-09-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655083104908

Running Version 0
[2022-06-13 01:18:28] [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]
[2022-06-13 01:18:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:18:28] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2022-06-13 01:18:28] [INFO ] Transformed 403 places.
[2022-06-13 01:18:28] [INFO ] Transformed 374 transitions.
[2022-06-13 01:18:28] [INFO ] Found NUPN structural information;
[2022-06-13 01:18:28] [INFO ] Parsed PT model containing 403 places and 374 transitions in 128 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 108 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :6
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 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 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 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 18 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 374 rows 403 cols
[2022-06-13 01:18:28] [INFO ] Computed 65 place invariants in 36 ms
[2022-06-13 01:18:28] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned sat
[2022-06-13 01:18:28] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2022-06-13 01:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:29] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2022-06-13 01:18:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-06-13 01:18:29] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 8 ms returned sat
[2022-06-13 01:18:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:29] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2022-06-13 01:18:29] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2022-06-13 01:18:29] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2022-06-13 01:18:29] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 28 ms to minimize.
[2022-06-13 01:18:29] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2022-06-13 01:18:29] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2022-06-13 01:18:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 609 ms
[2022-06-13 01:18:30] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 31 ms.
[2022-06-13 01:18:31] [INFO ] Deduced a trap composed of 29 places in 22 ms of which 0 ms to minimize.
[2022-06-13 01:18:31] [INFO ] Deduced a trap composed of 28 places in 21 ms of which 0 ms to minimize.
[2022-06-13 01:18:31] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2022-06-13 01:18:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 190 ms
[2022-06-13 01:18:31] [INFO ] Added : 229 causal constraints over 46 iterations in 1699 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-13 01:18:31] [INFO ] [Real]Absence check using 36 positive place invariants in 30 ms returned sat
[2022-06-13 01:18:31] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 2 ms returned unsat
[2022-06-13 01:18:31] [INFO ] [Real]Absence check using 36 positive place invariants in 24 ms returned sat
[2022-06-13 01:18:31] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 7 ms returned sat
[2022-06-13 01:18:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:32] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-06-13 01:18:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:32] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-13 01:18:32] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2022-06-13 01:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:32] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-06-13 01:18:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:32] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-13 01:18:32] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 8 ms returned sat
[2022-06-13 01:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:32] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2022-06-13 01:18:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:32] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-06-13 01:18:32] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2022-06-13 01:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:32] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2022-06-13 01:18:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:33] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-13 01:18:33] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 11 ms returned sat
[2022-06-13 01:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:33] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-06-13 01:18:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-13 01:18:33] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2022-06-13 01:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:33] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-06-13 01:18:33] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2022-06-13 01:18:33] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2022-06-13 01:18:33] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 6 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 90 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 0 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 96 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:18:34] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 1 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 103 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 94 places in 63 ms of which 1 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 92 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 0 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 102 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 0 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 1 ms to minimize.
[2022-06-13 01:18:35] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2022-06-13 01:18:36] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 4 ms to minimize.
[2022-06-13 01:18:36] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 1 ms to minimize.
[2022-06-13 01:18:36] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 0 ms to minimize.
[2022-06-13 01:18:36] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:18:36] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:18:36] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 1 ms to minimize.
[2022-06-13 01:18:36] [INFO ] Deduced a trap composed of 109 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:18:36] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:18:36] [INFO ] Deduced a trap composed of 103 places in 74 ms of which 2 ms to minimize.
[2022-06-13 01:18:36] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:18:37] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:18:37] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:18:37] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 1 ms to minimize.
[2022-06-13 01:18:37] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 1 ms to minimize.
[2022-06-13 01:18:37] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 0 ms to minimize.
[2022-06-13 01:18:37] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:18:37] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:18:37] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:18:37] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:18:37] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2022-06-13 01:18:37] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:18:38] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 1 ms to minimize.
[2022-06-13 01:18:38] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 8 ms to minimize.
[2022-06-13 01:18:38] [INFO ] Deduced a trap composed of 95 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:18:38] [INFO ] Deduced a trap composed of 98 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:18:38] [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
[2022-06-13 01:18:38] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-13 01:18:38] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2022-06-13 01:18:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:38] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2022-06-13 01:18:38] [INFO ] Solution in real domain found non-integer solution.
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 16300 steps, including 200 resets, run finished after 39 ms. (steps per millisecond=417 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 13 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 374/374 transitions.
Graph (trivial) has 212 edges and 403 vertex of which 7 / 403 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 837 edges and 397 vertex of which 395 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 395 transition count 286
Reduce places removed 79 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 82 rules applied. Total rules applied 163 place count 316 transition count 283
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 166 place count 313 transition count 283
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 166 place count 313 transition count 227
Deduced a syphon composed of 56 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 288 place count 247 transition count 227
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 328 place count 207 transition count 187
Iterating global reduction 3 with 40 rules applied. Total rules applied 368 place count 207 transition count 187
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 368 place count 207 transition count 182
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 379 place count 201 transition count 182
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 503 place count 138 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 505 place count 137 transition count 124
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 507 place count 137 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 509 place count 135 transition count 122
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 510 place count 135 transition count 122
Applied a total of 510 rules in 111 ms. Remains 135 /403 variables (removed 268) and now considering 122/374 (removed 252) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/403 places, 122/374 transitions.
[2022-06-13 01:18:39] [INFO ] Flatten gal took : 52 ms
[2022-06-13 01:18:39] [INFO ] Flatten gal took : 16 ms
[2022-06-13 01:18:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11701366967870561284.gal : 11 ms
[2022-06-13 01:18:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15525828148130614287.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/ReachabilityCardinality11701366967870561284.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15525828148130614287.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/ReachabilityCardinality11701366967870561284.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15525828148130614287.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15525828148130614287.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 30
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :30 after 1346
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1346 after 7898
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7898 after 31862
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31862 after 159518
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :159518 after 753746
Invariant property BusinessProcesses-PT-09-ReachabilityCardinality-10 does not hold.
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-10 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 513 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,3.06776e+06,5.70221,42760,2,7369,14,237918,6,0,662,91504,0
Total reachable state count : 3067756

Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-09-ReachabilityCardinality-10 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-09-ReachabilityCardinality-10,5760,8.5469,42760,2,917,14,237918,7,0,702,91504,0
All properties solved without resorting to model-checking.

BK_STOP 1655083128773

--------------------
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-09"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is BusinessProcesses-PT-09, 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 r028-tall-165251936100146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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