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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1965.880 28894.00 84399.00 247.80 TFTTTFFFFTTTTFTT 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.r162-smll-177961108000543.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 LeafsetExtension-PT-S64C4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961108000543
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Mar 7 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 7 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 7 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Mar 15 11:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 15 11:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 11:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Mar 7 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K Mar 7 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 14M 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 LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779959572790

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-28 09:12:55] [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-28 09:12:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 09:12:56] [INFO ] Load time of PNML (sax parser for PT used): 1099 ms
[2026-05-28 09:12:56] [INFO ] Transformed 21462 places.
[2026-05-28 09:12:56] [INFO ] Transformed 21129 transitions.
[2026-05-28 09:12:56] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 1467 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1202 resets) in 6486 ms. (6 steps per ms) remains 11/16 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (35 resets) in 300 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (43 resets) in 459 ms. (86 steps per ms) remains 10/11 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (36 resets) in 312 ms. (127 steps per ms) remains 9/10 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (36 resets) in 335 ms. (119 steps per ms) remains 8/9 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (39 resets) in 1098 ms. (36 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (24 resets) in 1311 ms. (30 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (36 resets) in 320 ms. (124 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 426 ms. (93 steps per ms) remains 7/8 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (37 resets) in 357 ms. (111 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17695686593770542178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16644477714175200960.kers'
[2026-05-28 09:13:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17695686593770542178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16644477714175200960.kers]
[2026-05-28 09:13:01] [INFO ] Flatten gal took : 2392 ms
Culling duplicate invariants (modulo rational): removing 68 columns.
Culled 68 columns in 46 ms.
// Phase 1: matrix 21129 rows 21394 cols 59092 entries
[2026-05-28 09:13:01] [INFO ] Flatten gal took : 820 ms
Finished phase 1 with 12711 SingleSign rule and 8418 generalized
[2026-05-28 09:13:02] [INFO ] Computed 333 invariants in 1055 ms
Computed 333 P flows in 1057 ms.
Exported basis to /tmp/petrispot-output-16644477714175200960.kers
Total runtime 1092 ms.
[2026-05-28 09:13:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11747437974336668115.gal : 462 ms
[2026-05-28 09:13:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16591288656218878226.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11747437974336668115.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16591288656218878226.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 ...330
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 15069/15166 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15166 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15166/42591 variables, and 70 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5063 ms.
Refiners :[Positive P Invariants (semi-flows): 58/132 constraints, Generalized P Invariants (flows): 12/201 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality16591288656218878226.prop.
At refinement iteration 1 (OVERLAPS) 15069/15166 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15166 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 15166/42591 variables, and 70 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5136 ms.
Refiners :[Positive P Invariants (semi-flows): 58/132 constraints, Generalized P Invariants (flows): 12/201 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12076ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 97 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 2708 are kept as prefixes of interest. Removing 18754 places using SCC suffix rule.45 ms
Discarding 18754 places :
Also discarding 11119 output transitions
Drop transitions (Output transitions of discarded places.) removed 11119 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3298 transitions
Reduce isomorphic transitions removed 3298 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 584 transitions
Trivial Post-agglo rules discarded 584 transitions
Performed 584 trivial Post agglomeration. Transition count delta: 584
Iterating post reduction 0 with 3882 rules applied. Total rules applied 3883 place count 2708 transition count 6128
Reduce places removed 586 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 600 rules applied. Total rules applied 4483 place count 2122 transition count 6114
Reduce places removed 14 places and 0 transitions.
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Iterating post reduction 2 with 155 rules applied. Total rules applied 4638 place count 2108 transition count 5973
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 3 with 141 rules applied. Total rules applied 4779 place count 1967 transition count 5973
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 4779 place count 1967 transition count 5952
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 4821 place count 1946 transition count 5952
Discarding 858 places :
Symmetric choice reduction at 4 with 858 rule applications. Total rules 5679 place count 1088 transition count 5094
Iterating global reduction 4 with 858 rules applied. Total rules applied 6537 place count 1088 transition count 5094
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 6544 place count 1088 transition count 5087
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 6551 place count 1081 transition count 5087
Partial Free-agglomeration rule applied 402 times.
Drop transitions (Partial Free agglomeration) removed 402 transitions
Iterating global reduction 5 with 402 rules applied. Total rules applied 6953 place count 1081 transition count 5087
Applied a total of 6953 rules in 1697 ms. Remains 1081 /21462 variables (removed 20381) and now considering 5087/21129 (removed 16042) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1713 ms. Remains : 1081/21462 places, 5087/21129 transitions.
RANDOM walk for 40000 steps (2874 resets) in 2212 ms. (18 steps per ms) remains 4/7 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (78 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (77 resets) in 388 ms. (102 steps per ms) remains 3/4 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (72 resets) in 361 ms. (110 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (80 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
[2026-05-28 09:13:15] [INFO ] Flow matrix only has 1763 transitions (discarded 3324 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13872513887777355544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16082908049972972601.kers'
[2026-05-28 09:13:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13872513887777355544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16082908049972972601.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1763 rows 1080 cols 4929 entries
Finished phase 1 with 960 SingleSign rule and 99 generalized
[2026-05-28 09:13:15] [INFO ] Computed 22 invariants in 33 ms
Computed 22 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-16082908049972972601.kers
Total runtime 38 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 117/160 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/161 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 652/813 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-07 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 1675/2488 variables, 580/751 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2488 variables, 0/751 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 116/2604 variables, 12/763 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2604 variables, 112/875 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2604 variables, 0/875 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 237/2841 variables, 226/1101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2841 variables, 0/1101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/2844 variables, 2/1103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2844 variables, 0/1103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2844 variables, 0/1103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2844/2844 variables, and 1103 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2305 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 1081/1081 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 71/79 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 178/258 variables, 80/84 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1759/2017 variables, 234/318 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2017 variables, 2/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2017 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 171/2188 variables, 14/334 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2188 variables, 171/505 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2188 variables, 0/505 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 649/2837 variables, 590/1095 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2837 variables, 0/1095 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/2841 variables, 4/1099 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2841 variables, 4/1103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2841 variables, 0/1103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/2844 variables, 2/1105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2844 variables, 0/1105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2844 variables, 0/1105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2844/2844 variables, and 1105 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3552 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 1081/1081 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5951ms problems are : Problem set: 1 solved, 2 unsolved
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 41 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 26500 ms.

BK_STOP 1779959601684

--------------------
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="LeafsetExtension-PT-S64C4"
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 LeafsetExtension-PT-S64C4, 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 r162-smll-177961108000543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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