Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813696900510.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is BusinessProcesses-PT-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696900510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K Mar 5 18:22 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-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678790815718

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:46:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 10:46:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:46:57] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-14 10:46:57] [INFO ] Transformed 393 places.
[2023-03-14 10:46:57] [INFO ] Transformed 344 transitions.
[2023-03-14 10:46:57] [INFO ] Found NUPN structural information;
[2023-03-14 10:46:57] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 13 places in 14 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 85 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 12) seen :7
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 331 rows 380 cols
[2023-03-14 10:46:58] [INFO ] Computed 58 place invariants in 20 ms
[2023-03-14 10:46:59] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 10:46:59] [INFO ] [Nat]Absence check using 44 positive place invariants in 26 ms returned sat
[2023-03-14 10:46:59] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 16 ms returned sat
[2023-03-14 10:46:59] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 5 ms to minimize.
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 1 ms to minimize.
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 2 ms to minimize.
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 1 ms to minimize.
[2023-03-14 10:47:00] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 0 ms to minimize.
[2023-03-14 10:47:01] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 0 ms to minimize.
[2023-03-14 10:47:01] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2023-03-14 10:47:01] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2023-03-14 10:47:01] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2023-03-14 10:47:01] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 0 ms to minimize.
[2023-03-14 10:47:01] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2023-03-14 10:47:01] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2023-03-14 10:47:01] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 0 ms to minimize.
[2023-03-14 10:47:01] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 0 ms to minimize.
[2023-03-14 10:47:01] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2023-03-14 10:47:01] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2023-03-14 10:47:02] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 1 ms to minimize.
[2023-03-14 10:47:02] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 0 ms to minimize.
[2023-03-14 10:47:02] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2023-03-14 10:47:02] [INFO ] Deduced a trap composed of 61 places in 348 ms of which 27 ms to minimize.
[2023-03-14 10:47:02] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 0 ms to minimize.
[2023-03-14 10:47:03] [INFO ] Deduced a trap composed of 69 places in 395 ms of which 0 ms to minimize.
[2023-03-14 10:47:03] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2023-03-14 10:47:03] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 0 ms to minimize.
[2023-03-14 10:47:03] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 0 ms to minimize.
[2023-03-14 10:47:03] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2023-03-14 10:47:03] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3503 ms
[2023-03-14 10:47:03] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2023-03-14 10:47:03] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-14 10:47:03] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2023-03-14 10:47:03] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2023-03-14 10:47:03] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 0 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 0 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 0 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2023-03-14 10:47:04] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1479 ms
[2023-03-14 10:47:05] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 0 ms to minimize.
[2023-03-14 10:47:05] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 1 ms to minimize.
[2023-03-14 10:47:05] [INFO ] Deduced a trap composed of 91 places in 72 ms of which 0 ms to minimize.
[2023-03-14 10:47:05] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 2 ms to minimize.
[2023-03-14 10:47:05] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 0 ms to minimize.
[2023-03-14 10:47:05] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 0 ms to minimize.
[2023-03-14 10:47:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 582 ms
[2023-03-14 10:47:05] [INFO ] After 6006ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-14 10:47:05] [INFO ] After 6412ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 16 ms.
Support contains 30 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 331/331 transitions.
Graph (trivial) has 199 edges and 380 vertex of which 8 / 380 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 724 edges and 373 vertex of which 364 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 364 transition count 248
Reduce places removed 71 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 78 rules applied. Total rules applied 152 place count 293 transition count 241
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 159 place count 286 transition count 241
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 159 place count 286 transition count 197
Deduced a syphon composed of 44 places in 3 ms
Ensure Unique test removed 9 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 97 rules applied. Total rules applied 256 place count 233 transition count 197
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 310 place count 179 transition count 143
Iterating global reduction 3 with 54 rules applied. Total rules applied 364 place count 179 transition count 143
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 364 place count 179 transition count 139
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 374 place count 173 transition count 139
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 468 place count 126 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 469 place count 125 transition count 91
Applied a total of 469 rules in 107 ms. Remains 125 /380 variables (removed 255) and now considering 91/331 (removed 240) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 125/380 places, 91/331 transitions.
Incomplete random walk after 10000 steps, including 184 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1593520 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :{}
Probabilistic random walk after 1593520 steps, saw 207207 distinct states, run finished after 3002 ms. (steps per millisecond=530 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 91 rows 125 cols
[2023-03-14 10:47:08] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-14 10:47:08] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 10:47:09] [INFO ] [Nat]Absence check using 37 positive place invariants in 4 ms returned sat
[2023-03-14 10:47:09] [INFO ] [Nat]Absence check using 37 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-14 10:47:09] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 10:47:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-14 10:47:09] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2023-03-14 10:47:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 49 ms
[2023-03-14 10:47:09] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 7 ms to minimize.
[2023-03-14 10:47:09] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2023-03-14 10:47:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2023-03-14 10:47:09] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-14 10:47:09] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 125/125 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-14 10:47:09] [INFO ] Invariant cache hit.
[2023-03-14 10:47:09] [INFO ] Implicit Places using invariants in 100 ms returned [9, 31, 32, 33, 116]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 103 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 120/125 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 110 ms. Remains : 120/125 places, 91/91 transitions.
Incomplete random walk after 10000 steps, including 188 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1671529 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :{}
Probabilistic random walk after 1671529 steps, saw 214689 distinct states, run finished after 3001 ms. (steps per millisecond=556 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 91 rows 120 cols
[2023-03-14 10:47:12] [INFO ] Computed 35 place invariants in 7 ms
[2023-03-14 10:47:12] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 10:47:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-14 10:47:12] [INFO ] [Nat]Absence check using 34 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-14 10:47:12] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 10:47:12] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2023-03-14 10:47:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-14 10:47:12] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-14 10:47:12] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 91/91 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 120/120 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-14 10:47:12] [INFO ] Invariant cache hit.
[2023-03-14 10:47:12] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-14 10:47:12] [INFO ] Invariant cache hit.
[2023-03-14 10:47:13] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [30, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 291 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 118/120 places, 91/91 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 118 transition count 91
Applied a total of 1 rules in 18 ms. Remains 118 /118 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 118 cols
[2023-03-14 10:47:13] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-14 10:47:13] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-14 10:47:13] [INFO ] Invariant cache hit.
[2023-03-14 10:47:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 10:47:13] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 118/120 places, 91/91 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 504 ms. Remains : 118/120 places, 91/91 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1637459 steps, run timeout after 3001 ms. (steps per millisecond=545 ) properties seen :{}
Probabilistic random walk after 1637459 steps, saw 211746 distinct states, run finished after 3001 ms. (steps per millisecond=545 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 10:47:16] [INFO ] Invariant cache hit.
[2023-03-14 10:47:16] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 10:47:16] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-14 10:47:16] [INFO ] [Nat]Absence check using 32 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 10:47:16] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 10:47:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 10:47:16] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 10:47:16] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2023-03-14 10:47:16] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2023-03-14 10:47:16] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 6 ms to minimize.
[2023-03-14 10:47:16] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2023-03-14 10:47:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 156 ms
[2023-03-14 10:47:16] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
[2023-03-14 10:47:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-14 10:47:16] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-14 10:47:16] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 91/91 transitions.
Graph (complete) has 304 edges and 118 vertex of which 116 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 116 transition count 82
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 109 transition count 82
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 15 place count 109 transition count 73
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 33 place count 100 transition count 73
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 96 transition count 69
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 96 transition count 69
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 78 place count 77 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 75 transition count 49
Applied a total of 80 rules in 18 ms. Remains 75 /118 variables (removed 43) and now considering 49/91 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 75/118 places, 49/91 transitions.
Incomplete random walk after 10000 steps, including 445 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 223 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Probably explored full state space saw : 116 states, properties seen :0
Probabilistic random walk after 319 steps, saw 116 distinct states, run finished after 6 ms. (steps per millisecond=53 ) properties seen :0
Explored full state space saw : 116 states, properties seen :0
Exhaustive walk after 319 steps, saw 116 distinct states, run finished after 2 ms. (steps per millisecond=159 ) properties seen :0
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 19258 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 08
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 393 places, 344 transitions, 911 arcs.
Final Score: 10960.926
Took : 10 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-00 (reachable &!potential( ( (tk(P233)) <= (tk(P327)) )))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-01 (reachable &!potential( (! ( ( ( 1 ) <= (tk(P95)) ) & ( ( 1 ) <= (tk(P284)) ) ))))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-02 (reachable &!potential( ( (tk(P127)) <= ( 1 ) )))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-03 (reachable & potential(( (! ( ( ( 1 ) <= (tk(P142)) ) | ( (tk(P124)) <= (tk(P66)) ) )) | ( ( 1 ) <= (tk(P253)) ) )))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-04 (reachable &!potential( ( (tk(P58)) <= (tk(P179)) )))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-05 (reachable & potential((! ( (! ( (! ( ( 1 ) <= (tk(P252)) )) | (! ( (! ( ( (tk(P291)) <= (tk(P285)) ) & ( ( 1 ) <= (tk(P245)) ) )) | (! ( ( (tk(P164)) <= ( 1 ) ) & ( (tk(P8)) <= (tk(P184)) ) )) )) )) | ( ( ( ( ( 1 ) <= (tk(P338)) ) & ( (tk(P393)) <= ( 1 ) ) ) & ( ( ( ( 1 ) <= (tk(P131)) ) & ( ( ( ( (tk(P15)) <= (tk(P286)) ) & ( (tk(P90)) <= ( 1 ) ) ) & ( ( (tk(P308)) <= (tk(P206)) ) & ( (tk(P13)) <= ( 0 ) ) ) ) & ( (tk(P99)) <= (tk(P374)) ) ) ) & (! ( ( ( ( (tk(P236)) <= (tk(P104)) ) | ( (tk(P392)) <= ( 0 ) ) ) & ( (tk(P161)) <= (tk(P224)) ) ) & ( (! ( ( 1 ) <= (tk(P59)) )) & (! ( ( 1 ) <= (tk(P392)) )) ) )) ) ) | ( ( (tk(P88)) <= ( 1 ) ) | (! ( ( (tk(P239)) <= ( 0 ) ) | ( (! ( ( 1 ) <= (tk(P129)) )) & ( ( 1 ) <= (tk(P224)) ) ) )) ) ) ))))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-06 (reachable &!potential( ( ( (tk(P393)) <= (tk(P180)) ) | ( (! ( ( ( 1 ) <= (tk(P240)) ) & (! ( ( ( (tk(P388)) <= (tk(P228)) ) & (! ( ( (tk(P74)) <= (tk(P295)) ) | ( (tk(P318)) <= ( 0 ) ) )) ) | (! ( (! ( (tk(P108)) <= (tk(P127)) )) & ( ( 1 ) <= (tk(P373)) ) )) )) )) | (! ( ( ( ( (tk(P137)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P388)) ) | ( (tk(P294)) <= (tk(P353)) ) ) ) | ( ( ( (! ( (tk(P156)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P109)) ) ) & ( (tk(P278)) <= ( 1 ) ) ) | (! ( ( 1 ) <= (tk(P225)) )) ) ) & ( ( (! ( (tk(P106)) <= ( 0 ) )) & (! ( ( 1 ) <= (tk(P29)) )) ) & ( ( 1 ) <= (tk(P200)) ) ) )) ) )))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-07 (reachable &!potential( ( ( ( ( ( (! ( (! ( (tk(P199)) <= (tk(P126)) )) | ( ( ( 1 ) <= (tk(P262)) ) | ( (tk(P232)) <= ( 0 ) ) ) )) | ( (tk(P297)) <= ( 0 ) ) ) | (! ( ( ( (tk(P154)) <= (tk(P127)) ) | (! ( ( (tk(P130)) <= (tk(P318)) ) | ( (tk(P319)) <= (tk(P117)) ) )) ) | (! ( ( ( 1 ) <= (tk(P126)) ) | ( ( ( 1 ) <= (tk(P96)) ) | ( (tk(P313)) <= (tk(P160)) ) ) )) )) ) & ( ( 1 ) <= (tk(P85)) ) ) | ( (tk(P324)) <= (tk(P117)) ) ) | ( ( 1 ) <= (tk(P35)) ) )))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-08 (reachable &!potential( ( ( (tk(P97)) <= (tk(P315)) ) | ( ( 1 ) <= (tk(P220)) ) )))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-09 (reachable &!potential( ( ( ( ( 1 ) <= (tk(P225)) ) | ( (! ( ( (tk(P234)) <= ( 0 ) ) & (! ( (! ( (tk(P60)) <= (tk(P105)) )) | ( ( (tk(P223)) <= ( 1 ) ) | ( (tk(P92)) <= ( 0 ) ) ) )) )) & ( ( ( (! ( ( 1 ) <= (tk(P324)) )) | ( (tk(P208)) <= ( 1 ) ) ) & ( (tk(P83)) <= (tk(P53)) ) ) | ( (tk(P190)) <= (tk(P71)) ) ) ) ) | ( ( (! ( ( ( (tk(P273)) <= ( 0 ) ) & ( ( ( ( 1 ) <= (tk(P388)) ) & ( (tk(P214)) <= ( 1 ) ) ) | ( ( (tk(P173)) <= (tk(P12)) ) | ( (tk(P268)) <= ( 0 ) ) ) ) ) & ( ( ( ( ( 1 ) <= (tk(P98)) ) & ( (tk(P17)) <= ( 1 ) ) ) | (! ( ( 1 ) <= (tk(P79)) )) ) | (! ( ( (tk(P68)) <= (tk(P235)) ) | ( (tk(P21)) <= (tk(P324)) ) )) ) )) | ( ( ( ( 1 ) <= (tk(P330)) ) | ( (! ( ( ( 1 ) <= (tk(P289)) ) | ( (tk(P233)) <= (tk(P151)) ) )) | ( (tk(P217)) <= ( 0 ) ) ) ) | ( ( ( 1 ) <= (tk(P286)) ) | (! ( (tk(P231)) <= ( 1 ) )) ) ) ) | ( (! ( ( (! ( ( 1 ) <= (tk(P263)) )) & ( (tk(P10)) <= ( 1 ) ) ) & (! ( ( ( ( 1 ) <= (tk(P360)) ) & ( ( 1 ) <= (tk(P375)) ) ) & ( ( 1 ) <= (tk(P157)) ) )) )) | ( ( ( 1 ) <= (tk(P141)) ) | ( (tk(P211)) <= ( 0 ) ) ) ) ) )))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-10 (reachable & potential(( ( ( ( ( (! ( ( ( ( (tk(P161)) <= (tk(P236)) ) | ( (tk(P218)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P29)) ) | ( ( 1 ) <= (tk(P185)) ) ) ) & ( (! ( (tk(P290)) <= (tk(P301)) )) & ( ( (tk(P280)) <= ( 1 ) ) | ( (tk(P223)) <= (tk(P297)) ) ) ) )) & ( (tk(P247)) <= (tk(P290)) ) ) & ( ( ( ( ( ( (tk(P107)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P349)) ) ) & ( ( ( 1 ) <= (tk(P272)) ) | ( ( 1 ) <= (tk(P131)) ) ) ) & ( ( ( (tk(P321)) <= ( 0 ) ) | ( (tk(P150)) <= ( 1 ) ) ) | ( (tk(P384)) <= (tk(P390)) ) ) ) & ( ( 1 ) <= (tk(P9)) ) ) | ( ( ( (! ( (tk(P344)) <= ( 0 ) )) | ( ( (tk(P29)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P199)) ) ) ) | (! ( ( (tk(P15)) <= (tk(P121)) ) | ( (tk(P106)) <= (tk(P159)) ) )) ) & ( (tk(P237)) <= ( 1 ) ) ) ) ) & ( (tk(P134)) <= ( 0 ) ) ) & (! ( (! ( ( ( ( (tk(P175)) <= (tk(P385)) ) | ( ( 1 ) <= (tk(P308)) ) ) & (! ( (tk(P264)) <= (tk(P83)) )) ) & ( ( ( ( 1 ) <= (tk(P29)) ) | ( (tk(P230)) <= (tk(P291)) ) ) & (! ( (tk(P22)) <= (tk(P242)) )) ) )) | ( ( (! ( ( (tk(P292)) <= (tk(P217)) ) & ( (tk(P247)) <= (tk(P104)) ) )) & ( (! ( ( 1 ) <= (tk(P375)) )) & ( ( (tk(P26)) <= (tk(P358)) ) & ( (tk(P241)) <= (tk(P188)) ) ) ) ) | (! ( ( (tk(P5)) <= ( 1 ) ) | ( (tk(P321)) <= ( 0 ) ) )) ) )) ) & (! ( (tk(P255)) <= ( 1 ) )) )))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-11 (reachable &!potential( ( (tk(P71)) <= ( 0 ) )))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-12 (reachable &!potential( ( (tk(P229)) <= (tk(P344)) )))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-13 (reachable & potential(( ( ( (tk(P170)) <= ( 0 ) ) & ( (tk(P189)) <= (tk(P367)) ) ) & (! ( ( ( ( ( (! ( ( (tk(P202)) <= ( 1 ) ) & ( (tk(P85)) <= ( 1 ) ) )) & ( (tk(P298)) <= (tk(P355)) ) ) & ( ( 1 ) <= (tk(P58)) ) ) & (! ( (tk(P219)) <= (tk(P384)) )) ) | ( ( (tk(P158)) <= ( 0 ) ) | ( (! ( ( 1 ) <= (tk(P26)) )) & ( (! ( ( (tk(P103)) <= (tk(P149)) ) | ( (tk(P348)) <= (tk(P195)) ) )) | (! ( ( (tk(P312)) <= (tk(P210)) ) | ( (tk(P289)) <= ( 0 ) ) )) ) ) ) ) & (! ( ( (! ( (! ( (tk(P289)) <= ( 1 ) )) & (! ( ( 1 ) <= (tk(P48)) )) )) & (! ( (! ( ( 1 ) <= (tk(P282)) )) | ( ( ( 1 ) <= (tk(P275)) ) & ( (tk(P371)) <= ( 0 ) ) ) )) ) | ( ( ( 1 ) <= (tk(P232)) ) & ( ( ( ( ( 1 ) <= (tk(P199)) ) & ( (tk(P281)) <= ( 0 ) ) ) & ( (tk(P39)) <= (tk(P131)) ) ) & ( ( ( 1 ) <= (tk(P212)) ) | ( ( 1 ) <= (tk(P80)) ) ) ) ) )) )) )))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-14 (reachable &!potential( ( ( ( (! ( ( (tk(P85)) <= ( 0 ) ) | (! ( (tk(P56)) <= ( 0 ) )) )) | ( ( ( (! ( ( ( (tk(P177)) <= (tk(P187)) ) | ( (tk(P311)) <= ( 0 ) ) ) & (! ( ( 1 ) <= (tk(P289)) )) )) & (! ( ( ( 1 ) <= (tk(P3)) ) | (! ( ( 1 ) <= (tk(P9)) )) )) ) & ( (! ( (! ( (tk(P277)) <= ( 0 ) )) | (! ( ( 1 ) <= (tk(P102)) )) )) | ( ( ( ( 1 ) <= (tk(P315)) ) & ( ( ( 1 ) <= (tk(P318)) ) & ( (tk(P123)) <= (tk(P230)) ) ) ) & (! ( (tk(P89)) <= ( 0 ) )) ) ) ) & ( (tk(P261)) <= (tk(P109)) ) ) ) & ( ( 1 ) <= (tk(P167)) ) ) | ( ( (tk(P138)) <= ( 0 ) ) & ( (tk(P296)) <= (tk(P274)) ) ) )))
PROPERTY: BusinessProcesses-PT-08-ReachabilityCardinality-15 (reachable &!potential( ( ( ( ( ( 1 ) <= (tk(P140)) ) | ( ( ( ( 1 ) <= (tk(P378)) ) | ( (tk(P350)) <= ( 0 ) ) ) | ( (! ( ( ( (tk(P222)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P5)) ) ) | ( ( ( (tk(P120)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P111)) ) ) | (! ( ( 1 ) <= (tk(P327)) )) ) )) & ( ( 1 ) <= (tk(P229)) ) ) ) ) | ( ( ( (! ( ( 1 ) <= (tk(P336)) )) | ( (! ( ( ( 1 ) <= (tk(P343)) ) | ( ( ( 1 ) <= (tk(P204)) ) | ( (tk(P312)) <= (tk(P86)) ) ) )) & ( ( (tk(P149)) <= (tk(P144)) ) | ( (! ( ( 1 ) <= (tk(P299)) )) & ( ( (tk(P277)) <= (tk(P280)) ) | ( ( 1 ) <= (tk(P257)) ) ) ) ) ) ) | ( ( (! ( ( 1 ) <= (tk(P295)) )) | ( (tk(P167)) <= (tk(P389)) ) ) & ( ( ( ( ( 1 ) <= (tk(P282)) ) | ( ( 1 ) <= (tk(P177)) ) ) & (! ( ( (tk(P36)) <= (tk(P266)) ) | ( (tk(P56)) <= (tk(P110)) ) )) ) & ( (tk(P201)) <= ( 0 ) ) ) ) ) | ( (tk(P319)) <= (tk(P379)) ) ) ) | (! ( ( 1 ) <= (tk(P72)) )) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 12451020 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16105140 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="ReachabilityCardinality"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is BusinessProcesses-PT-08, 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 r043-tajo-167813696900510"
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 [ "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 ;