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.r050-smll-177946901100159.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 Champagne-PT-H10T1U, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901100159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K Mar 6 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 6 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 10:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 10:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 6 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 6 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 6 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 612K 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 Champagne-PT-H10T1U-ReachabilityFireability-2024-00
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-01
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-02
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-03
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-04
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-05
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-06
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-07
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-08
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-09
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-10
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-11
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-12
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-13
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-14
FORMULA_NAME Champagne-PT-H10T1U-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779547196045

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H10T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-23 14:39:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 14:39:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 14:39:59] [INFO ] Load time of PNML (sax parser for PT used): 454 ms
[2026-05-23 14:39:59] [INFO ] Transformed 1637 places.
[2026-05-23 14:39:59] [INFO ] Transformed 2633 transitions.
[2026-05-23 14:39:59] [INFO ] Found NUPN structural information;
[2026-05-23 14:39:59] [INFO ] Parsed PT model containing 1637 places and 2633 transitions and 7256 arcs in 718 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (31 resets) in 3220 ms. (12 steps per ms) remains 4/16 properties
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1064 ms. (37 steps per ms) remains 4/4 properties
[2026-05-23 14:40:01] [INFO ] Flatten gal took : 746 ms
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 505 ms. (79 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 577 ms. (69 steps per ms) remains 4/4 properties
[2026-05-23 14:40:01] [INFO ] Flatten gal took : 460 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16454791494189869053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12168812212148796253.kers'
[2026-05-23 14:40:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16454791494189869053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12168812212148796253.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 2633 rows 1637 cols 7256 entries
Finished phase 1 with 1574 SingleSign rule and 0 generalized
[2026-05-23 14:40:01] [INFO ] Computed 63 invariants in 28 ms
Computed 63 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-12168812212148796253.kers
Total runtime 42 ms.
[2026-05-23 14:40:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11683365911483887510.gal : 137 ms
[2026-05-23 14:40:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3488564641511399803.prop : 4 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/ReachabilityCardinality11683365911483887510.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3488564641511399803.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
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality3488564641511399803.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1402/1537 variables, 59/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1537 variables, 1402/1596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1537 variables, 0/1596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 100/1637 variables, 4/1600 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1637 variables, 100/1700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1637 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2633/4270 variables, 1637/3337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4270 variables, 0/3337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/4270 variables, 0/3337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4270/4270 variables, and 3337 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4542 ms.
Refiners :[Domain max(s): 1637/1637 constraints, Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 1637/1637 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/135 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 14
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :14 after 15
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1402/1537 variables, 59/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :15 after 1540
At refinement iteration 3 (INCLUDED_ONLY) 0/1537 variables, 1402/1596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1537 variables, 1/1597 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 10003ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 135 out of 1637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1637/1637 places, 2633/2633 transitions.
Graph (trivial) has 1254 edges and 1637 vertex of which 181 / 1637 are part of one of the 26 SCC in 39 ms
Free SCC test removed 155 places
Drop transitions (Empty/Sink Transition effects.) removed 189 transitions
Reduce isomorphic transitions removed 189 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 528 transitions
Trivial Post-agglo rules discarded 528 transitions
Performed 528 trivial Post agglomeration. Transition count delta: 528
Iterating post reduction 0 with 528 rules applied. Total rules applied 529 place count 1482 transition count 1916
Reduce places removed 528 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 620 rules applied. Total rules applied 1149 place count 954 transition count 1824
Reduce places removed 45 places and 0 transitions.
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Iterating post reduction 2 with 121 rules applied. Total rules applied 1270 place count 909 transition count 1748
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 84 rules applied. Total rules applied 1354 place count 833 transition count 1740
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1358 place count 829 transition count 1740
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 91 Pre rules applied. Total rules applied 1358 place count 829 transition count 1649
Deduced a syphon composed of 91 places in 5 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 5 with 182 rules applied. Total rules applied 1540 place count 738 transition count 1649
Discarding 221 places :
Symmetric choice reduction at 5 with 221 rule applications. Total rules 1761 place count 517 transition count 1428
Iterating global reduction 5 with 221 rules applied. Total rules applied 1982 place count 517 transition count 1428
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1989 place count 517 transition count 1421
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 1989 place count 517 transition count 1408
Deduced a syphon composed of 13 places in 12 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 2015 place count 504 transition count 1408
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2020 place count 499 transition count 1385
Iterating global reduction 6 with 5 rules applied. Total rules applied 2025 place count 499 transition count 1385
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2030 place count 499 transition count 1380
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 204 rules applied. Total rules applied 2234 place count 397 transition count 1278
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -172
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 2282 place count 373 transition count 1450
Drop transitions (Empty/Sink Transition effects.) removed 52 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 7 with 53 rules applied. Total rules applied 2335 place count 373 transition count 1397
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2336 place count 372 transition count 1393
Iterating global reduction 8 with 1 rules applied. Total rules applied 2337 place count 372 transition count 1393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2338 place count 372 transition count 1392
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 9 with 75 rules applied. Total rules applied 2413 place count 372 transition count 1317
Free-agglomeration rule applied 54 times.
Iterating global reduction 9 with 54 rules applied. Total rules applied 2467 place count 372 transition count 1263
Reduce places removed 54 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 9 with 107 rules applied. Total rules applied 2574 place count 318 transition count 1210
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 10 with 47 rules applied. Total rules applied 2621 place count 318 transition count 1163
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2622 place count 318 transition count 1162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2623 place count 317 transition count 1162
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 2633 place count 317 transition count 1162
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2634 place count 316 transition count 1161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 2637 place count 313 transition count 1161
Drop transitions (Redundant composition of simpler transitions.) removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 12 with 104 rules applied. Total rules applied 2741 place count 313 transition count 1057
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 1 rules applied. Total rules applied 2742 place count 313 transition count 1056
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2743 place count 312 transition count 1056
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 14 with 11 rules applied. Total rules applied 2754 place count 312 transition count 1056
Applied a total of 2754 rules in 902 ms. Remains 312 /1637 variables (removed 1325) and now considering 1056/2633 (removed 1577) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 912 ms. Remains : 312/1637 places, 1056/2633 transitions.
RANDOM walk for 40000 steps (8 resets) in 880 ms. (45 steps per ms) remains 3/4 properties
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 481 ms. (82 steps per ms) remains 2/3 properties
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 2/2 properties
[2026-05-23 14:40:13] [INFO ] Flow matrix only has 916 transitions (discarded 140 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13356056115437377639.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4848170388045042041.kers'
[2026-05-23 14:40:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13356056115437377639.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4848170388045042041.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 3 ms.
// Phase 1: matrix 916 rows 306 cols 2894 entries
Finished phase 1 with 252 SingleSign rule and 0 generalized
[2026-05-23 14:40:13] [INFO ] Computed 60 invariants in 7 ms
Computed 60 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4848170388045042041.kers
Total runtime 10 ms.
[2026-05-23 14:40:13] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 168/214 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/246 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 822/1068 variables, 246/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 11/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 126/1194 variables, 44/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1194 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1194 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1194 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 19/1213 variables, 8/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1213 variables, 9/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1213 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/1216 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1216 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1216 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 12/1228 variables, 12/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1228 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1228 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1228 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1228/1228 variables, and 387 constraints, problems are : Problem set: 0 solved, 2 unsolved in 814 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, State Equation: 312/312 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 168/214 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/246 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 822/1068 variables, 246/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 11/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 126/1194 variables, 44/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1194 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1194 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1194 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 19/1213 variables, 8/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1213 variables, 9/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1213 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/1216 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1216 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1216 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 12/1228 variables, 12/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1228 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1228 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1228 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1228/1228 variables, and 387 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1452 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, State Equation: 312/312 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2332ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
FORMULA Champagne-PT-H10T1U-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 106 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 16935 ms.

BK_STOP 1779547215617

--------------------
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="Champagne-PT-H10T1U"
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 Champagne-PT-H10T1U, 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 r050-smll-177946901100159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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