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-177946842100598.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-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.8K Mar 5 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 5 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K 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:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:48 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 6.3K Mar 5 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K 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 189K 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-19-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779629074445

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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 13:24:35] [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 13:24:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:24:35] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2026-05-24 13:24:35] [INFO ] Transformed 772 places.
[2026-05-24 13:24:35] [INFO ] Transformed 685 transitions.
[2026-05-24 13:24:35] [INFO ] Found NUPN structural information;
[2026-05-24 13:24:35] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 13:24:36] [INFO ] Flatten gal took : 125 ms
RANDOM walk for 40000 steps (218 resets) in 1513 ms. (26 steps per ms) remains 9/12 properties
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (43 resets) in 201 ms. (198 steps per ms) remains 9/9 properties
[2026-05-24 13:24:36] [INFO ] Flatten gal took : 131 ms
BEST_FIRST walk for 40003 steps (39 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
[2026-05-24 13:24:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2567730902874118078.gal : 54 ms
[2026-05-24 13:24:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16594064993796682928.prop : 4 ms
BEST_FIRST walk for 40003 steps (38 resets) in 375 ms. (106 steps per ms) remains 9/9 properties
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/ReachabilityCardinality2567730902874118078.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16594064993796682928.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40002 steps (39 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality16594064993796682928.prop.
BEST_FIRST walk for 40003 steps (38 resets) in 238 ms. (167 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (32 resets) in 245 ms. (162 steps per ms) remains 8/9 properties
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
BEST_FIRST walk for 40003 steps (36 resets) in 238 ms. (167 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 19
BEST_FIRST walk for 40004 steps (37 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :36 after 43
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :43 after 169
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :169 after 4331
BEST_FIRST walk for 40003 steps (38 resets) in 460 ms. (86 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12530670599311849965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14662286962193163170.kers'
[2026-05-24 13:24:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12530670599311849965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14662286962193163170.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 670 rows 757 cols 1951 entries
Finished phase 1 with 540 SingleSign rule and 92 generalized
[2026-05-24 13:24:37] [INFO ] Computed 125 invariants in 8 ms
Computed 125 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-14662286962193163170.kers
Total runtime 13 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 460/520 variables, 89/149 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 460/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 90/610 variables, 18/628 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 90/718 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-19-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 143/753 variables, 15/733 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/753 variables, 143/876 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 0/876 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 4/757 variables, 2/878 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/757 variables, 4/882 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/757 variables, 0/882 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 670/1427 variables, 757/1639 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SMT process timed out in 5465ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 393 edges and 757 vertex of which 7 / 757 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1512 edges and 751 vertex of which 743 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 150 place count 743 transition count 513
Reduce places removed 148 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 160 rules applied. Total rules applied 310 place count 595 transition count 501
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 322 place count 583 transition count 501
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 322 place count 583 transition count 400
Deduced a syphon composed of 101 places in 3 ms
Ensure Unique test removed 18 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 542 place count 464 transition count 400
Discarding 86 places :
Symmetric choice reduction at 3 with 86 rule applications. Total rules 628 place count 378 transition count 314
Iterating global reduction 3 with 86 rules applied. Total rules applied 714 place count 378 transition count 314
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 714 place count 378 transition count 308
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 727 place count 371 transition count 308
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 951 place count 259 transition count 196
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 953 place count 258 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 954 place count 258 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 955 place count 257 transition count 198
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 956 place count 257 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 957 place count 256 transition count 197
Applied a total of 957 rules in 236 ms. Remains 256 /757 variables (removed 501) and now considering 197/670 (removed 473) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 256/757 places, 197/670 transitions.
RANDOM walk for 40000 steps (1792 resets) in 566 ms. (70 steps per ms) remains 5/7 properties
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (600 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (557 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (550 resets) in 180 ms. (221 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (546 resets) in 110 ms. (360 steps per ms) remains 4/5 properties
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (299 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11524574607878620217.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16060096681546846621.kers'
[2026-05-24 13:24:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11524574607878620217.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16060096681546846621.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 256 cols 993 entries
Finished phase 1 with 73 SingleSign rule and 84 generalized
[2026-05-24 13:24:43] [INFO ] Computed 99 invariants in 1 ms
Computed 99 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16060096681546846621.kers
Total runtime 3 ms.
[2026-05-24 13:24:43] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 134/176 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 38/214 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 36/250 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/252 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 197/449 variables, 252/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 5/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 4/453 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/453 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 360 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1156 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 256/256 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 134/176 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem BusinessProcesses-PT-19-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 11/74 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 38/214 variables, 19/93 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 36/250 variables, 15/108 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 20/128 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 14/142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 8/150 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 2/153 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/252 variables, 2/155 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 197/449 variables, 252/407 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/449 variables, 5/412 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/449 variables, 1/413 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/449 variables, 6/419 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/449 variables, 3/422 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/449 variables, 1/423 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/449 variables, 1/424 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/449 variables, 1/425 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/449 variables, 0/425 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 4/453 variables, 4/429 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/453 variables, 2/431 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/453 variables, 3/434 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/453 variables, 0/434 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/453 variables, 0/434 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 434 constraints, problems are : Problem set: 1 solved, 3 unsolved in 6916 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 256/256 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 8101ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 292 ms.
Support contains 27 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 256 transition count 191
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 250 transition count 191
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 12 place count 250 transition count 184
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 29 place count 240 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 238 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 238 transition count 182
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 228 transition count 174
Applied a total of 51 rules in 28 ms. Remains 228 /256 variables (removed 28) and now considering 174/197 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 228/256 places, 174/197 transitions.
RANDOM walk for 40000 steps (2570 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (964 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (867 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (894 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 41285 steps, run visited all 3 properties in 179 ms. (steps per millisecond=230 )
Probabilistic random walk after 41285 steps, saw 10238 distinct states, run finished after 182 ms. (steps per millisecond=226 ) properties seen :3
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-2024-01 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 16447 ms.

BK_STOP 1779629091987

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

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