Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 100K May 18 16:42 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-07-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716334208800

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 23:30:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:30:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:30:10] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-21 23:30:10] [INFO ] Transformed 386 places.
[2024-05-21 23:30:10] [INFO ] Transformed 360 transitions.
[2024-05-21 23:30:10] [INFO ] Found NUPN structural information;
[2024-05-21 23:30:10] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (437 resets) in 1932 ms. (20 steps per ms) remains 3/10 properties
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:30:11] [INFO ] Flatten gal took : 175 ms
[2024-05-21 23:30:11] [INFO ] Flatten gal took : 95 ms
[2024-05-21 23:30:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11795200965885196340.gal : 21 ms
[2024-05-21 23:30:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3426583437444393996.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11795200965885196340.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3426583437444393996.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (78 resets) in 1002 ms. (39 steps per ms) remains 3/3 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3426583437444393996.prop.
BEST_FIRST walk for 40004 steps (80 resets) in 379 ms. (105 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (91 resets) in 323 ms. (123 steps per ms) remains 3/3 properties
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :7 after 11
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :11 after 81
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :81 after 289
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :289 after 381
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :381 after 3545
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3545 after 5064
// Phase 1: matrix 360 rows 386 cols
[2024-05-21 23:30:11] [INFO ] Computed 62 invariants in 27 ms
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :5064 after 2.65586e+07
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.65586e+07 after 4.07074e+09
At refinement iteration 2 (OVERLAPS) 242/303 variables, 33/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 242/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BusinessProcesses-PT-07-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-07-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 80/383 variables, 26/362 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 80/442 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/442 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/386 variables, 3/445 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 3/448 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/448 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 360/746 variables, 386/834 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/746 variables, 0/834 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/746 variables, 0/834 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 834 constraints, problems are : Problem set: 2 solved, 1 unsolved in 485 ms.
Refiners :[Domain max(s): 386/386 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 386/386 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 275/291 variables, 33/49 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 275/324 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 10 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 9/333 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/333 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/383 variables, 26/359 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 92/451 constraints. Problems are: Problem set: 2 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4.07074e+09 after 4.07388e+09
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 112 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 111 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 115 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 3 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :4.07388e+09 after 4.11846e+09
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 20/471 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 109 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 106 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 103 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 102 places in 83 ms of which 5 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 102 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 100 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 107 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 111 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 108 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 110 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 114 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/746 variables, and 486 constraints, problems are : Problem set: 2 solved, 1 unsolved in 5018 ms.
Refiners :[Domain max(s): 383/386 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/386 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 44/44 constraints]
After SMT, in 5621ms problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 203 edges and 386 vertex of which 4 / 386 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 809 edges and 383 vertex of which 381 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 381 transition count 280
Reduce places removed 75 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 78 rules applied. Total rules applied 155 place count 306 transition count 277
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 158 place count 303 transition count 277
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 158 place count 303 transition count 223
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 272 place count 243 transition count 223
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 316 place count 199 transition count 179
Iterating global reduction 3 with 44 rules applied. Total rules applied 360 place count 199 transition count 179
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 360 place count 199 transition count 173
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 373 place count 192 transition count 173
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 471 place count 143 transition count 124
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 473 place count 142 transition count 127
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 476 place count 142 transition count 124
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 479 place count 139 transition count 124
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 480 place count 139 transition count 124
Applied a total of 480 rules in 110 ms. Remains 139 /386 variables (removed 247) and now considering 124/360 (removed 236) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 139/386 places, 124/360 transitions.
RANDOM walk for 13517 steps (3 resets) in 91 ms. (146 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 7437 ms.

BK_STOP 1716334217530

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-07"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-07, 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 r048-tajo-171620399600502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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