fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r082-smll-177946993500071
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DatabaseWithMutex-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
982.447 30462.00 82166.00 199.00 TFTTTTTFTTTFFTFT normal

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.r082-smll-177946993500071.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 DatabaseWithMutex-PT-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993500071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 436K Mar 5 14:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Mar 5 14:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 550K Mar 5 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.6M Mar 5 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 274K Mar 15 08:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 873K Mar 15 08:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 177K Mar 15 08:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 657K Mar 15 08:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 449K Mar 5 14:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Mar 5 14:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 828K Mar 5 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Mar 5 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 32K Mar 15 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 76K Mar 15 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 2.7M 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 DatabaseWithMutex-PT-20-ReachabilityFireability-2024-00
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-01
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-02
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-03
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-04
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-05
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-06
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-07
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-08
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-09
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-10
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-11
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-12
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-13
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-14
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779536532883

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-23 11:42:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 11:42:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 11:42:15] [INFO ] Load time of PNML (sax parser for PT used): 534 ms
[2026-05-23 11:42:15] [INFO ] Transformed 3260 places.
[2026-05-23 11:42:15] [INFO ] Transformed 3200 transitions.
[2026-05-23 11:42:15] [INFO ] Found NUPN structural information;
[2026-05-23 11:42:15] [INFO ] Parsed PT model containing 3260 places and 3200 transitions and 23200 arcs in 780 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 194 ms.
Working with output stream class java.io.PrintStream
[2026-05-23 11:42:16] [INFO ] Reduced 380 identical enabling conditions.
[2026-05-23 11:42:16] [INFO ] Reduced 380 identical enabling conditions.
[2026-05-23 11:42:16] [INFO ] Reduced 380 identical enabling conditions.
[2026-05-23 11:42:16] [INFO ] Reduced 380 identical enabling conditions.
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 5200 ms. (7 steps per ms) remains 3/15 properties
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1066 ms. (37 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 756 ms. (52 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7943549088601999016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2478095535840654742.kers'
[2026-05-23 11:42:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7943549088601999016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2478095535840654742.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 3200 rows 3260 cols 23200 entries
Finished phase 1 with 2400 SingleSign rule and 400 generalized
[2026-05-23 11:42:19] [INFO ] Computed 460 invariants in 72 ms
Computed 460 P flows in 76 ms.
Exported basis to /tmp/petrispot-output-2478095535840654742.kers
Total runtime 84 ms.
[2026-05-23 11:42:19] [INFO ] Flatten gal took : 995 ms
Excessive predecessor constraint size, skipping predecessor.
[2026-05-23 11:42:19] [INFO ] Flatten gal took : 267 ms
[2026-05-23 11:42:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16332441640500648582.gal : 208 ms
[2026-05-23 11:42:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7517481424587033950.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16332441640500648582.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7517481424587033950.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 813/994 variables, 45/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/994 variables, 813/1039 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/994 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 345/1339 variables, 16/1055 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1339 variables, 345/1400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality7517481424587033950.prop.
At refinement iteration 7 (INCLUDED_ONLY) 0/1339 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1921/3260 variables, 399/1799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3260 variables, 1921/3720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3260 variables, 0/3720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5486ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 181 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 522 transitions
Trivial Post-agglo rules discarded 522 transitions
Performed 522 trivial Post agglomeration. Transition count delta: 522
Iterating post reduction 0 with 522 rules applied. Total rules applied 522 place count 3260 transition count 2678
Reduce places removed 529 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 768 rules applied. Total rules applied 1290 place count 2731 transition count 2439
Reduce places removed 239 places and 0 transitions.
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Iterating post reduction 2 with 355 rules applied. Total rules applied 1645 place count 2492 transition count 2323
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 3 with 116 rules applied. Total rules applied 1761 place count 2376 transition count 2323
Performed 571 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 571 Pre rules applied. Total rules applied 1761 place count 2376 transition count 1752
Deduced a syphon composed of 571 places in 2 ms
Reduce places removed 571 places and 0 transitions.
Iterating global reduction 4 with 1142 rules applied. Total rules applied 2903 place count 1805 transition count 1752
Free-agglomeration rule applied 234 times.
Iterating global reduction 4 with 234 rules applied. Total rules applied 3137 place count 1805 transition count 1518
Reduce places removed 234 places and 0 transitions.
Iterating post reduction 4 with 234 rules applied. Total rules applied 3371 place count 1571 transition count 1518
Free-agglomeration rule (complex) applied 45 times.
Iterating global reduction 5 with 45 rules applied. Total rules applied 3416 place count 1571 transition count 1473
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 3463 place count 1524 transition count 1473
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 38 Pre rules applied. Total rules applied 3463 place count 1524 transition count 1435
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 3539 place count 1486 transition count 1435
Applied a total of 3539 rules in 1769 ms. Remains 1486 /3260 variables (removed 1774) and now considering 1435/3200 (removed 1765) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1784 ms. Remains : 1486/3260 places, 1435/3200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1725 ms. (23 steps per ms) remains 2/3 properties
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 960 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 420 ms. (95 steps per ms) remains 1/2 properties
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2093312143867170555.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5682026591246740560.kers'
[2026-05-23 11:42:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2093312143867170555.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5682026591246740560.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 6 ms.
// Phase 1: matrix 1435 rows 1481 cols 19076 entries
Finished phase 1 with 633 SingleSign rule and 402 generalized
[2026-05-23 11:42:27] [INFO ] Computed 451 invariants in 64 ms
Computed 451 P flows in 65 ms.
Exported basis to /tmp/petrispot-output-5682026591246740560.kers
Total runtime 69 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 195/315 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 195/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 157/472 variables, 25/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 157/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 898/1370 variables, 329/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1370 variables, 898/1744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1370 variables, 0/1744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/1378 variables, 8/1752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1378 variables, 8/1760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1378 variables, 0/1760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 108/1486 variables, 69/1829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1486 variables, 108/1937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1486 variables, 0/1937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1435/2921 variables, 1486/3423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2921 variables, 0/3423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2921 variables, 0/3423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2921/2921 variables, and 3423 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4015 ms.
Refiners :[Domain max(s): 1486/1486 constraints, Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 398/398 constraints, State Equation: 1486/1486 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/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 195/315 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 195/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 157/472 variables, 25/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 157/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 898/1370 variables, 329/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1370 variables, 898/1744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :12 after 15
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :15 after 27
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :27 after 45
At refinement iteration 10 (INCLUDED_ONLY) 0/1370 variables, 0/1744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :45 after 2092
At refinement iteration 11 (OVERLAPS) 8/1378 variables, 8/1752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1378 variables, 8/1760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1378 variables, 0/1760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 108/1486 variables, 69/1829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1486 variables, 108/1937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1486 variables, 0/1937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1435/2921 variables, 1486/3423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2921 variables, 0/3423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2921 variables, 0/3423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2921/2921 variables, and 3423 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12034 ms.
Refiners :[Domain max(s): 1486/1486 constraints, Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 398/398 constraints, State Equation: 1486/1486 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16199ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=28 )
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 21 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 28388 ms.

BK_STOP 1779536563345

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="DatabaseWithMutex-PT-20"
export BK_EXAMINATION="ReachabilityFireability"
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 DatabaseWithMutex-PT-20, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-smll-177946993500071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-20.tgz
mv DatabaseWithMutex-PT-20 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;