Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842100582.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is BusinessProcesses-PT-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100582
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 5 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 5 17:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Mar 5 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 5 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 161K Mar 3 18:30 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-17-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779625851170

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 12:30:52] [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]
[2026-05-24 12:30:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:30:52] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2026-05-24 12:30:52] [INFO ] Transformed 650 places.
[2026-05-24 12:30:52] [INFO ] Transformed 580 transitions.
[2026-05-24 12:30:52] [INFO ] Found NUPN structural information;
[2026-05-24 12:30:52] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (256 resets) in 1121 ms. (35 steps per ms) remains 7/14 properties
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (45 resets) in 578 ms. (69 steps per ms) remains 7/7 properties
[2026-05-24 12:30:53] [INFO ] Flatten gal took : 192 ms
BEST_FIRST walk for 40003 steps (43 resets) in 333 ms. (119 steps per ms) remains 7/7 properties
[2026-05-24 12:30:53] [INFO ] Flatten gal took : 49 ms
BEST_FIRST walk for 40004 steps (46 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
[2026-05-24 12:30:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6970352158032474225.gal : 28 ms
[2026-05-24 12:30:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11062859240763086072.prop : 8 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6970352158032474225.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11062859240763086072.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (48 resets) in 164 ms. (242 steps per ms) remains 7/7 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (52 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
Loading property file /tmp/ReachabilityCardinality11062859240763086072.prop.
BEST_FIRST walk for 40004 steps (46 resets) in 297 ms. (134 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (58 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,7 properties remain. new max is 32
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2773953636272288303.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-541743877694935562.kers'
SDD size :19 after 30
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :30 after 65
[2026-05-24 12:30:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2773953636272288303.kers, --Pflows, --basisKERS=/tmp/petrispot-output-541743877694935562.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 576 rows 646 cols 1701 entries
Finished phase 1 with 458 SingleSign rule and 80 generalized
[2026-05-24 12:30:53] [INFO ] Computed 108 invariants in 3 ms
Computed 108 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-541743877694935562.kers
Total runtime 5 ms.
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :65 after 161
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :161 after 10780
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 427/510 variables, 86/169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 427/596 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 134/644 variables, 21/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 134/751 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2/646 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 576/1222 variables, 646/1400 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 1400 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5032 ms.
Refiners :[Domain max(s): 646/646 constraints, Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 646/646 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 427/510 variables, 86/169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 427/596 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 20/616 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 7/623 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 3/628 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/1222 variables, and 628 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5035 ms.
Refiners :[Domain max(s): 510/646 constraints, Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 0/22 constraints, State Equation: 0/646 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10186ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 83 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (complete) has 1312 edges and 646 vertex of which 642 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 642 transition count 511
Reduce places removed 64 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 79 rules applied. Total rules applied 144 place count 578 transition count 496
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 159 place count 563 transition count 496
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 159 place count 563 transition count 390
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 385 place count 443 transition count 390
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 454 place count 374 transition count 321
Iterating global reduction 3 with 69 rules applied. Total rules applied 523 place count 374 transition count 321
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 523 place count 374 transition count 317
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 532 place count 369 transition count 317
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 163 rules applied. Total rules applied 695 place count 287 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 696 place count 287 transition count 235
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 697 place count 287 transition count 235
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 702 place count 287 transition count 235
Applied a total of 702 rules in 170 ms. Remains 287 /646 variables (removed 359) and now considering 235/576 (removed 341) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 287/646 places, 235/576 transitions.
RANDOM walk for 40000 steps (850 resets) in 539 ms. (74 steps per ms) remains 6/7 properties
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (174 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (194 resets) in 453 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (192 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (195 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (192 resets) in 511 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (234 resets) in 136 ms. (292 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1447241147693756451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9859991292474690561.kers'
[2026-05-24 12:31:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1447241147693756451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9859991292474690561.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 235 rows 287 cols 993 entries
Finished phase 1 with 126 SingleSign rule and 72 generalized
[2026-05-24 12:31:04] [INFO ] Computed 89 invariants in 1 ms
Computed 89 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9859991292474690561.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 158/239 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 43/282 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/284 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 235/519 variables, 284/373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 3/522 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/522 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/522 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 376 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1711 ms.
Refiners :[Positive P Invariants (semi-flows): 68/68 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 158/239 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 43/282 variables, 19/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BusinessProcesses-PT-17-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 15/136 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 9/145 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/284 variables, 2/147 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 235/519 variables, 284/431 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/519 variables, 3/434 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 12/446 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 1/447 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/447 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 3/522 variables, 3/450 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 2/452 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/522 variables, 13/465 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 3/468 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/522 variables, 1/469 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/522 variables, 0/469 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/522 variables, 0/469 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 469 constraints, problems are : Problem set: 1 solved, 5 unsolved in 16777 ms.
Refiners :[Positive P Invariants (semi-flows): 68/68 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18514ms problems are : Problem set: 1 solved, 5 unsolved
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 801 ms.
Support contains 41 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 235/235 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 287 transition count 228
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 280 transition count 228
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 14 place count 280 transition count 214
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 45 place count 263 transition count 214
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 52 place count 256 transition count 207
Iterating global reduction 2 with 7 rules applied. Total rules applied 59 place count 256 transition count 207
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 51 rules applied. Total rules applied 110 place count 230 transition count 182
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 230 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 229 transition count 181
Applied a total of 112 rules in 55 ms. Remains 229 /287 variables (removed 58) and now considering 181/235 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 229/287 places, 181/235 transitions.
RANDOM walk for 40000 steps (1682 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (447 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (414 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (424 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (403 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 3329 steps, run visited all 4 properties in 26 ms. (steps per millisecond=128 )
Probabilistic random walk after 3329 steps, saw 1172 distinct states, run finished after 30 ms. (steps per millisecond=110 ) properties seen :4
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 31997 ms.

BK_STOP 1779625884463

--------------------
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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-17"
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-5973"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-17, 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 r034-tall-177946842100582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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