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-177961107900511.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-S32C3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107900511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 13K Mar 7 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 7 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Mar 15 11:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 7 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Mar 7 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 7 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Mar 7 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:15 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 3.4M 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-S32C3-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779932605827

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-S32C3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-28 01:43:28] [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 01:43:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 01:43:29] [INFO ] Load time of PNML (sax parser for PT used): 707 ms
[2026-05-28 01:43:29] [INFO ] Transformed 5622 places.
[2026-05-28 01:43:29] [INFO ] Transformed 5449 transitions.
[2026-05-28 01:43:29] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 948 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1538 resets) in 4731 ms. (8 steps per ms) remains 8/16 properties
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (48 resets) in 327 ms. (121 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (117 resets) in 864 ms. (46 steps per ms) remains 7/8 properties
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (116 resets) in 251 ms. (158 steps per ms) remains 6/7 properties
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (40 resets) in 724 ms. (55 steps per ms) remains 6/6 properties
[2026-05-28 01:43:31] [INFO ] Flatten gal took : 1067 ms
BEST_FIRST walk for 40004 steps (115 resets) in 525 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (41 resets) in 549 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (40 resets) in 701 ms. (56 steps per ms) remains 6/6 properties
[2026-05-28 01:43:32] [INFO ] Flatten gal took : 391 ms
BEST_FIRST walk for 40004 steps (48 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2408576374892156275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14000626733672162868.kers'
[2026-05-28 01:43:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17195359075759628241.gal : 227 ms
[2026-05-28 01:43:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2408576374892156275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14000626733672162868.kers]
[2026-05-28 01:43:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1541788697346904786.prop : 5 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/ReachabilityCardinality17195359075759628241.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1541788697346904786.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
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 13 ms.
// Phase 1: matrix 5449 rows 5586 cols 15220 entries
Finished phase 1 with 3287 SingleSign rule and 2162 generalized
[2026-05-28 01:43:32] [INFO ] Computed 173 invariants in 204 ms
Computed 173 P flows in 210 ms.
Exported basis to /tmp/petrispot-output-14000626733672162868.kers
Total runtime 216 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Loading property file /tmp/ReachabilityCardinality1541788697346904786.prop.
At refinement iteration 1 (OVERLAPS) 5068/5251 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-06 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-12 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/5251 variables, 17/73 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5251 variables, 0/73 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 11/5262 variables, 11/84 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5262 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 359/5621 variables, 88/172 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5621/11071 variables, and 172 constraints, problems are : Problem set: 3 solved, 3 unsolved in 5113 ms.
Refiners :[Positive P Invariants (semi-flows): 67/68 constraints, Generalized P Invariants (flows): 105/105 constraints, State Equation: 0/5622 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4490/4568 variables, 43/43 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4568 variables, 7/50 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4568 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 14/4582 variables, 14/64 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4582 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 835/5417 variables, 94/158 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5417 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5617/11071 variables, and 169 constraints, problems are : Problem set: 3 solved, 3 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 68/68 constraints, Generalized P Invariants (flows): 101/105 constraints, State Equation: 0/5622 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10791ms problems are : Problem set: 3 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 78 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 852 are kept as prefixes of interest. Removing 4770 places using SCC suffix rule.27 ms
Discarding 4770 places :
Also discarding 2821 output transitions
Drop transitions (Output transitions of discarded places.) removed 2821 transitions
Drop transitions (Empty/Sink Transition effects.) removed 802 transitions
Reduce isomorphic transitions removed 802 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 945 rules applied. Total rules applied 946 place count 852 transition count 1683
Reduce places removed 145 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 150 rules applied. Total rules applied 1096 place count 707 transition count 1678
Reduce places removed 5 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 2 with 44 rules applied. Total rules applied 1140 place count 702 transition count 1639
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 1179 place count 663 transition count 1639
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 1179 place count 663 transition count 1627
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1203 place count 651 transition count 1627
Discarding 261 places :
Symmetric choice reduction at 4 with 261 rule applications. Total rules 1464 place count 390 transition count 1366
Iterating global reduction 4 with 261 rules applied. Total rules applied 1725 place count 390 transition count 1366
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 1732 place count 390 transition count 1359
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1739 place count 383 transition count 1359
Partial Free-agglomeration rule applied 57 times.
Drop transitions (Partial Free agglomeration) removed 57 transitions
Iterating global reduction 5 with 57 rules applied. Total rules applied 1796 place count 383 transition count 1359
Applied a total of 1796 rules in 554 ms. Remains 383 /5622 variables (removed 5239) and now considering 1359/5449 (removed 4090) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 579 ms. Remains : 383/5622 places, 1359/5449 transitions.
RANDOM walk for 40000 steps (3298 resets) in 1063 ms. (37 steps per ms) remains 2/3 properties
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (172 resets) in 774 ms. (51 steps per ms) remains 1/2 properties
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (195 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
[2026-05-28 01:43:44] [INFO ] Flow matrix only has 550 transitions (discarded 809 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2498497174045757142.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11607639586683021425.kers'
[2026-05-28 01:43:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2498497174045757142.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11607639586683021425.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 550 rows 382 cols 1508 entries
Finished phase 1 with 310 SingleSign rule and 57 generalized
[2026-05-28 01:43:44] [INFO ] Computed 16 invariants in 7 ms
Computed 16 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-11607639586683021425.kers
Total runtime 10 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/64 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/180 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 529/709 variables, 115/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/709 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/763 variables, 11/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/763 variables, 43/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/763 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 167/930 variables, 158/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/930 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/931 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/931 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/931 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/933 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/933 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/933 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 671 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 1/1 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/64 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/180 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 529/709 variables, 115/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/709 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/709 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 54/763 variables, 11/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/763 variables, 43/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/763 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 167/930 variables, 158/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/930 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/931 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/931 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/931 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/933 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/933 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/933 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 400 constraints, problems are : Problem set: 0 solved, 1 unsolved in 979 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1702ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 12 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 17730 ms.

BK_STOP 1779932626130

--------------------
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-S32C3"
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-S32C3, 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-177961107900511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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