Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640603100319.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is FunctionPointer-PT-c064, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603100319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 16:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-01
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-02
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-04
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-05
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-08
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-10
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-11
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-12
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-13
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-14
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717194873056

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:34:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:34:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:34:34] [INFO ] Load time of PNML (sax parser for PT used): 412 ms
[2024-05-31 22:34:34] [INFO ] Transformed 2826 places.
[2024-05-31 22:34:34] [INFO ] Transformed 8960 transitions.
[2024-05-31 22:34:34] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 597 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 55 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40067 steps (8 resets) in 3118 ms. (12 steps per ms) remains 10/12 properties
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 371 ms. (107 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1520 ms. (26 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
[2024-05-31 22:34:36] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 22:34:36] [INFO ] Computed 4 invariants in 92 ms
[2024-05-31 22:34:36] [INFO ] State equation strengthened by 479 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FunctionPointer-PT-c064-ReachabilityFireability-2024-01 is UNSAT
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-c064-ReachabilityFireability-2024-07 is UNSAT
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-c064-ReachabilityFireability-2024-10 is UNSAT
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-c064-ReachabilityFireability-2024-15 is UNSAT
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 523/588 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/589 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1579/2168 variables, 589/593 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2168 variables, 403/996 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2168 variables, 0/996 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1749/3917 variables, 493/1489 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3917 variables, 76/1565 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3917 variables, 0/1565 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 650/4567 variables, 398/1963 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4567 variables, 0/1963 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 420/4987 variables, 95/2058 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4987 variables, 0/2058 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 181/5168 variables, 53/2111 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 4 solved, 6 unsolved in 3119 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 10/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 528/572 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-31 22:34:40] [INFO ] Deduced a trap composed of 135 places in 237 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/573 variables, 1/5 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1506/2079 variables, 573/578 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2079 variables, 399/977 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2079 variables, 0/977 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1705/3784 variables, 472/1449 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3784 variables, 80/1529 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3784 variables, 5/1534 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-31 22:34:43] [INFO ] Deduced a trap composed of 131 places in 196 ms of which 16 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3784 variables, 1/1535 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3784 variables, 0/1535 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 675/4459 variables, 412/1947 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4459/5168 variables, and 1947 constraints, problems are : Problem set: 4 solved, 6 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1457/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 8719ms problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.13 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 288 place count 1324 transition count 3848
Iterating global reduction 0 with 287 rules applied. Total rules applied 575 place count 1324 transition count 3848
Ensure Unique test removed 458 transitions
Reduce isomorphic transitions removed 458 transitions.
Iterating post reduction 0 with 458 rules applied. Total rules applied 1033 place count 1324 transition count 3390
Discarding 144 places :
Symmetric choice reduction at 1 with 144 rule applications. Total rules 1177 place count 1180 transition count 3102
Iterating global reduction 1 with 144 rules applied. Total rules applied 1321 place count 1180 transition count 3102
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 1429 place count 1180 transition count 2994
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1442 place count 1167 transition count 2968
Iterating global reduction 2 with 13 rules applied. Total rules applied 1455 place count 1167 transition count 2968
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1468 place count 1154 transition count 2942
Iterating global reduction 2 with 13 rules applied. Total rules applied 1481 place count 1154 transition count 2942
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1494 place count 1141 transition count 2916
Iterating global reduction 2 with 13 rules applied. Total rules applied 1507 place count 1141 transition count 2916
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1520 place count 1128 transition count 2890
Iterating global reduction 2 with 13 rules applied. Total rules applied 1533 place count 1128 transition count 2890
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1546 place count 1115 transition count 2864
Iterating global reduction 2 with 13 rules applied. Total rules applied 1559 place count 1115 transition count 2864
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1572 place count 1102 transition count 2838
Iterating global reduction 2 with 13 rules applied. Total rules applied 1585 place count 1102 transition count 2838
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1598 place count 1089 transition count 2812
Iterating global reduction 2 with 13 rules applied. Total rules applied 1611 place count 1089 transition count 2812
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1651 place count 1049 transition count 2666
Iterating global reduction 2 with 40 rules applied. Total rules applied 1691 place count 1049 transition count 2666
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1737 place count 1003 transition count 2482
Iterating global reduction 2 with 46 rules applied. Total rules applied 1783 place count 1003 transition count 2482
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 1828 place count 958 transition count 2364
Iterating global reduction 2 with 45 rules applied. Total rules applied 1873 place count 958 transition count 2364
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 1917 place count 914 transition count 2276
Iterating global reduction 2 with 44 rules applied. Total rules applied 1961 place count 914 transition count 2276
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 2004 place count 871 transition count 2190
Iterating global reduction 2 with 43 rules applied. Total rules applied 2047 place count 871 transition count 2190
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 2090 place count 828 transition count 2104
Iterating global reduction 2 with 43 rules applied. Total rules applied 2133 place count 828 transition count 2104
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 2175 place count 786 transition count 2020
Iterating global reduction 2 with 42 rules applied. Total rules applied 2217 place count 786 transition count 2020
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 2230 place count 773 transition count 1994
Iterating global reduction 2 with 13 rules applied. Total rules applied 2243 place count 773 transition count 1994
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 2 with 36 rules applied. Total rules applied 2279 place count 773 transition count 1958
Applied a total of 2279 rules in 1337 ms. Remains 773 /1628 variables (removed 855) and now considering 1958/5962 (removed 4004) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1348 ms. Remains : 773/1628 places, 1958/5962 transitions.
RANDOM walk for 40106 steps (8 resets) in 323 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 202764 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :1 out of 6
Probabilistic random walk after 202764 steps, saw 131625 distinct states, run finished after 3004 ms. (steps per millisecond=67 ) properties seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-31 22:34:50] [INFO ] Flow matrix only has 1329 transitions (discarded 629 similar events)
// Phase 1: matrix 1329 rows 773 cols
[2024-05-31 22:34:50] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 22:34:50] [INFO ] State equation strengthened by 327 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 383/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 979/1371 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1371 variables, 238/631 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1371 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 556/1927 variables, 247/878 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1927 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1927 variables, 89/968 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1927 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 127/2054 variables, 108/1076 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2054 variables, 0/1076 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 35/2089 variables, 15/1091 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2089 variables, 0/1091 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 13/2102 variables, 11/1102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2102 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/2102 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2102/2102 variables, and 1102 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1976 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 773/773 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 383/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 979/1371 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1371 variables, 238/631 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1371 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 556/1927 variables, 247/878 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1927 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1927 variables, 89/968 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1927 variables, 5/973 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:34:53] [INFO ] Deduced a trap composed of 131 places in 99 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1927 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1927 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 127/2054 variables, 108/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2054 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 35/2089 variables, 15/1097 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2089 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 13/2102 variables, 11/1108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2102 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/2102 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2102/2102 variables, and 1108 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3758 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 773/773 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 5828ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 113402 steps, including 226 resets, run visited all 5 properties in 613 ms. (steps per millisecond=184 )
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 628 ms.
All properties solved without resorting to model-checking.
Total runtime 22422 ms.
ITS solved all properties within timeout

BK_STOP 1717194896652

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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-c064"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-c064, 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 r496-tall-171640603100319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c064.tgz
mv FunctionPointer-PT-c064 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;