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.r098-tall-177955695700598.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 DLCround-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695700598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 9.8K Mar 6 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Mar 6 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 09:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 09:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 6 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 6 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 DLCround-PT-08b-ReachabilityCardinality-2024-00
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-01
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-02
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-03
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-04
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-05
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-06
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-07
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-08
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-09
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-10
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-11
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-12
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-13
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-14
FORMULA_NAME DLCround-PT-08b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779638482985

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 16:01:24] [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 16:01:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 16:01:24] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2026-05-24 16:01:24] [INFO ] Transformed 3088 places.
[2026-05-24 16:01:24] [INFO ] Transformed 4732 transitions.
[2026-05-24 16:01:24] [INFO ] Found NUPN structural information;
[2026-05-24 16:01:24] [INFO ] Parsed PT model containing 3088 places and 4732 transitions and 13004 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1819 ms. (21 steps per ms) remains 3/10 properties
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 873 ms. (45 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
[2026-05-24 16:01:25] [INFO ] Flatten gal took : 334 ms
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 3/3 properties
[2026-05-24 16:01:25] [INFO ] Flatten gal took : 187 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14154867421375078347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15961635628788551001.kers'
[2026-05-24 16:01:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14154867421375078347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15961635628788551001.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4732 rows 3088 cols 13004 entries
[2026-05-24 16:01:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6913023550494070888.gal : 92 ms
Finished phase 1 with 2931 SingleSign rule and 0 generalized
[2026-05-24 16:01:25] [INFO ] Computed 157 invariants in 28 ms
Computed 157 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-15961635628788551001.kers
Total runtime 34 ms.
[2026-05-24 16:01:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5793475638879912437.prop : 1 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/ReachabilityCardinality6913023550494070888.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5793475638879912437.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 ...328
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality5793475638879912437.prop.
At refinement iteration 2 (OVERLAPS) 2820/2885 variables, 146/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2885 variables, 2820/3031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2885 variables, 0/3031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 203/3088 variables, 11/3042 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3088 variables, 203/3245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3088 variables, 0/3245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5315ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 65 out of 3088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3088/3088 places, 4732/4732 transitions.
Graph (trivial) has 2757 edges and 3088 vertex of which 450 / 3088 are part of one of the 41 SCC in 18 ms
Free SCC test removed 409 places
Drop transitions (Empty/Sink Transition effects.) removed 463 transitions
Reduce isomorphic transitions removed 463 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1117 transitions
Trivial Post-agglo rules discarded 1117 transitions
Performed 1117 trivial Post agglomeration. Transition count delta: 1117
Iterating post reduction 0 with 1117 rules applied. Total rules applied 1118 place count 2679 transition count 3152
Reduce places removed 1117 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 1175 rules applied. Total rules applied 2293 place count 1562 transition count 3094
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 31 rules applied. Total rules applied 2324 place count 1537 transition count 3088
Reduce places removed 2 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 3 with 43 rules applied. Total rules applied 2367 place count 1535 transition count 3047
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 45 rules applied. Total rules applied 2412 place count 1494 transition count 3043
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2414 place count 1492 transition count 3043
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 30 Pre rules applied. Total rules applied 2414 place count 1492 transition count 3013
Deduced a syphon composed of 30 places in 44 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2474 place count 1462 transition count 3013
Discarding 364 places :
Symmetric choice reduction at 6 with 364 rule applications. Total rules 2838 place count 1098 transition count 2649
Iterating global reduction 6 with 364 rules applied. Total rules applied 3202 place count 1098 transition count 2649
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3204 place count 1098 transition count 2647
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 148 Pre rules applied. Total rules applied 3204 place count 1098 transition count 2499
Deduced a syphon composed of 148 places in 10 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 7 with 296 rules applied. Total rules applied 3500 place count 950 transition count 2499
Discarding 51 places :
Symmetric choice reduction at 7 with 51 rule applications. Total rules 3551 place count 899 transition count 1919
Iterating global reduction 7 with 51 rules applied. Total rules applied 3602 place count 899 transition count 1919
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 3616 place count 899 transition count 1905
Performed 218 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 218 places in 7 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 8 with 436 rules applied. Total rules applied 4052 place count 681 transition count 1680
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4056 place count 681 transition count 1676
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 4061 place count 676 transition count 1616
Iterating global reduction 9 with 5 rules applied. Total rules applied 4066 place count 676 transition count 1616
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: -843
Deduced a syphon composed of 91 places in 2 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 9 with 182 rules applied. Total rules applied 4248 place count 585 transition count 2459
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 146 transitions.
Iterating post reduction 9 with 146 rules applied. Total rules applied 4394 place count 585 transition count 2313
Discarding 16 places :
Symmetric choice reduction at 10 with 16 rule applications. Total rules 4410 place count 569 transition count 1891
Iterating global reduction 10 with 16 rules applied. Total rules applied 4426 place count 569 transition count 1891
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4435 place count 569 transition count 1882
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 4445 place count 564 transition count 1939
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 4450 place count 564 transition count 1934
Drop transitions (Redundant composition of simpler transitions.) removed 156 transitions
Redundant transition composition rules discarded 156 transitions
Iterating global reduction 12 with 156 rules applied. Total rules applied 4606 place count 564 transition count 1778
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 4610 place count 560 transition count 1711
Iterating global reduction 12 with 4 rules applied. Total rules applied 4614 place count 560 transition count 1711
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 4618 place count 560 transition count 1707
Free-agglomeration rule applied 208 times with reduction of 91 identical transitions.
Iterating global reduction 13 with 208 rules applied. Total rules applied 4826 place count 560 transition count 1408
Reduce places removed 208 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 292 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 307 transitions.
Graph (complete) has 1205 edges and 352 vertex of which 350 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 516 rules applied. Total rules applied 5342 place count 350 transition count 1101
Discarding 10 places :
Symmetric choice reduction at 14 with 10 rule applications. Total rules 5352 place count 340 transition count 1067
Iterating global reduction 14 with 10 rules applied. Total rules applied 5362 place count 340 transition count 1067
Drop transitions (Redundant composition of simpler transitions.) removed 88 transitions
Redundant transition composition rules discarded 88 transitions
Iterating global reduction 14 with 88 rules applied. Total rules applied 5450 place count 340 transition count 979
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 5452 place count 338 transition count 979
Discarding 20 places :
Symmetric choice reduction at 15 with 20 rule applications. Total rules 5472 place count 318 transition count 926
Iterating global reduction 15 with 20 rules applied. Total rules applied 5492 place count 318 transition count 926
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 5494 place count 317 transition count 934
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 5501 place count 317 transition count 927
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 5504 place count 317 transition count 924
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 5505 place count 317 transition count 935
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 9 rules applied. Total rules applied 5514 place count 316 transition count 927
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 17 with 4 rules applied. Total rules applied 5518 place count 316 transition count 923
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 5521 place count 316 transition count 923
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 5522 place count 315 transition count 922
Applied a total of 5522 rules in 1137 ms. Remains 315 /3088 variables (removed 2773) and now considering 922/4732 (removed 3810) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1151 ms. Remains : 315/3088 places, 922/4732 transitions.
RANDOM walk for 40000 steps (8 resets) in 1414 ms. (28 steps per ms) remains 2/3 properties
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/2 properties
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-24 16:01:32] [INFO ] Flow matrix only has 601 transitions (discarded 321 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4986807622614423039.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5260933798170249412.kers'
[2026-05-24 16:01:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4986807622614423039.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5260933798170249412.kers]
Culling duplicate invariants (modulo rational): removing 37 columns.
Culled 37 columns in 0 ms.
// Phase 1: matrix 601 rows 278 cols 2607 entries
Finished phase 1 with 191 SingleSign rule and 0 generalized
[2026-05-24 16:01:32] [INFO ] Computed 124 invariants in 3 ms
Computed 124 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5260933798170249412.kers
Total runtime 4 ms.
[2026-05-24 16:01:32] [INFO ] State equation strengthened by 131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 212/256 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/278 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/313 variables, 35/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 599/912 variables, 313/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/912 variables, 130/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/916 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/916 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/916 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 916/916 variables, and 570 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 315/315 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 212/256 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/278 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/313 variables, 35/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 599/912 variables, 313/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/912 variables, 130/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/912 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/916 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/916 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/916 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 916/916 variables, and 571 constraints, problems are : Problem set: 0 solved, 1 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 315/315 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 919ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
FORMULA DLCround-PT-08b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 14 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 9569 ms.

BK_STOP 1779638493743

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="DLCround-PT-08b"
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 DLCround-PT-08b, 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 r098-tall-177955695700598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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