Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813400159.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-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813400159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 195K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K 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.8K 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 192K 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-20-ReachabilityFireability-2025-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748624983652

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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 17:09:45] [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-30 17:09:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 17:09:46] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2025-05-30 17:09:46] [INFO ] Transformed 782 places.
[2025-05-30 17:09:46] [INFO ] Transformed 697 transitions.
[2025-05-30 17:09:46] [INFO ] Found NUPN structural information;
[2025-05-30 17:09:46] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 458 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 22 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (205 resets) in 2614 ms. (15 steps per ms) remains 9/14 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (36 resets) in 498 ms. (80 steps per ms) remains 9/9 properties
[2025-05-30 17:09:47] [INFO ] Flatten gal took : 341 ms
BEST_FIRST walk for 40002 steps (36 resets) in 256 ms. (155 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (35 resets) in 253 ms. (157 steps per ms) remains 8/9 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-05-30 17:09:47] [INFO ] Flatten gal took : 202 ms
BEST_FIRST walk for 40001 steps (24 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (35 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
[2025-05-30 17:09:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5610348139220937097.gal : 102 ms
[2025-05-30 17:09:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5184246470589199354.prop : 7 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/ReachabilityCardinality5610348139220937097.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5184246470589199354.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (30 resets) in 674 ms. (59 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (43 resets) in 365 ms. (109 steps per ms) remains 8/8 properties

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 ...328
BEST_FIRST walk for 40003 steps (37 resets) in 367 ms. (108 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality5184246470589199354.prop.
// Phase 1: matrix 638 rows 719 cols
[2025-05-30 17:09:48] [INFO ] Computed 121 invariants in 66 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :8 after 11
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :11 after 41
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :41 after 81
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :81 after 248
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :248 after 456
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :456 after 604
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :604 after 382835
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :3.61047e+06 after 4.87704e+06
Problem BusinessProcesses-PT-20-ReachabilityFireability-2025-13 is UNSAT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 468/518 variables, 58/108 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 468/576 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/576 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 72/590 variables, 20/596 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 72/668 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 0/668 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem BusinessProcesses-PT-20-ReachabilityFireability-2025-06 is UNSAT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 128/718 variables, 42/710 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.17848e+08 after 1.84874e+08
At refinement iteration 9 (INCLUDED_ONLY) 0/718 variables, 128/838 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/718 variables, 0/838 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/719 variables, 1/839 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/719 variables, 1/840 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :1.84874e+08 after 7.89485e+08
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 0/840 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 638/1357 variables, 719/1559 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1357/1357 variables, and 1559 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5056 ms.
Refiners :[Domain max(s): 719/719 constraints, Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 451/494 variables, 54/97 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/494 variables, 451/548 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:54] [INFO ] Deduced a trap composed of 25 places in 405 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:54] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:54] [INFO ] Deduced a trap composed of 30 places in 263 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:55] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:55] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:55] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:55] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:56] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:56] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:56] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:56] [INFO ] Deduced a trap composed of 51 places in 227 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:57] [INFO ] Deduced a trap composed of 54 places in 262 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:57] [INFO ] Deduced a trap composed of 139 places in 250 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:57] [INFO ] Deduced a trap composed of 139 places in 247 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:58] [INFO ] Deduced a trap composed of 139 places in 240 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:58] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:58] [INFO ] Deduced a trap composed of 139 places in 282 ms of which 51 ms to minimize.
SMT process timed out in 10490ms, After SMT, problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 43 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (complete) has 1418 edges and 719 vertex of which 695 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.5 ms
Discarding 24 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 695 transition count 519
Reduce places removed 109 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 114 rules applied. Total rules applied 224 place count 586 transition count 514
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 229 place count 581 transition count 514
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 229 place count 581 transition count 383
Deduced a syphon composed of 131 places in 2 ms
Ensure Unique test removed 20 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 511 place count 430 transition count 383
Discarding 81 places :
Symmetric choice reduction at 3 with 81 rule applications. Total rules 592 place count 349 transition count 302
Iterating global reduction 3 with 81 rules applied. Total rules applied 673 place count 349 transition count 302
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 673 place count 349 transition count 299
Deduced a syphon composed of 3 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 680 place count 345 transition count 299
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 884 place count 242 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 886 place count 241 transition count 201
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 887 place count 241 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 888 place count 240 transition count 200
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 893 place count 240 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 894 place count 239 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 895 place count 238 transition count 199
Applied a total of 895 rules in 289 ms. Remains 238 /719 variables (removed 481) and now considering 199/638 (removed 439) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 238/719 places, 199/638 transitions.
RANDOM walk for 40000 steps (1214 resets) in 1108 ms. (36 steps per ms) remains 2/6 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (231 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (215 resets) in 272 ms. (146 steps per ms) remains 1/2 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 199 rows 238 cols
[2025-05-30 17:09:59] [INFO ] Computed 83 invariants in 10 ms
[2025-05-30 17:09:59] [INFO ] State equation strengthened by 4 read => feed constraints.
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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/170 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/213 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/214 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:59] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:59] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:59] [INFO ] Deduced a trap composed of 49 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-30 17:09:59] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 195/409 variables, 214/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 26/435 variables, 23/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 9/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/437 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/437 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 329 constraints, problems are : Problem set: 0 solved, 1 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 238/238 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/170 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 43/213 variables, 19/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:10:00] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:10:00] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:10:00] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:10:00] [INFO ] Deduced a trap composed of 20 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-30 17:10:00] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:10:01] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:10:01] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:10:01] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:10:01] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:10:01] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:10:01] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:10:01] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:10:02] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/214 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 195/409 variables, 214/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 26/435 variables, 23/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/435 variables, 9/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/435 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/437 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/437 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/437 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 343 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2247 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 238/238 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3041ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3402 steps, including 68 resets, run visited all 1 properties in 28 ms. (steps per millisecond=121 )
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2025-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 35 ms.
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 16805 ms.

BK_STOP 1748625002542

--------------------
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-20"
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-20, 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-174853813400159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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