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.r146-tall-177961074000111.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 FunctionPointer-PT-b128, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 6.8K Mar 7 07:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 7 07:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 7 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 7 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 07:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 7 07:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 07:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 7 07:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b128-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-01
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-02
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-04
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-05
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-08
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-10
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-11
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-12
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-13
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-14
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779683052830

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-25 04:24:13] [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-25 04:24:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 04:24:14] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2026-05-25 04:24:14] [INFO ] Transformed 306 places.
[2026-05-25 04:24:14] [INFO ] Transformed 840 transitions.
[2026-05-25 04:24:14] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40044 steps (27 resets) in 1038 ms. (38 steps per ms) remains 3/9 properties
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 04:24:14] [INFO ] Flatten gal took : 129 ms
BEST_FIRST walk for 40002 steps (8 resets) in 335 ms. (119 steps per ms) remains 3/3 properties
[2026-05-25 04:24:14] [INFO ] Flatten gal took : 139 ms
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
[2026-05-25 04:24:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9895418709605163805.gal : 64 ms
[2026-05-25 04:24:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5399592888107644670.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/ReachabilityCardinality9895418709605163805.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5399592888107644670.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2026-05-25 04:24:14] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13242809615666460503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18026371315285410488.kers'

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
[2026-05-25 04:24:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13242809615666460503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18026371315285410488.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 414 rows 221 cols 1114 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-25 04:24:14] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18026371315285410488.kers
Total runtime 3 ms.
[2026-05-25 04:24:14] [INFO ] State equation strengthened by 65 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality5399592888107644670.prop.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :31 after 1115
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem FunctionPointer-PT-b128-ReachabilityFireability-2024-07 is UNSAT
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-b128-ReachabilityFireability-2024-13 is UNSAT
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 73/115 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/116 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 331/447 variables, 116/120 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 57/177 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/177 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 163/610 variables, 84/261 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 8/269 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/610 variables, 0/269 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/636 variables, 22/291 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/636 variables, 0/291 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/636 variables, 0/291 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 636/636 variables, and 291 constraints, problems are : Problem set: 2 solved, 1 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 222/222 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/93 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/94 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 244/338 variables, 94/98 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 57/155 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 227/565 variables, 78/233 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 8/241 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/241 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 71/636 variables, 50/291 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/636 variables, 1/292 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/636 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/636 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 636/636 variables, and 292 constraints, problems are : Problem set: 2 solved, 1 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 222/222 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 945ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 12 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 212 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 28 place count 185 transition count 516
Iterating global reduction 0 with 27 rules applied. Total rules applied 55 place count 185 transition count 516
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 105 place count 185 transition count 466
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 118 place count 172 transition count 440
Iterating global reduction 1 with 13 rules applied. Total rules applied 131 place count 172 transition count 440
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 143 place count 172 transition count 428
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 149 place count 166 transition count 416
Iterating global reduction 2 with 6 rules applied. Total rules applied 155 place count 166 transition count 416
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 161 place count 160 transition count 392
Iterating global reduction 2 with 6 rules applied. Total rules applied 167 place count 160 transition count 392
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 173 place count 154 transition count 380
Iterating global reduction 2 with 6 rules applied. Total rules applied 179 place count 154 transition count 380
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 183 place count 150 transition count 364
Iterating global reduction 2 with 4 rules applied. Total rules applied 187 place count 150 transition count 364
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 191 place count 146 transition count 348
Iterating global reduction 2 with 4 rules applied. Total rules applied 195 place count 146 transition count 348
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 199 place count 142 transition count 340
Iterating global reduction 2 with 4 rules applied. Total rules applied 203 place count 142 transition count 340
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 207 place count 138 transition count 332
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 138 transition count 332
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 215 place count 134 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 219 place count 134 transition count 324
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 223 place count 130 transition count 316
Iterating global reduction 2 with 4 rules applied. Total rules applied 227 place count 130 transition count 316
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 230 place count 127 transition count 310
Iterating global reduction 2 with 3 rules applied. Total rules applied 233 place count 127 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 241 place count 127 transition count 302
Applied a total of 241 rules in 151 ms. Remains 127 /222 variables (removed 95) and now considering 302/648 (removed 346) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 127/222 places, 302/648 transitions.
RANDOM walk for 40082 steps (22 resets) in 464 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1115 after 336018
Interrupted probabilistic random walk after 1377942 steps, run timeout after 3001 ms. (steps per millisecond=459 ) properties seen :0 out of 1
Probabilistic random walk after 1377942 steps, saw 900258 distinct states, run finished after 3005 ms. (steps per millisecond=458 ) properties seen :0
[2026-05-25 04:24:19] [INFO ] Flow matrix only has 208 transitions (discarded 94 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8345786083497969036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8549386774552696135.kers'
[2026-05-25 04:24:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8345786083497969036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8549386774552696135.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 127 cols 578 entries
Finished phase 1 with 124 SingleSign rule and 1 generalized
[2026-05-25 04:24:19] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8549386774552696135.kers
Total runtime 1 ms.
[2026-05-25 04:24:19] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/227 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 41/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 84/311 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/335 variables, 18/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/335 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/227 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 41/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 84/311 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/335 variables, 18/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/335 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 886ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7647 steps, including 28 resets, run visited all 1 properties in 14 ms. (steps per millisecond=546 )
FORMULA FunctionPointer-PT-b128-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 24 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 6285 ms.

BK_STOP 1779683060286

--------------------
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="FunctionPointer-PT-b128"
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 FunctionPointer-PT-b128, 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 r146-tall-177961074000111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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