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.r223-tall-171649610600079.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 greatspnxred
Input is JoinFreeModules-PT-1000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610600079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 14:22 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 3.1M 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 JoinFreeModules-PT-1000-ReachabilityFireability-2024-00
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-01
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-02
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-03
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-04
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-05
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-06
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-07
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-08
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-09
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-10
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-11
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-12
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-13
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-14
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716505590142

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-1000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 23:06:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 23:06:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 23:06:31] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2024-05-23 23:06:31] [INFO ] Transformed 5001 places.
[2024-05-23 23:06:31] [INFO ] Transformed 8001 transitions.
[2024-05-23 23:06:31] [INFO ] Parsed PT model containing 5001 places and 8001 transitions and 23002 arcs in 452 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 41065 steps (8 resets) in 2950 ms. (13 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4002 ms. (9 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2694 ms. (14 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1990 ms. (20 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2356 ms. (16 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2182 ms. (18 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1865 ms. (21 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1793 ms. (22 steps per ms) remains 8/9 properties
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1852 ms. (21 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1869 ms. (21 steps per ms) remains 8/8 properties
// Phase 1: matrix 8001 rows 5000 cols
[2024-05-23 23:06:38] [INFO ] Computed 1000 invariants in 57 ms
[2024-05-23 23:06:38] [INFO ] State equation strengthened by 1000 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 367/460 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 736/1196 variables, 460/552 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1196 variables, 92/644 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1196 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/1196 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1196/13001 variables, and 644 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 92/1000 constraints, State Equation: 460/5000 constraints, ReadFeed: 92/1000 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 367/460 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 23:06:39] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 22 ms to minimize.
[2024-05-23 23:06:40] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 10 ms to minimize.
[2024-05-23 23:06:40] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-23 23:06:40] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2024-05-23 23:06:40] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-23 23:06:40] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-23 23:06:40] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-23 23:06:40] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-23 23:06:40] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-23 23:06:40] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-23 23:06:40] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-05-23 23:06:40] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-23 23:06:40] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-23 23:06:40] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 4 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-23 23:06:41] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 23:06:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 736/1196 variables, 460/598 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1196 variables, 92/690 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1196 variables, 8/698 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 23:06:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1196/13001 variables, and 699 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 92/1000 constraints, State Equation: 460/5000 constraints, ReadFeed: 92/1000 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 47/47 constraints]
After SMT, in 6308ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 460 are kept as prefixes of interest. Removing 4540 places using SCC suffix rule.12 ms
Discarding 4540 places :
Also discarding 7264 output transitions
Drop transitions (Output transitions of discarded places.) removed 7264 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 736
Applied a total of 2 rules in 120 ms. Remains 460 /5000 variables (removed 4540) and now considering 736/8001 (removed 7265) transitions.
Running 552 sub problems to find dead transitions.
// Phase 1: matrix 736 rows 460 cols
[2024-05-23 23:06:44] [INFO ] Computed 92 invariants in 2 ms
[2024-05-23 23:06:44] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (OVERLAPS) 92/460 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (OVERLAPS) 736/1196 variables, 460/552 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1196 variables, 92/644 constraints. Problems are: Problem set: 0 solved, 552 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1196/1196 variables, and 644 constraints, problems are : Problem set: 0 solved, 552 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 92/92 constraints, State Equation: 460/460 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (OVERLAPS) 92/460 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (OVERLAPS) 736/1196 variables, 460/552 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1196 variables, 92/644 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1196 variables, 552/1196 constraints. Problems are: Problem set: 0 solved, 552 unsolved
[2024-05-23 23:07:16] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 23:07:17] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-23 23:07:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 23:07:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-23 23:07:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-23 23:07:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 23:07:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 23:07:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-23 23:07:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-23 23:07:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-23 23:07:23] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 23:07:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1196/1196 variables, and 1208 constraints, problems are : Problem set: 0 solved, 552 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 92/92 constraints, State Equation: 460/460 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 12/12 constraints]
After SMT, in 40150ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 40158ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40304 ms. Remains : 460/5000 places, 736/8001 transitions.
RANDOM walk for 41065 steps (8 resets) in 227 ms. (180 steps per ms) remains 7/8 properties
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
[2024-05-23 23:07:25] [INFO ] Invariant cache hit.
[2024-05-23 23:07:25] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 203/255 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 408/663 variables, 255/306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/663 variables, 51/357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/663 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/1196 variables, and 357 constraints, problems are : Problem set: 0 solved, 7 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 51/92 constraints, State Equation: 255/460 constraints, ReadFeed: 51/92 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 203/255 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-23 23:07:26] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-23 23:07:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-23 23:07:27] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 408/663 variables, 255/333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 51/384 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 7/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 23:07:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-23 23:07:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 23:07:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/663 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 663/1196 variables, and 394 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2349 ms.
Refiners :[Positive P Invariants (semi-flows): 51/92 constraints, State Equation: 255/460 constraints, ReadFeed: 51/92 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 30/30 constraints]
After SMT, in 2767ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Finished Parikh walk after 31117 steps, including 0 resets, run visited all 7 properties in 502 ms. (steps per millisecond=61 )
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2024-02 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 )
Parikh walk visited 7 properties in 510 ms.
All properties solved without resorting to model-checking.
Total runtime 57613 ms.
ITS solved all properties within timeout

BK_STOP 1716505648934

--------------------
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="JoinFreeModules-PT-1000"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is JoinFreeModules-PT-1000, 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 r223-tall-171649610600079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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