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

About the Execution of ITS-Tools for LeafsetExtension-PT-S32C2

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423300758.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 LeafsetExtension-PT-S32C2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423300758
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K 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 4.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-00
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-01
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-02
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-03
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-04
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-05
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-06
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-07
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-08
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-09
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-10
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-11
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-12
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-13
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-14
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748895643652

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 20:20:45] [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-06-02 20:20:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:20:45] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2025-06-02 20:20:45] [INFO ] Transformed 5622 places.
[2025-06-02 20:20:45] [INFO ] Transformed 5449 transitions.
[2025-06-02 20:20:45] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 481 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (2194 resets) in 2449 ms. (16 steps per ms) remains 10/16 properties
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (179 resets) in 385 ms. (103 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (181 resets) in 391 ms. (102 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (180 resets) in 748 ms. (53 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (181 resets) in 390 ms. (102 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (181 resets) in 188 ms. (211 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (180 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (180 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (182 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (182 resets) in 196 ms. (203 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (180 resets) in 176 ms. (226 steps per ms) remains 10/10 properties
[2025-06-02 20:20:50] [INFO ] Flatten gal took : 1347 ms
[2025-06-02 20:20:51] [INFO ] Flatten gal took : 194 ms
// Phase 1: matrix 5449 rows 5622 cols
[2025-06-02 20:20:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4628611446024321791.gal : 156 ms
[2025-06-02 20:20:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2958885106353239644.prop : 3 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/ReachabilityCardinality4628611446024321791.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2958885106353239644.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 ...328
[2025-06-02 20:20:51] [INFO ] Computed 173 invariants in 481 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality2958885106353239644.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 4/320 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-08 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-11 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-12 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 5183/5503 variables, 114/118 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5503 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-00 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-09 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-10 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 31/5534 variables, 31/149 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5534 variables, 0/149 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 88/5622 variables, 24/173 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5622 variables, 0/173 constraints. Problems are: Problem set: 6 solved, 4 unsolved
SMT process timed out in 6129ms, After SMT, problems are : Problem set: 6 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 242 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 2717 are kept as prefixes of interest. Removing 2905 places using SCC suffix rule.14 ms
Discarding 2905 places :
Also discarding 1068 output transitions
Drop transitions (Output transitions of discarded places.) removed 1068 transitions
Drop transitions (Empty/Sink Transition effects.) removed 795 transitions
Reduce isomorphic transitions removed 795 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 880 transitions
Trivial Post-agglo rules discarded 880 transitions
Performed 880 trivial Post agglomeration. Transition count delta: 880
Iterating post reduction 0 with 1675 rules applied. Total rules applied 1676 place count 2717 transition count 2706
Reduce places removed 882 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 1 with 935 rules applied. Total rules applied 2611 place count 1835 transition count 2653
Reduce places removed 53 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 2 with 84 rules applied. Total rules applied 2695 place count 1782 transition count 2622
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 2726 place count 1751 transition count 2622
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 2726 place count 1751 transition count 2560
Deduced a syphon composed of 62 places in 3 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 2850 place count 1689 transition count 2560
Discarding 103 places :
Symmetric choice reduction at 4 with 103 rule applications. Total rules 2953 place count 1586 transition count 2457
Iterating global reduction 4 with 103 rules applied. Total rules applied 3056 place count 1586 transition count 2457
Free-agglomeration rule (complex) applied 87 times.
Iterating global reduction 4 with 87 rules applied. Total rules applied 3143 place count 1586 transition count 2370
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 4 with 87 rules applied. Total rules applied 3230 place count 1499 transition count 2370
Partial Free-agglomeration rule applied 193 times.
Drop transitions (Partial Free agglomeration) removed 193 transitions
Iterating global reduction 5 with 193 rules applied. Total rules applied 3423 place count 1499 transition count 2370
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 5 with 4 rules applied. Total rules applied 3427 place count 1495 transition count 2370
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3431 place count 1495 transition count 2366
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 3435 place count 1491 transition count 2366
Applied a total of 3435 rules in 1341 ms. Remains 1491 /5622 variables (removed 4131) and now considering 2366/5449 (removed 3083) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1351 ms. Remains : 1491/5622 places, 2366/5449 transitions.
RANDOM walk for 40000 steps (5249 resets) in 1925 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (214 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (210 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (214 resets) in 331 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (214 resets) in 308 ms. (129 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 69814 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 4
Probabilistic random walk after 69814 steps, saw 26084 distinct states, run finished after 3008 ms. (steps per millisecond=23 ) properties seen :0
[2025-06-02 20:21:02] [INFO ] Flow matrix only has 2355 transitions (discarded 11 similar events)
// Phase 1: matrix 2355 rows 1491 cols
[2025-06-02 20:21:02] [INFO ] Computed 13 invariants in 42 ms
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/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 89/333 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/334 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 852/1186 variables, 334/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1186 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2129/3315 variables, 626/972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3315 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 22/3337 variables, 1/973 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3337 variables, 22/995 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3337 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 509/3846 variables, 509/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3846 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/3846 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3846/3846 variables, and 1504 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3558 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1491/1491 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/244 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 89/333 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/334 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 852/1186 variables, 334/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1186 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-02 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-05 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 2129/3315 variables, 626/972 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3315 variables, 1/973 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3315 variables, 0/973 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 22/3337 variables, 1/974 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3337 variables, 22/996 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3337 variables, 0/996 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 509/3846 variables, 509/1505 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3846 variables, 0/1505 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/3846 variables, 0/1505 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3846/3846 variables, and 1505 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3214 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1491/1491 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6911ms problems are : Problem set: 2 solved, 2 unsolved
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-03 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2025-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 19 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 24400 ms.

BK_STOP 1748895669505

--------------------
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="LeafsetExtension-PT-S32C2"
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 LeafsetExtension-PT-S32C2, 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 r114-tall-174876423300758"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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