fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r072-tall-174860067000222
Last Updated
June 24, 2025

About the Execution of ITS-Tools for DLCround-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 17518.00 0.00 0.00 TTTTTTTTFTTFFFTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748676722139

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-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 07:32:03] [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]
[2025-05-31 07:32:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:32:03] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2025-05-31 07:32:03] [INFO ] Transformed 3495 places.
[2025-05-31 07:32:03] [INFO ] Transformed 5439 transitions.
[2025-05-31 07:32:03] [INFO ] Found NUPN structural information;
[2025-05-31 07:32:03] [INFO ] Parsed PT model containing 3495 places and 5439 transitions and 15081 arcs in 415 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1904 ms. (20 steps per ms) remains 3/15 properties
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 586 ms. (68 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 494 ms. (80 steps per ms) remains 3/3 properties
[2025-05-31 07:32:04] [INFO ] Flatten gal took : 539 ms
// Phase 1: matrix 5439 rows 3495 cols
[2025-05-31 07:32:05] [INFO ] Computed 184 invariants in 90 ms
[2025-05-31 07:32:05] [INFO ] Flatten gal took : 219 ms
Excessive predecessor constraint size, skipping predecessor.
[2025-05-31 07:32:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17035647326390378034.gal : 112 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 07:32:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5437632002313683823.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17035647326390378034.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5437632002313683823.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality5437632002313683823.prop.
At refinement iteration 2 (OVERLAPS) 3299/3415 variables, 176/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3415 variables, 3299/3591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3415 variables, 0/3591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 80/3495 variables, 8/3599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3495 variables, 80/3679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3495 variables, 0/3679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5439/8934 variables, 3495/7174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8934 variables, 0/7174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8934/8934 variables, and 7174 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5074 ms.
Refiners :[Domain max(s): 3495/3495 constraints, Positive P Invariants (semi-flows): 184/184 constraints, State Equation: 3495/3495 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3299/3415 variables, 176/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3415 variables, 3299/3591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:32:12] [INFO ] Deduced a trap composed of 206 places in 627 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:32:12] [INFO ] Deduced a trap composed of 221 places in 384 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/3415 variables, 2/3593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3415 variables, 0/3593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 80/3495 variables, 8/3601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3495 variables, 80/3681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3495 variables, 0/3681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 10369ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 116 out of 3495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3495/3495 places, 5439/5439 transitions.
Graph (trivial) has 3040 edges and 3495 vertex of which 457 / 3495 are part of one of the 41 SCC in 10 ms
Free SCC test removed 416 places
Drop transitions (Empty/Sink Transition effects.) removed 469 transitions
Reduce isomorphic transitions removed 469 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1230 transitions
Trivial Post-agglo rules discarded 1230 transitions
Performed 1230 trivial Post agglomeration. Transition count delta: 1230
Iterating post reduction 0 with 1230 rules applied. Total rules applied 1231 place count 3079 transition count 3740
Reduce places removed 1230 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 1 with 1294 rules applied. Total rules applied 2525 place count 1849 transition count 3676
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 37 rules applied. Total rules applied 2562 place count 1820 transition count 3668
Reduce places removed 4 places and 0 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Iterating post reduction 3 with 57 rules applied. Total rules applied 2619 place count 1816 transition count 3615
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 55 rules applied. Total rules applied 2674 place count 1763 transition count 3613
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 2674 place count 1763 transition count 3572
Deduced a syphon composed of 41 places in 15 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 2756 place count 1722 transition count 3572
Discarding 398 places :
Symmetric choice reduction at 5 with 398 rule applications. Total rules 3154 place count 1324 transition count 3174
Iterating global reduction 5 with 398 rules applied. Total rules applied 3552 place count 1324 transition count 3174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3554 place count 1324 transition count 3172
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 155 Pre rules applied. Total rules applied 3554 place count 1324 transition count 3017
Deduced a syphon composed of 155 places in 12 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 6 with 310 rules applied. Total rules applied 3864 place count 1169 transition count 3017
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 3905 place count 1128 transition count 2505
Iterating global reduction 6 with 41 rules applied. Total rules applied 3946 place count 1128 transition count 2505
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 3958 place count 1128 transition count 2493
Performed 278 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 278 places in 3 ms
Reduce places removed 278 places and 0 transitions.
Iterating global reduction 7 with 556 rules applied. Total rules applied 4514 place count 850 transition count 2212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4515 place count 850 transition count 2211
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 4522 place count 843 transition count 2120
Iterating global reduction 8 with 7 rules applied. Total rules applied 4529 place count 843 transition count 2120
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -949
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 8 with 194 rules applied. Total rules applied 4723 place count 746 transition count 3069
Drop transitions (Empty/Sink Transition effects.) removed 151 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 154 transitions.
Iterating post reduction 8 with 154 rules applied. Total rules applied 4877 place count 746 transition count 2915
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 4890 place count 733 transition count 2563
Iterating global reduction 9 with 13 rules applied. Total rules applied 4903 place count 733 transition count 2563
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 4907 place count 733 transition count 2559
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 4915 place count 729 transition count 2603
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 4918 place count 729 transition count 2600
Drop transitions (Redundant composition of simpler transitions.) removed 227 transitions
Redundant transition composition rules discarded 227 transitions
Iterating global reduction 11 with 227 rules applied. Total rules applied 5145 place count 729 transition count 2373
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 5153 place count 721 transition count 2241
Iterating global reduction 11 with 8 rules applied. Total rules applied 5161 place count 721 transition count 2241
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 5166 place count 721 transition count 2236
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 12 with 12 rules applied. Total rules applied 5178 place count 715 transition count 2301
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 5187 place count 715 transition count 2292
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 13 with 10 rules applied. Total rules applied 5197 place count 715 transition count 2282
Free-agglomeration rule applied 243 times with reduction of 81 identical transitions.
Iterating global reduction 13 with 243 rules applied. Total rules applied 5440 place count 715 transition count 1958
Reduce places removed 243 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 323 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 343 transitions.
Iterating post reduction 13 with 586 rules applied. Total rules applied 6026 place count 472 transition count 1615
Discarding 11 places :
Symmetric choice reduction at 14 with 11 rule applications. Total rules 6037 place count 461 transition count 1574
Iterating global reduction 14 with 11 rules applied. Total rules applied 6048 place count 461 transition count 1574
Drop transitions (Redundant composition of simpler transitions.) removed 119 transitions
Redundant transition composition rules discarded 119 transitions
Iterating global reduction 14 with 119 rules applied. Total rules applied 6167 place count 461 transition count 1455
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 6171 place count 457 transition count 1442
Iterating global reduction 14 with 4 rules applied. Total rules applied 6175 place count 457 transition count 1442
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 6178 place count 457 transition count 1516
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 14 with 44 rules applied. Total rules applied 6222 place count 454 transition count 1475
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 15 with 43 rules applied. Total rules applied 6265 place count 454 transition count 1432
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 15 with 8 rules applied. Total rules applied 6273 place count 454 transition count 1432
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 6275 place count 454 transition count 1430
Applied a total of 6275 rules in 1470 ms. Remains 454 /3495 variables (removed 3041) and now considering 1430/5439 (removed 4009) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1476 ms. Remains : 454/3495 places, 1430/5439 transitions.
RANDOM walk for 40000 steps (8 resets) in 1096 ms. (36 steps per ms) remains 1/3 properties
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 506 ms. (78 steps per ms) remains 1/1 properties
[2025-05-31 07:32:17] [INFO ] Flow matrix only has 861 transitions (discarded 569 similar events)
// Phase 1: matrix 861 rows 454 cols
[2025-05-31 07:32:17] [INFO ] Computed 169 invariants in 6 ms
[2025-05-31 07:32:17] [INFO ] State equation strengthened by 182 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 244/330 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 124/454 variables, 70/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 861/1315 variables, 454/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1315 variables, 182/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1315 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1315 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1315/1315 variables, and 805 constraints, problems are : Problem set: 0 solved, 1 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 169/169 constraints, State Equation: 454/454 constraints, ReadFeed: 182/182 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :20 after 844
At refinement iteration 1 (OVERLAPS) 244/330 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :844 after 29811
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :29811 after 137661
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :137661 after 140070
[2025-05-31 07:32:18] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :140070 after 177961
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :177961 after 242060
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 124/454 variables, 70/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :242060 after 382688
[2025-05-31 07:32:18] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :382688 after 2.60804e+06
At refinement iteration 7 (OVERLAPS) 861/1315 variables, 454/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1315 variables, 182/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:32:18] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:32:19] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1315 variables, 2/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:32:19] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1315 variables, 1/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1315 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :2.60804e+06 after 2.23476e+08
At refinement iteration 12 (OVERLAPS) 0/1315 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1315/1315 variables, and 810 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1570 ms.
Refiners :[Positive P Invariants (semi-flows): 169/169 constraints, State Equation: 454/454 constraints, ReadFeed: 182/182 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2221ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 87 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=29 )
FORMULA DLCround-PT-09b-ReachabilityCardinality-2025-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 16 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 16310 ms.

BK_STOP 1748676739657

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-09b"
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-5832"
echo " Executing tool itstools"
echo " Input is DLCround-PT-09b, 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 r072-tall-174860067000222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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