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-165251936100144.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-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100144
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.2K Apr 29 23:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 23:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 23:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 23:49 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.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 23:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 29 23:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 29 23:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 29 23:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 91K 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-08-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655083081099

Running Version 0
[2022-06-13 01:18:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-13 01:18:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:18:02] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2022-06-13 01:18:02] [INFO ] Transformed 393 places.
[2022-06-13 01:18:03] [INFO ] Transformed 344 transitions.
[2022-06-13 01:18:03] [INFO ] Found NUPN structural information;
[2022-06-13 01:18:03] [INFO ] Parsed PT model containing 393 places and 344 transitions in 122 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 13 places in 8 ms
Reduce places removed 13 places and 13 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :10
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 331 rows 380 cols
[2022-06-13 01:18:03] [INFO ] Computed 58 place invariants in 28 ms
[2022-06-13 01:18:03] [INFO ] [Real]Absence check using 44 positive place invariants in 26 ms returned sat
[2022-06-13 01:18:03] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2022-06-13 01:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:03] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2022-06-13 01:18:04] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 6 ms to minimize.
[2022-06-13 01:18:04] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:18:04] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2022-06-13 01:18:04] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2022-06-13 01:18:04] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2022-06-13 01:18:04] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2022-06-13 01:18:04] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2022-06-13 01:18:04] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:18:04] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:18:04] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-06-13 01:18:04] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2022-06-13 01:18:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1161 ms
[2022-06-13 01:18:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:05] [INFO ] [Nat]Absence check using 44 positive place invariants in 37 ms returned sat
[2022-06-13 01:18:05] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2022-06-13 01:18:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:05] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2022-06-13 01:18:05] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:18:05] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:18:05] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:18:05] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:18:05] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2022-06-13 01:18:05] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 1 ms to minimize.
[2022-06-13 01:18:06] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:18:06] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:18:06] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:18:06] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2022-06-13 01:18:06] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:18:06] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2022-06-13 01:18:06] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 0 ms to minimize.
[2022-06-13 01:18:06] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:18:06] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 1 ms to minimize.
[2022-06-13 01:18:06] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 1 ms to minimize.
[2022-06-13 01:18:06] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:18:07] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:18:07] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2022-06-13 01:18:07] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:18:07] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:18:07] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:18:07] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:18:07] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 1 ms to minimize.
[2022-06-13 01:18:07] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:18:07] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:18:07] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:18:07] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:18:08] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 1 ms to minimize.
[2022-06-13 01:18:08] [INFO ] Deduced a trap composed of 96 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:18:08] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:18:08] [INFO ] Deduced a trap composed of 97 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:18:08] [INFO ] Deduced a trap composed of 100 places in 60 ms of which 0 ms to minimize.
[2022-06-13 01:18:08] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:18:08] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 1 ms to minimize.
[2022-06-13 01:18:08] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 1 ms to minimize.
[2022-06-13 01:18:08] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:18:08] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:18:08] [INFO ] Deduced a trap composed of 94 places in 72 ms of which 0 ms to minimize.
[2022-06-13 01:18:08] [INFO ] Deduced a trap composed of 94 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:18:09] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:18:09] [INFO ] Deduced a trap composed of 91 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:18:09] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:18:09] [INFO ] Deduced a trap composed of 95 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:18:09] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 0 ms to minimize.
[2022-06-13 01:18:09] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 8 ms to minimize.
[2022-06-13 01:18:09] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:18:09] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:18:09] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:18:09] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:18:09] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:18:10] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:18:10] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:18:10] [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 0
[2022-06-13 01:18:10] [INFO ] [Real]Absence check using 44 positive place invariants in 22 ms returned sat
[2022-06-13 01:18:10] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2022-06-13 01:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:10] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2022-06-13 01:18:10] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:18:10] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2022-06-13 01:18:10] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2022-06-13 01:18:10] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2022-06-13 01:18:10] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2022-06-13 01:18:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 262 ms
[2022-06-13 01:18:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:10] [INFO ] [Nat]Absence check using 44 positive place invariants in 16 ms returned sat
[2022-06-13 01:18:10] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2022-06-13 01:18:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:10] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2022-06-13 01:18:10] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2022-06-13 01:18:10] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2022-06-13 01:18:10] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2022-06-13 01:18:11] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2022-06-13 01:18:11] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2022-06-13 01:18:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 291 ms
[2022-06-13 01:18:11] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 24 ms.
[2022-06-13 01:18:12] [INFO ] Added : 174 causal constraints over 35 iterations in 885 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-13 01:18:12] [INFO ] [Real]Absence check using 44 positive place invariants in 28 ms returned sat
[2022-06-13 01:18:12] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2022-06-13 01:18:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:12] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-06-13 01:18:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:12] [INFO ] [Nat]Absence check using 44 positive place invariants in 22 ms returned sat
[2022-06-13 01:18:12] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2022-06-13 01:18:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:12] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2022-06-13 01:18:12] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:18:13] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:18:13] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:18:13] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2022-06-13 01:18:13] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:18:13] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:18:13] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:18:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 629 ms
[2022-06-13 01:18:13] [INFO ] [Real]Absence check using 44 positive place invariants in 14 ms returned sat
[2022-06-13 01:18:13] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 16 ms returned unsat
[2022-06-13 01:18:13] [INFO ] [Real]Absence check using 44 positive place invariants in 18 ms returned sat
[2022-06-13 01:18:13] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 20 ms returned sat
[2022-06-13 01:18:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:13] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-06-13 01:18:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:14] [INFO ] [Nat]Absence check using 44 positive place invariants in 15 ms returned unsat
[2022-06-13 01:18:14] [INFO ] [Real]Absence check using 44 positive place invariants in 21 ms returned sat
[2022-06-13 01:18:14] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 8 ms returned sat
[2022-06-13 01:18:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:18:15] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
[2022-06-13 01:18:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:18:15] [INFO ] [Nat]Absence check using 44 positive place invariants in 11 ms returned unsat
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 18800 steps, including 113 resets, run finished after 45 ms. (steps per millisecond=417 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 35 out of 380 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 380/380 places, 331/331 transitions.
Graph (complete) has 734 edges and 380 vertex of which 371 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 371 transition count 274
Reduce places removed 55 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 64 rules applied. Total rules applied 121 place count 316 transition count 265
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 130 place count 307 transition count 265
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 130 place count 307 transition count 206
Deduced a syphon composed of 59 places in 2 ms
Ensure Unique test removed 7 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 125 rules applied. Total rules applied 255 place count 241 transition count 206
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 313 place count 183 transition count 148
Iterating global reduction 3 with 58 rules applied. Total rules applied 371 place count 183 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 373 place count 183 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 374 place count 182 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 374 place count 182 transition count 144
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 378 place count 180 transition count 144
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 470 place count 134 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 471 place count 133 transition count 97
Applied a total of 471 rules in 93 ms. Remains 133 /380 variables (removed 247) and now considering 97/331 (removed 234) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/380 places, 97/331 transitions.
[2022-06-13 01:18:15] [INFO ] Flatten gal took : 39 ms
[2022-06-13 01:18:15] [INFO ] Flatten gal took : 13 ms
[2022-06-13 01:18:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10582152893655054606.gal : 8 ms
[2022-06-13 01:18:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2745744018110804998.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/ReachabilityCardinality10582152893655054606.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2745744018110804998.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/ReachabilityCardinality10582152893655054606.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2745744018110804998.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2745744018110804998.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :19 after 39
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :39 after 332
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :332 after 2653
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2653 after 3328
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3328 after 5066
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :54540 after 87570
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,353794,0.501063,16504,2,8192,16,39419,7,0,682,46888,0
Total reachable state count : 353794

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-08-ReachabilityFireability-04 is true.
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-04 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-08-ReachabilityFireability-04,72,0.50771,16768,2,345,16,39419,7,0,701,46888,0
All properties solved without resorting to model-checking.

BK_STOP 1655083097164

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-08"
export BK_EXAMINATION="ReachabilityFireability"
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-08, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-tall-165251936100144"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-08.tgz
mv BusinessProcesses-PT-08 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;