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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 14K Mar 7 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 7 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 7 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Mar 15 11:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 15 11:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 11:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 15 11:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Mar 7 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 7 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 7 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:16 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-S64C2-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779944735481

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-S64C2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-28 05:05:37] [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 05:05:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 05:05:39] [INFO ] Load time of PNML (sax parser for PT used): 1123 ms
[2026-05-28 05:05:39] [INFO ] Transformed 21462 places.
[2026-05-28 05:05:39] [INFO ] Transformed 21129 transitions.
[2026-05-28 05:05:39] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 1494 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (2201 resets) in 5240 ms. (7 steps per ms) remains 7/16 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (112 resets) in 1490 ms. (26 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (112 resets) in 1424 ms. (28 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (63 resets) in 383 ms. (104 steps per ms) remains 6/7 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (44 resets) in 322 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (112 resets) in 654 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (98 resets) in 240 ms. (165 steps per ms) remains 5/6 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (112 resets) in 207 ms. (192 steps per ms) remains 4/5 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-11 TRUE 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-8465530096172902204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11013158730264095649.kers'
[2026-05-28 05:05:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8465530096172902204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11013158730264095649.kers]
Culling duplicate invariants (modulo rational): removing 68 columns.
Culled 68 columns in 31 ms.
// Phase 1: matrix 21129 rows 21394 cols 59092 entries
[2026-05-28 05:05:43] [INFO ] Flatten gal took : 2009 ms
Finished phase 1 with 12711 SingleSign rule and 8418 generalized
[2026-05-28 05:05:44] [INFO ] Computed 333 invariants in 981 ms
Computed 333 P flows in 987 ms.
Exported basis to /tmp/petrispot-output-11013158730264095649.kers
Total runtime 1012 ms.
[2026-05-28 05:05:44] [INFO ] Flatten gal took : 659 ms
[2026-05-28 05:05:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7347645280990385762.gal : 430 ms
Excessive predecessor constraint size, skipping predecessor.
[2026-05-28 05:05:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4294522896622160998.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/ReachabilityCardinality7347645280990385762.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4294522896622160998.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 ...328
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 19066/42591 variables, and 78 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5168 ms.
Refiners :[Positive P Invariants (semi-flows): 78/132 constraints, Generalized P Invariants (flows): 0/201 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Loading property file /tmp/ReachabilityCardinality4294522896622160998.prop.
At refinement iteration 1 (OVERLAPS) 18893/19066 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19066 variables, 25/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 19066/42591 variables, and 103 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5135 ms.
Refiners :[Positive P Invariants (semi-flows): 78/132 constraints, Generalized P Invariants (flows): 25/201 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12182ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 173 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 11195 are kept as prefixes of interest. Removing 10267 places using SCC suffix rule.55 ms
Discarding 10267 places :
Also discarding 4861 output transitions
Drop transitions (Output transitions of discarded places.) removed 4861 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1134 transitions
Reduce isomorphic transitions removed 1134 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3546 transitions
Trivial Post-agglo rules discarded 3546 transitions
Performed 3546 trivial Post agglomeration. Transition count delta: 3546
Iterating post reduction 0 with 4680 rules applied. Total rules applied 4681 place count 11195 transition count 11588
Reduce places removed 3547 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 3557 rules applied. Total rules applied 8238 place count 7648 transition count 11578
Reduce places removed 10 places and 0 transitions.
Performed 1238 Post agglomeration using F-continuation condition.Transition count delta: 1238
Iterating post reduction 2 with 1248 rules applied. Total rules applied 9486 place count 7638 transition count 10340
Reduce places removed 1238 places and 0 transitions.
Iterating post reduction 3 with 1238 rules applied. Total rules applied 10724 place count 6400 transition count 10340
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 79 Pre rules applied. Total rules applied 10724 place count 6400 transition count 10261
Deduced a syphon composed of 79 places in 13 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 10882 place count 6321 transition count 10261
Discarding 2910 places :
Symmetric choice reduction at 4 with 2910 rule applications. Total rules 13792 place count 3411 transition count 7351
Iterating global reduction 4 with 2910 rules applied. Total rules applied 16702 place count 3411 transition count 7351
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 16733 place count 3380 transition count 7320
Iterating global reduction 4 with 31 rules applied. Total rules applied 16764 place count 3380 transition count 7320
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 16765 place count 3379 transition count 7320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 16767 place count 3378 transition count 7319
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 16779 place count 3378 transition count 7307
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 16791 place count 3366 transition count 7307
Partial Free-agglomeration rule applied 249 times.
Drop transitions (Partial Free agglomeration) removed 249 transitions
Iterating global reduction 6 with 249 rules applied. Total rules applied 17040 place count 3366 transition count 7307
Applied a total of 17040 rules in 6763 ms. Remains 3366 /21462 variables (removed 18096) and now considering 7307/21129 (removed 13822) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6778 ms. Remains : 3366/21462 places, 7307/21129 transitions.
RANDOM walk for 40000 steps (4144 resets) in 2658 ms. (15 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (142 resets) in 490 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (142 resets) in 626 ms. (63 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (84 resets) in 275 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (142 resets) in 491 ms. (81 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 14677 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :0 out of 4
Probabilistic random walk after 14677 steps, saw 6826 distinct states, run finished after 3008 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-28 05:06:06] [INFO ] Flow matrix only has 5992 transitions (discarded 1315 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1295964736382889394.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9953223837256793021.kers'
[2026-05-28 05:06:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1295964736382889394.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9953223837256793021.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 7 ms.
// Phase 1: matrix 5992 rows 3365 cols 17575 entries
Finished phase 1 with 3023 SingleSign rule and 219 generalized
[2026-05-28 05:06:06] [INFO ] Computed 124 invariants in 62 ms
Computed 124 P flows in 62 ms.
Exported basis to /tmp/petrispot-output-9953223837256793021.kers
Total runtime 68 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1394/1567 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1567 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/1568 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1568 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3580/5148 variables, 1568/1619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/5148 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-01 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-05 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 3273/8421 variables, 861/2480 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8421 variables, 56/2536 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8421 variables, 0/2536 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 931/9352 variables, 17/2553 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9352 variables, 931/3484 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/9352 variables, 0/3484 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/9358 variables, 6/3490 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/9358 variables, 0/3490 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/9358 variables, 0/3490 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9358/9358 variables, and 3490 constraints, problems are : Problem set: 2 solved, 2 unsolved in 11350 ms.
Refiners :[Generalized P Invariants (flows): 124/124 constraints, State Equation: 3366/3366 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 752/847 variables, 29/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/847 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/848 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/848 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2002/2850 variables, 848/878 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2850 variables, 0/878 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4715/7565 variables, 739/1617 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7565 variables, 53/1670 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7565 variables, 0/1670 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1583/9148 variables, 41/1711 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9148 variables, 1569/3280 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/9148 variables, 0/3280 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 210/9358 variables, 210/3490 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/9358 variables, 0/3490 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/9358 variables, 0/3490 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9358/9358 variables, and 3490 constraints, problems are : Problem set: 2 solved, 2 unsolved in 8666 ms.
Refiners :[Generalized P Invariants (flows): 124/124 constraints, State Equation: 3366/3366 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20223ms problems are : Problem set: 2 solved, 2 unsolved
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
FORMULA LeafsetExtension-PT-S64C2-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 42 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 48740 ms.

BK_STOP 1779944786769

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

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