Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813200023.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is BusinessProcesses-PT-03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813200023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 63K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748546308447

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-29 19:18:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 19:18:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:18:31] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2025-05-29 19:18:31] [INFO ] Transformed 274 places.
[2025-05-29 19:18:31] [INFO ] Transformed 237 transitions.
[2025-05-29 19:18:31] [INFO ] Found NUPN structural information;
[2025-05-29 19:18:31] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 410 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
RANDOM walk for 40000 steps (477 resets) in 1975 ms. (20 steps per ms) remains 10/16 properties
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-29 19:18:32] [INFO ] Flatten gal took : 214 ms
[2025-05-29 19:18:32] [INFO ] Flatten gal took : 110 ms
BEST_FIRST walk for 40003 steps (74 resets) in 1656 ms. (24 steps per ms) remains 10/10 properties
[2025-05-29 19:18:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14999993356915784654.gal : 54 ms
BEST_FIRST walk for 40004 steps (89 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
[2025-05-29 19:18:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17186880613370776551.prop : 24 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14999993356915784654.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17186880613370776551.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17186880613370776551.prop.
BEST_FIRST walk for 40004 steps (79 resets) in 501 ms. (79 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :16 after 29
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :29 after 7940
BEST_FIRST walk for 40003 steps (93 resets) in 619 ms. (64 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :7940 after 1.35597e+09
BEST_FIRST walk for 40003 steps (86 resets) in 355 ms. (112 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (89 resets) in 174 ms. (228 steps per ms) remains 9/10 properties
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (90 resets) in 230 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (89 resets) in 287 ms. (138 steps per ms) remains 6/9 properties
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 236 rows 273 cols
[2025-05-29 19:18:33] [INFO ] Computed 43 invariants in 26 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BusinessProcesses-PT-03-ReachabilityFireability-2025-08 is UNSAT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-03-ReachabilityFireability-2025-15 is UNSAT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 108/260 variables, 31/185 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 108/293 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 2/295 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/295 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem BusinessProcesses-PT-03-ReachabilityFireability-2025-05 is UNSAT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 13/273 variables, 8/303 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 13/316 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/316 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem BusinessProcesses-PT-03-ReachabilityFireability-2025-12 is UNSAT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 236/509 variables, 273/589 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 0/589 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/509 variables, 0/589 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 589 constraints, problems are : Problem set: 4 solved, 2 unsolved in 2064 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 192/249 variables, 31/88 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 192/280 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:36] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:36] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:36] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:36] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:36] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:36] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:37] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:37] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:37] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:37] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:37] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:38] [INFO ] Deduced a trap composed of 59 places in 185 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:38] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:38] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:38] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:38] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:38] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:39] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:39] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:39] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 20/300 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:39] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:39] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:39] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:40] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:40] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:40] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:40] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 31 ms to minimize.
SMT process timed out in 7250ms, After SMT, problems are : Problem set: 4 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 57 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 236/236 transitions.
Graph (complete) has 522 edges and 273 vertex of which 270 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 270 transition count 210
Reduce places removed 25 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 33 rules applied. Total rules applied 59 place count 245 transition count 202
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 67 place count 237 transition count 202
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 67 place count 237 transition count 174
Deduced a syphon composed of 28 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 125 place count 207 transition count 174
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 154 place count 178 transition count 145
Iterating global reduction 3 with 29 rules applied. Total rules applied 183 place count 178 transition count 145
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 185 place count 178 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 186 place count 177 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 186 place count 177 transition count 142
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 176 transition count 142
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 254 place count 143 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 255 place count 142 transition count 108
Applied a total of 255 rules in 152 ms. Remains 142 /273 variables (removed 131) and now considering 108/236 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 142/273 places, 108/236 transitions.
RANDOM walk for 40000 steps (875 resets) in 555 ms. (71 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (145 resets) in 300 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (175 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1049212 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :0 out of 2
Probabilistic random walk after 1049212 steps, saw 141332 distinct states, run finished after 3009 ms. (steps per millisecond=348 ) properties seen :0
// Phase 1: matrix 108 rows 142 cols
[2025-05-29 19:18:44] [INFO ] Computed 39 invariants in 8 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/137 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/245 variables, 137/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/250 variables, 5/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/250 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/137 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:44] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:44] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:44] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:44] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:44] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 108/245 variables, 137/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:44] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:45] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 4 ms to minimize.
Problem BusinessProcesses-PT-03-ReachabilityFireability-2025-00 is UNSAT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:18:45] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 2/184 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem BusinessProcesses-PT-03-ReachabilityFireability-2025-07 is UNSAT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 250/250 variables, and 189 constraints, problems are : Problem set: 2 solved, 0 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1097ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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 14517 ms.

BK_STOP 1748546325254

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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-03"
export BK_EXAMINATION="ReachabilityFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-03, 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 r030-smll-174853813200023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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