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.r354-tall-178024402900231.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 SupplyChain-PT-01000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402900231
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.2K May 27 07:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 27 07:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 07:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 27 07:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 11:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 11:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.6K May 27 07:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 27 07:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 27 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 27 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 11:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 4.1M May 26 18:17 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 SupplyChain-PT-01000-ReachabilityFireability-2024-00
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-01
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-02
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-03
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-04
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-05
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-06
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-07
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-08
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-09
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-10
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-11
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-12
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-13
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-14
FORMULA_NAME SupplyChain-PT-01000-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780261591430

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-01000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-31 21:06:32] [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-31 21:06:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 21:06:33] [INFO ] Load time of PNML (sax parser for PT used): 412 ms
[2026-05-31 21:06:33] [INFO ] Transformed 13004 places.
[2026-05-31 21:06:33] [INFO ] Transformed 8003 transitions.
[2026-05-31 21:06:33] [INFO ] Parsed PT model containing 13004 places and 8003 transitions and 36006 arcs in 584 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2026-05-31 21:06:36] [INFO ] Flatten gal took : 2286 ms
[2026-05-31 21:06:37] [INFO ] Flatten gal took : 945 ms
RANDOM walk for 40000 steps (8 resets) in 14618 ms. (2 steps per ms) remains 9/16 properties
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-31 21:06:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13546842931932177008.gal : 246 ms
[2026-05-31 21:06:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8842679210974685454.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/ReachabilityCardinality13546842931932177008.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8842679210974685454.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
BEST_FIRST walk for 40004 steps (8 resets) in 1930 ms. (20 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1881 ms. (21 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1634 ms. (24 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1396 ms. (28 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1592 ms. (25 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1325 ms. (30 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1470 ms. (27 steps per ms) remains 8/9 properties
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1605 ms. (24 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality8842679210974685454.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 1452 ms. (27 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13682081727450704576.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17083506896507570565.kers'
[2026-05-31 21:06:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13682081727450704576.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17083506896507570565.kers]
Normalized transition count is 8002 out of 8003 initially.
Culling duplicate invariants (modulo rational): removing 3090 columns.
Culled 3090 columns in 12 ms.
// Phase 1: matrix 8002 rows 9914 cols 26004 entries
Finished phase 1 with 5912 SingleSign rule and 1000 generalized
[2026-05-31 21:06:41] [INFO ] Computed 6092 invariants in 81 ms
Computed 6092 P flows in 83 ms.
Exported basis to /tmp/petrispot-output-17083506896507570565.kers
Total runtime 91 ms.
[2026-05-31 21:06:41] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem SupplyChain-PT-01000-ReachabilityFireability-2024-04 is UNSAT
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem SupplyChain-PT-01000-ReachabilityFireability-2024-05 is UNSAT
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem SupplyChain-PT-01000-ReachabilityFireability-2024-09 is UNSAT
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem SupplyChain-PT-01000-ReachabilityFireability-2024-12 is UNSAT
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1784/2053 variables, 244/283 constraints. Problems are: Problem set: 4 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/2053 variables, 18/301 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2053 variables, 0/301 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6539/8592 variables, 1758/2059 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8592 variables, 0/2059 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4412/13004 variables, 4033/6092 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13004 variables, 0/6092 constraints. Problems are: Problem set: 4 solved, 4 unsolved
SMT process timed out in 5391ms, After SMT, problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 145 out of 13004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13004/13004 places, 8003/8003 transitions.
Graph (complete) has 34362 edges and 13004 vertex of which 11001 are kept as prefixes of interest. Removing 2003 places using SCC suffix rule.33 ms
Discarding 2003 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2068 places
Iterating post reduction 0 with 2068 rules applied. Total rules applied 2069 place count 8933 transition count 8000
Performed 965 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 965 Pre rules applied. Total rules applied 2069 place count 8933 transition count 7035
Deduced a syphon composed of 965 places in 5 ms
Ensure Unique test removed 965 places
Reduce places removed 1930 places and 0 transitions.
Iterating global reduction 1 with 2895 rules applied. Total rules applied 4964 place count 7003 transition count 7035
Free-agglomeration rule applied 1849 times.
Iterating global reduction 1 with 1849 rules applied. Total rules applied 6813 place count 7003 transition count 5186
Ensure Unique test removed 981 places
Reduce places removed 2830 places and 0 transitions.
Ensure Unique test removed 981 transitions
Reduce isomorphic transitions removed 981 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 937 transitions
Trivial Post-agglo rules discarded 937 transitions
Performed 937 trivial Post agglomeration. Transition count delta: 937
Iterating post reduction 1 with 4748 rules applied. Total rules applied 11561 place count 4173 transition count 3268
Reduce places removed 937 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 947 rules applied. Total rules applied 12508 place count 3236 transition count 3258
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 12518 place count 3226 transition count 3258
Performed 971 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 971 Pre rules applied. Total rules applied 12518 place count 3226 transition count 2287
Deduced a syphon composed of 971 places in 2 ms
Reduce places removed 971 places and 0 transitions.
Iterating global reduction 4 with 1942 rules applied. Total rules applied 14460 place count 2255 transition count 2287
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 14471 place count 2255 transition count 2276
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 14482 place count 2244 transition count 2276
Applied a total of 14482 rules in 3752 ms. Remains 2244 /13004 variables (removed 10760) and now considering 2276/8003 (removed 5727) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3766 ms. Remains : 2244/13004 places, 2276/8003 transitions.
RANDOM walk for 40000 steps (232 resets) in 2783 ms. (14 steps per ms) remains 3/4 properties
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 946 ms. (42 steps per ms) remains 2/3 properties
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 972 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 779 ms. (51 steps per ms) remains 1/2 properties
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-10 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-1535912042916935300.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12867659088705054885.kers'
[2026-05-31 21:06:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1535912042916935300.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12867659088705054885.kers]
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 3 ms.
// Phase 1: matrix 2276 rows 2222 cols 4715 entries
Finished phase 1 with 2113 SingleSign rule and 54 generalized
[2026-05-31 21:06:52] [INFO ] Computed 77 invariants in 72 ms
Computed 77 P flows in 72 ms.
Exported basis to /tmp/petrispot-output-12867659088705054885.kers
Total runtime 78 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 992/1085 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1085 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 43/1128 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1226/2354 variables, 1128/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2354 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2041/4395 variables, 1033/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4395 variables, 4/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4395 variables, 0/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/4399 variables, 4/2218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4399 variables, 4/2222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4399 variables, 0/2222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 98/4497 variables, 56/2278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4497 variables, 13/2291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4497 variables, 0/2291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/4504 variables, 7/2298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4504 variables, 7/2305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4504 variables, 0/2305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 16/4520 variables, 16/2321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4520 variables, 0/2321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/4520 variables, 0/2321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4520/4520 variables, and 2321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1253 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 76/76 constraints, State Equation: 2244/2244 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 992/1085 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1085 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 43/1128 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1226/2354 variables, 1128/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2354 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2041/4395 variables, 1033/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4395 variables, 4/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4395 variables, 0/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/4399 variables, 4/2218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4399 variables, 4/2222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4399 variables, 0/2222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 98/4497 variables, 56/2278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4497 variables, 13/2291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4497 variables, 0/2291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/4504 variables, 7/2298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4504 variables, 7/2305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4504 variables, 0/2305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 16/4520 variables, 16/2321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4520 variables, 0/2321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/4520 variables, 0/2321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4520/4520 variables, and 2321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1805 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 76/76 constraints, State Equation: 2244/2244 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3171ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 463 steps, including 0 resets, run visited all 1 properties in 29 ms. (steps per millisecond=15 )
FORMULA SupplyChain-PT-01000-ReachabilityFireability-2024-03 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 38 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 22827 ms.

BK_STOP 1780261615690

--------------------
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="SupplyChain-PT-01000"
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 SupplyChain-PT-01000, 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 r354-tall-178024402900231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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